Service network design models for two-tier city logistics

被引:47
作者
Crainic, Teodor Gabriel [1 ]
Sgalambro, Antonino [2 ]
机构
[1] Univ Quebec, CIRRELT, Montreal, PQ H3C 3P8, Canada
[2] CNR, Ist Applicaz Calcolo Mauro Picone, I-00185 Rome, Italy
基金
加拿大自然科学与工程研究理事会;
关键词
City logistics; Scheduled service network design; Urban freight transportation; Fixed charge multicommodity network design; Asset management; VEHICLE-ROUTING PROBLEM;
D O I
10.1007/s11590-013-0662-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper focuses on two-tier city logistics systems for advanced management of urban freight activities and, in particular, on the first layer of such systems where freight is moved from distribution centers on the outskirts of the city to satellite platforms by urban vehicles, from where it will be distributed to customers by a different fleet of dedicated vehicles. We address the issue of planning the services of this first tier system, that is, select services, their routes and schedules, and determine the itineraries of the customer-demand flows through these facilities and services. We propose a general scheduled service network design modelling framework that captures the fundamental concepts related to the definition of urban-vehicle tactical plans within a two-tier distribution network. We examine several operational assumptions regarding the management of the urban-vehicle fleet and the flexibility associated with the delivery of goods, and show how the proposed modelling framework can evolve to represent an increasing level of detail. A discussion of algorithmic perspectives completes the paper.
引用
收藏
页码:1375 / 1387
页数:13
相关论文
共 22 条
[1]   Service network design with asset management: Formulations and comparative analyses [J].
Andersen, Jardar ;
Crainic, Teodor Gabriel ;
Christiansen, Marielle .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2009, 17 (02) :197-207
[2]   On the approximation of the single source k-splittable flow problem [J].
Caramia, Massimiliano ;
Sgalambro, Antonino .
JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) :277-289
[3]   An exact approach for the maximum concurrent k-splittable flow problem [J].
Caramia, Massimiliano ;
Sgalambro, Antonino .
OPTIMIZATION LETTERS, 2008, 2 (02) :251-265
[4]   A fast heuristic algorithm for the maximum concurrent k-splittable flow problem [J].
Caramia, Massimiliano ;
Sgalambro, Antonino .
OPTIMIZATION LETTERS, 2010, 4 (01) :37-55
[5]  
Chouman M., 2013, TRANSP SCI
[6]  
Chouman M., 2011, CIRRELT201156 U MONT
[7]  
Chouman M., 2010, CIRRELT201031 U MONT
[8]   A survey on benders decomposition applied to fixed-charge network design problems [J].
Costa, AM .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) :1429-1450
[9]  
Crainic TG, 2011, LECT NOTES COMPUT SC, V6622, P179, DOI 10.1007/978-3-642-20364-0_16
[10]   Models for Evaluating and Planning City Logistics Systems [J].
Crainic, Teodor Gabriel ;
Ricciardi, Nicoletta ;
Storchi, Giovanni .
TRANSPORTATION SCIENCE, 2009, 43 (04) :432-454