A metaheuristic for stochastic service network design

被引:42
作者
Hoff, Arild [1 ]
Lium, Arnt-Gunnar [2 ]
Lokketangen, Arne [1 ]
Crainic, Teodor Gabriel [3 ,4 ]
机构
[1] Molde Univ Coll, N-6402 Molde, Norway
[2] SINTEF Technol & Soc, Appl Econ & Operat Res, N-7465 Trondheim, Norway
[3] Univ Montreal, Dept Management & Technol, ESG UQAM, Montreal, PQ H3C 3J7, Canada
[4] Univ Montreal, CIRRELT, Montreal, PQ H3C 3J7, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Stochastic programming; Scheduled service network design; Scenarios; Metaheuristics; CYCLE-BASED NEIGHBORHOODS; RAILROAD OPERATING PLANS; VEHICLE-ROUTING PROBLEM; FREIGHT TRANSPORTATION; MULTICOMMODITY; MODELS;
D O I
10.1007/s10732-009-9112-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper considers the time-dependent service network design problem with stochastic demand represented by scenarios. To our knowledge, this is the first attempt to address real life-size instances of this problem. The model integrates the balancing of empty vehicles, the cost of handling freight in intermediate terminals, the costs associated with moving freight using the selected services, and the penalty costs of not being able to deliver freight. A metaheuristic is presented and computational results are reported on a set of large new problem instances.
引用
收藏
页码:653 / 679
页数:27
相关论文
共 48 条