Multi-depot vehicle scheduling problems with time windows and waiting costs
type: Item
instance of: scholarly article
title: Multi-depot vehicle scheduling problems with time windows and waiting costs
zbMATH Open document ID: 0937.90006
DOI: 10.1016/S0377-2217(97)00363-9
author: Guy Desaulniers
author: June Lavigne
author: François Soumis
published in: European Journal of Operational Research
publication date: 2000-06-14T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1358436
zbMATH Keywords: transportation
zbMATH Keywords: vehicle scheduling
zbMATH Keywords: waiting costs
zbMATH Keywords: multi-commodity network flow
zbMATH Keywords: column generation
MaRDI profile type: Publication
cites work: On some matching problems arising in vehicle scheduling models
cites work: Q4889095
cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem
cites work: Decomposition Principle for Linear Programs
cites work: Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
cites work: Q4955266
cites work: The shortest path problem with time windows and linear waiting costs
cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
cites work: Q5687193
cites work: Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
cites work: An exact algorithm for multiple depot bus scheduling
cites work: A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
cites work: Pickup and Delivery of Partial Loads with “Soft” Time Windows
full work available at URL: s0377-2217(97)00363-9
OpenAlex ID: W2040454839
Wikidata QID: Q127908910
description: scientific article; zbMATH DE number 1358436