Speed-up techniques for solving large-scale biobjective TSP

DOI10.1016/j.cor.2009.01.005zbMath1173.90534OpenAlexW2086472385MaRDI QIDQ1038291

Andrzej Jaszkiewicz, Thibaut Lust

Publication date: 17 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.005

zbMATH Keywords

TSPlocal searchhybrid metaheuristicsspeed-up techniquesmultiobjective combinatorial optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, An evolutionary approach to generalized biobjective traveling salesperson problem, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, Many-objective Pareto local search, Proper balance between search towards and along Pareto front: biobjective TSP case study, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
• Bound sets for biobjective combinatorial optimization problems
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Two phase algorithms for the bi-objective assignment problem
• First vs. best improvement: an empirical study
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Bicriteria Transportation Problem
• TSPLIB—A Traveling Salesman Problem Library
• Fast Algorithms for Geometric Traveling Salesman Problems
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multicriteria Optimization