An evolutionary approach to generalized biobjective traveling salesperson problem
DOI10.1016/j.cor.2016.04.027zbMath1391.90556OpenAlexW2342721647MaRDI QIDQ1652174
Diclehan Tezcaner Öztürk, Murat M. Köksalan
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.04.027
combinatorial optimizationmultiobjective decision makingevolutionary computationsmultiobjective traveling salesperson problem
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interactive approach for biobjective integer programs under quasiconvex preference functions
- Pyramidal tours and multiple objectives
- An interactive algorithm for multi-objective route planning
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- A comparison of solution strategies for biobjective shortest path problems
- Speed-up techniques for solving large-scale biobjective TSP
- Multicriteria optimization
- Multiobjective traveling salesperson problem on Halin graphs
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- A heuristic approach to bicriteria scheduling
This page was built for publication: An evolutionary approach to generalized biobjective traveling salesperson problem