A set partitioning approach to the multiple depot vehicle scheduling problem
作者:
L. Bianco,
A. Mingozzi,
S. Ricciardelli,
期刊:
Optimization Methods and Software
(Taylor Available online 1994)
卷期:
Volume 3,
issue 1-3
页码: 163-194
ISSN:1055-6788
年代: 1994
DOI:10.1080/10556789408805563
出版商: Gordon and Breach Science Publishers
关键词: Set Partitioning;Vehicle Scheduling;Combinatorial Optimization
数据来源: Taylor
摘要:
We address the problem of scheduling a fleet of vehicles, stationed in different depots, in such a way to perform a set of time-tabled trips and to minimize a given objective function. We consider the consti that requires each vehicle to return to the starting depot. This problem, known asMultiple Depot V& Scheduling(MD-VSP), isNP-hard. In this paper we formulate the MD-VSP as a Set Partitioning Prot with side constraints (SP). We describe a procedure that, without using the SP matrix, computes a lower bound to the MD-VSP by finding a heuristic solution to the dual of the continuous relaxation of SP. dual solution obtained is used to reduce the number of variables in the SP in such a way that the resu SP problem can be solved by usual branch and bound techniques. The computational results show effectiveness of the proposed method.
点击下载:
PDF (993KB)
返 回