Proper balance between search towards and along Pareto front: biobjective TSP case study
- 21 February 2017
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 254 (1-2) , 111-130
Abstract
No abstract availableKeywords
Funding Information
- Polish National Science Center (UMO-2013/11/B/ST6/01075)
This publication has 20 references indexed in Scilit:
- The multiobjective multidimensional knapsack problem: a survey and a new approachInternational Transactions in Operational Research, 2012
- Speed-up techniques for solving large-scale biobjective TSPComputers & Operations Research, 2010
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problemEuropean Journal of Operational Research, 2009
- Two-phase Pareto local search for the biobjective traveling salesman problemJournal of Heuristics, 2009
- Bound sets for biobjective combinatorial optimization problemsComputers & Operations Research, 2007
- On local optima in multiobjective combinatorial optimization problemsAnnals of Operations Research, 2007
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matricesEuropean Journal of Operational Research, 2006
- A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic AlgorithmAnnals of Operations Research, 2004
- On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experimentIEEE Transactions on Evolutionary Computation, 2002
- Routing problems: A bibliographyAnnals of Operations Research, 1995