Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem

DOI10.1007/s10288-010-0148-2zbMath1208.90021OpenAlexW2006756967MaRDI QIDQ633484

Christian Prins, Roberto Wolfler Calvo, Sandra Ulrich Ngueveu

Publication date: 1 April 2011

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0148-2

zbMATH Keywords

metaheuristicsvehicle routing problemperipatetic salesman problemperipatetic vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The \(k\)-dissimilar vehicle routing problem, Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem, A concise guide to existing and emerging vehicle routing problem variants, The vehicle routing problem with arrival time diversification on a multigraph, Safe and secure vehicle routing: a survey on minimization of risk exposure, A cash transportation vehicle routing problem with combinations of different cash denominations, A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit, The hazardous orienteering problem, Vehicle routing with arrival time diversification, The undirected \(m\)-capacitated peripatetic salesman problem, A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty, The multiple shortest path problem with path deconfliction, A survey on matheuristics for routing problems

Uses Software

• TSPLIB
• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems
• Future paths for integer programming and links to artificial intelligence
• A heuristic approach to the overnight security service problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Embedded local search approaches for routing optimization
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Parallel iterative search methods for vehicle routing problems
• Paths, Trees, and Flowers
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Lower bounds for symmetricK-peripatetic salesman problems