The Multiobjective Traveling Salesman Problem: A Survey and a New Approach

From MaRDI portal
Publication:3562823

DOI10.1007/978-3-642-11218-8_6zbMath1187.90257OpenAlexW1803713235MaRDI QIDQ3562823

Thibaut Lust, Jacques jun. Teghem

Publication date: 28 May 2010

Published in: Advances in Multi-Objective Nature Inspired Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11218-8_6




Related Items (20)

Variable and large neighborhood search to solve the multiobjective set covering problemGeneration of the exact Pareto set in multi-objective traveling salesman and set covering problemsThe \(L\)-shape search method for triobjective integer programmingNovel concave hull-based heuristic algorithm for TSPAnytime Pareto local searchAn evolutionary approach to generalized biobjective traveling salesperson problemExact algorithms for bi-objective ring tree problems with reliability measuresA hybrid approach for biobjective optimizationNetwork Models for Multiobjective Discrete OptimizationStrategies for Generating Well Centered Tetrahedral Meshes on Industrial GeometriesTrucks and drones cooperation in the last‐mile delivery processA Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear ProgrammingMultiobjective cloud particle optimization algorithm based on decompositionAn interactive approach for biobjective integer programs under quasiconvex preference functionsDisruption management in vehicle routing and scheduling for road freight transport: a reviewGreedy algorithms for a class of knapsack problems with binary weightsThe multiple shortest path problem with path deconflictionAn asymptotically tight online algorithm for \(m\)-steiner traveling salesman problemFPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programmingCombining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios


Uses Software



This page was built for publication: The Multiobjective Traveling Salesman Problem: A Survey and a New Approach