Two-phase Pareto local search for the biobjective traveling salesman problem
Authors:
- 21 February 2009
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 16 (3) , 475-510
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Bound sets for biobjective combinatorial optimization problemsComputers & Operations Research, 2007
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem4OR, 2006
- Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study2004
- A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem2004
- Chained Lin-Kernighan for Large Traveling Salesman ProblemsINFORMS Journal on Computing, 2003
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimizationJournal of Multi-Criteria Decision Analysis, 1998
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSPINFORMS Journal on Computing, 1996
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- Bicriterion Path Problems1980
- Bicriteria Transportation ProblemManagement Science, 1979