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

DOI10.1016/j.dam.2012.08.032zbMath1302.90137OpenAlexW2162812011WikidataQ38810048 ScholiaQ38810048MaRDI QIDQ406496

Fabien Tricoire, Valentina Cacchiani, Vera C. Hemmelmayr

Publication date: 8 September 2014

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

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

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

Related Items

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

Cites Work

• Unnamed Item
• Delivery strategies for blood products supplies
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• Local branching
• The period traveling salesman problem: A new heuristic algorithm
• Exploring relaxation induced neighborhoods to improve MIP solutions
• An improved heuristic for the period traveling salesman problem
• A new heuristic for the period traveling salesman problem
• A variable neighborhood search heuristic for periodic routing problems
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Column Generation based Primal Heuristics
• An Exact Algorithm for the Period Routing Problem
• A multi-depot period vehicle routing problem arising in the utilities sector
• The period routing problem
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• The Period Vehicle Routing Problem and its Extensions
• A multiphase approach to the period routing problem
• A Heuristic for the Periodic Vehicle Routing Problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Networks and vehicle routing for municipal waste collection
• An improved heuristic for the period vehicle routing problem
• Column Generation