Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem.
Andrzej JaszkiewiczPiotr ZielniewiczPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- memetic algorithm
- bi objective
- path relinking
- tabu search
- multi objective
- multi objective optimization
- genetic algorithm
- metaheuristic
- simulated annealing
- evolutionary algorithm
- scatter search
- nsga ii
- multiple objectives
- multiobjective optimization
- combinatorial optimization
- optimization algorithm
- ant colony optimization
- vehicle routing problem
- efficient solutions
- heuristic methods
- crossover operator
- scheduling problem
- search procedure
- particle swarm optimization
- job shop scheduling problem
- feasible solution
- test problems
- traveling salesman problem
- benchmark instances
- neighborhood search
- timetabling problem
- optimization problems
- search algorithm
- objective function
- evolutionary computation
- variable neighborhood search
- solution space
- max min
- combinatorial optimization problems
- differential evolution
- network design
- search methods
- cost function