A set-covering based heuristic algorithm for the periodic vehicle routing problem

DOI10.1016/J.DAM.2012.08.032MaRDI QIDQ406496zbMATH OpenOpenAlexWikidataFDO

Authors Valentina Cacchiani, V. C. Hemmelmayr, F. Tricoire

Publication date 8 September 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.dam.2012.08.032

zbMATH Keywords

column generationmatheuristicsperiodic vehicle routing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• An exact algorithm for the period routing problem
• scientific article; zbMATH DE number 5974800
• A variable neighborhood search heuristic for periodic routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A hybrid algorithm for a class of vehicle routing problems

Cites work

• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A Heuristic for the Periodic Vehicle Routing Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A multi-depot period vehicle routing problem arising in the utilities sector
• A multiphase approach to the period routing problem
• A new heuristic for the period traveling salesman problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A variable neighborhood search heuristic for periodic routing problems
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• An exact algorithm for the period routing problem
• An improved heuristic for the period traveling salesman problem
• An improved heuristic for the period vehicle routing problem
• Column Generation
• Column generation based primal heuristics
• Delivery strategies for blood products supplies
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Local branching
• Networks and vehicle routing for municipal waste collection
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• The period routing problem
• The period traveling salesman problem: A new heuristic algorithm
• The period vehicle routing problem and its extensions

Cited in

(19)

• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
• A comparative study of alternative formulations for the periodic vehicle routing problem
• A-priori upper bounds for the set covering problem
• The flexible periodic vehicle routing problem
• Exact solution methods for the multi-period vehicle routing problem with due dates
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• Consolidating home meal delivery with limited operational disruption
• Set covering problem with conflict constraints
• Tilted inequalities and facets of the set covering polytope: a theoretical analysis
• Ten years of Routist: vehicle routing lessons learned from practice
• Column-generation based bounds for the homogeneous areas problem
• Probabilistic time-dependent vehicle routing problem
• New notation and classification scheme for vehicle routing problems
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
• Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
• A survey on matheuristics for routing problems

This page was built for publication: A set-covering based heuristic algorithm for the periodic vehicle routing problem

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