Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
type: Item
instance of: scholarly article
title: Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
zbMATH Open document ID: 1271.90010
author: Theodore Athanasopoulos
author: I. Minis
published in: Annals of Operations Research
publication date: 2013-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6203932
zbMATH Keywords: multi-period
zbMATH Keywords: vehicle routing
zbMATH Keywords: column generation
zbMATH Keywords: acceleration techniques for multi-period vehicle routing problem
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10479-013-1366-8
OpenAlex ID: W2058751659
cites work: A multi-period TSP with stochastic regular and urgent demands
cites work: Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
cites work: Competitive analysis for dynamic multiperiod uncapacitated routing problems
cites work: Management Policies in a Dynamic Multi Period Routing Problem
cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Constraint-specific recovery network for solving airline recovery problems
cites work: Inventory Routing
cites work: Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics
cites work: Q4955267
cites work: Vehicle routing problem with elementary shortest path based column generation
cites work: The period routing problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Q4532229
cites work: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
cites work: Decomposition Principle for Linear Programs
cites work: A reoptimization algorithm for the shortest path problem with time windows
cites work: A Primer in Column Generation
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: The Period Vehicle Routing Problem and its Extensions
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: Vehicle Routing Problem with Time Windows
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: Variable neighborhood search
cites work: Column generation based heuristic for tactical planning in multi-period vehicle routing
cites work: Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment
cites work: The dynamic multi-period vehicle routing problem
DOI: 10.1007/S10479-013-1366-8
description: scientific article; zbMATH DE number 6203932