Lower and upper bounds for the m-peripatetic vehicle routing problem
DOI10.1007/S10288-010-0148-2zbMATH Open1208.90021OpenAlexW2006756967MaRDI QIDQ633484FDOQ633484
Authors: Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo 
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
Recommendations
- A new variant of a vehicle routing problem: Lower and upper bounds
- On the vehicle routing problem with lower bound capacities
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Optimal vehicle routing with lower and upper bounds on route durations
- Improved bounds for vehicle routing solutions
- Lower and upper bounds for the mixed capacitated arc routing problem
- Approximation results for min-max path cover problems in vehicle routing
- Numerically safe lower bounds for the capacitated vehicle routing problem
metaheuristicsvehicle routing problemperipatetic salesman problemperipatetic vehicle routing problem
Graph algorithms (graph-theoretic aspects) (05C85) Transportation, logistics and supply chain management (90B06)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Future paths for integer programming and links to artificial intelligence
- Paths, Trees, and Flowers
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The vehicle routing problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- Title not available (Why is that?)
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Title not available (Why is that?)
- Lower bounds for symmetricK-peripatetic salesman problems
- 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 heuristic approach to the overnight security service problem
- Parallel iterative search methods for vehicle routing problems
- The granular tabu search and its application to the vehicle-routing problem
- New heuristics for the vehicle routing problem
- The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
- Embedded local search approaches for routing optimization
Cited In (17)
- New integrated routing and surveillance model with drones and charging station considerations
- The hazardous orienteering problem
- A cash transportation vehicle routing problem with combinations of different cash denominations
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
- The multiple shortest path problem with path deconfliction
- The undirected \(m\)-capacitated peripatetic salesman problem
- A concise guide to existing and emerging vehicle routing problem variants
- The vehicle routing problem with arrival time diversification on a multigraph
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- The \(k\)-dissimilar vehicle routing problem
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- Dissimilar arc routing problems
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- Vehicle routing with arrival time diversification
- A survey on matheuristics for routing problems
Uses Software
This page was built for publication: Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633484)
