MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problem.
Amaya Martínez-PurasJoaquín A. PachecoPublished in: Knowl. Based Syst. (2016)
Keyphrases
- bi objective
- tabu search
- routing problem
- vehicle routing problem
- nsga ii
- test problems
- scheduling problem
- scatter search
- resource constraints
- multi objective
- metaheuristic
- path relinking
- job shop scheduling problem
- simulated annealing
- variable neighborhood search
- vehicle routing problem with time windows
- multi objective optimization
- multi objective evolutionary algorithms
- heuristic methods
- feasible solution
- genetic algorithm
- efficient solutions
- memetic algorithm
- multiple objectives
- optimal solution
- pareto frontier
- benchmark problems
- hybrid algorithm
- evolutionary algorithm
- optimization problems
- shortest path
- traveling salesman problem
- ant colony optimization
- search algorithm
- routing algorithm
- combinatorial optimization problems
- particle swarm optimization
- np hard
- solution quality
- fitness function
- optimization algorithm
- travel time
- search strategies
- crossover operator
- network design
- genetic programming
- knapsack problem
- computational complexity