Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework

DOI10.1007/s10479-013-1366-8zbMath1271.90010OpenAlexW2058751659MaRDI QIDQ363544

Theodore Athanasopoulos, Ioannis Minis

Publication date: 3 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1366-8

zbMATH Keywords

column generationvehicle routingmulti-periodacceleration techniques for multi-period vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (3)

An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot ⋮ Dynamic multi-period vehicle routing with touting ⋮ Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• A reoptimization algorithm for the shortest path problem with time windows
• Variable neighborhood search
• The dynamic multi-period vehicle routing problem
• A multi-period TSP with stochastic regular and urgent demands
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Vehicle routing problem with elementary shortest path based column generation
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment
• Constraint-specific recovery network for solving airline recovery problems
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Decomposition Principle for Linear Programs
• The period routing problem
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Inventory Routing
• The Period Vehicle Routing Problem and its Extensions
• Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
• Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• 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 Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• A Primer in Column Generation
• Vehicle Routing Problem with Time Windows
• Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
• Management Policies in a Dynamic Multi Period Routing Problem

This page was built for publication: Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework