Name
Title | ||
|---|---|---|
Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem |
Abstract | ||
|---|---|---|
The paper presents an effective version of the Pareto memetic algorithm with path relinking and efficient local search for multiple objective traveling salesperson problem. In multiple objective Traveling salesperson problem (TSP), multiple costs are associated with each arc (link). The multiple costs may for example correspond to the financial cost of travel along a link, time of travel, or risk in the case of hazardous materials. The algorithm searches for new good solutions along paths in the decision space linking two other good solutions selected for recombination. Instead of a simple local search it uses short runs of tabu search based on the steepest version of the Lin–Kernighan algorithm. The efficiency of local search is further improved by the techniques of candidate moves and locked arcs. In the final step of the algorithm the neighborhood of each potentially Pareto-optimal solution is searched for new solutions that could be added to this set. The algorithm is compared experimentally to the state-of-the-art algorithms for multiple objective TSP. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejor.2007.10.054 | European Journal of Operational Research |
Keywords | Field | DocType |
Multiobjective optimization,Metaheuristics,Traveling salesperson problem | Memetic algorithm,Mathematical optimization,Search algorithm,Evolutionary algorithm,Algorithm,Combinatorial optimization,Travelling salesman problem,Local search (optimization),Mathematics,Tabu search,Metaheuristic | Journal |
Volume | Issue | ISSN |
193 | 3 | 0377-2217 |
Citations | PageRank | References |
18 | 0.82 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Jaszkiewicz | 1 | 660 | 50.68 |
| Piotr Zielniewicz | 2 | 102 | 6.26 |