DocumentCode
3153288
Title
Computational results on some shortest problems with side constraints
Author
KOBAYASHI, Kazuhiro
Author_Institution
Nat. Maritime Res. Inst., Tokyo
fYear
2008
fDate
20-22 Aug. 2008
Firstpage
959
Lastpage
963
Abstract
We consider a shortest path problem with side constraints; time windows constraints and precedence constraints. This problem arises as a subproblem in the column generation method for solving a container-ship scheduling problem. We implemented the generalized permanent label correcting algorithm by Desrochers and Soumis. We ran the numerical experiments to evaluate the actual efficiency of this algorithm.
Keywords
scheduling; ships; column generation method; container-ship scheduling problem; shortest path problem; side constraints; time windows constraints; Costs; Labeling; Linear programming; Marine vehicles; Mathematical model; Radio access networks; Scheduling; Shortest path problem; Software standards; Time factors; column generation; ship scheduling; shortest path problem;
fLanguage
English
Publisher
ieee
Conference_Titel
SICE Annual Conference, 2008
Conference_Location
Tokyo
Print_ISBN
978-4-907764-30-2
Electronic_ISBN
978-4-907764-29-6
Type
conf
DOI
10.1109/SICE.2008.4654794
Filename
4654794
Link To Document