Heuristiques pour le Problème du Vendeurm-Péripatétique

DOI10.1051/RO/2009001MaRDI QIDQ3621973zbMATH OpenOpenAlexFDO

Authors Éric Duchenne, G. Laporte, F. Semet

Publication date 23 April 2009

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105419, http://www.rairo-ro.org/articles/ro/abs/2009/01/ro0606/ro0606.html

zbMATH Keywords

\(m\)-peripatetic salesman problemheuristicstravelling salesman problem

Mathematics Subject Classification ID

Boolean programming (90C09) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• The undirected \(m\)-capacitated peripatetic salesman problem
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
• A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem

Cites work

• A branch and bound algorithm for symmetric 2-peripatetic salesman problems
• A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
• A heuristic approach to the overnight security service problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 4137803 (Why is no real title available?)
• scientific article; zbMATH DE number 3485514 (Why is no real title available?)
• Lower bounds for symmetricK-peripatetic salesman problems
• Sensitivity analysis for symmetric 2-peripatetic salesman problems
• The equity constrained shortest path problem
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• Vehicle scheduling in two-cycle flexible manufacturing systems

Cited in

(4)

• The undirected \(m\)-capacitated peripatetic salesman problem
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem

Describes a project that uses

Uses Software

• TSPLIB
• LKH

This page was built for publication: Heuristiques pour le Problème du Vendeurm-Péripatétique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621973)