Shippers' collaboration in city logistics

被引：9

作者：

Manier, H. ^{[1
]}

Manier, M. -A. ^{[1
]}

Al Chami, Z. ^{[1
]}

机构：

[1] UTBM, Univ Bourgogne Franche Comte, OPERA, F-90010 Belfort, France

来源：

IFAC PAPERSONLINE | 2016年 / 49卷 / 12期

关键词：

Transportation; collaborative; city logistics; routing; pickup and delivery problem; linear programming; VEHICLE-ROUTING PROBLEM; ORIENTEERING PROBLEM; TIME WINDOWS; PICKUP;

D O I：

10.1016/j.ifacol.2016.07.904

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

To remain competitive, shippers must reduce their costs and in particular transportation costs. Collaborating between each other and grouping their demands may help to reach this goal. This can be addressed by solving pickup and delivery problems with multiple time windows (PDPMTW) with paired demands, where vehicles have to transport loads from pickup locations to delivery locations while respecting capacity and time constraints. This paper presents an exact model to solve a PDPTW with soft period and hard time windows. The objective is to minimize the total cost including transportation and penalty costs. The obtained results are encouraging for such problems in an urban context. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

引用

页码：1880 / 1885

页数：6

共 17 条

[1]

[Anonymous], 2002, VEHICLE ROUTING PROB

[2]

[Anonymous], 2008, J BETRIEBSWIRTSCHAFT, DOI DOI 10.1007/S11301-008-0036-4

[3] The vehicle routing problem with multiple prioritized time windows: A case study [J].

Beheshti, Ali Kourank ;

Hejazi, Seyed Reza ;

Alinaghian, Mehdi .

COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 90 :402-413

[4] A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows [J].

Belhaiza, Slim ;

Hansen, Pierre ;

Laporte, Gilbert .

COMPUTERS & OPERATIONS RESEARCH, 2014, 52 :269-281

[5] A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows [J].

Bettinelli A. ;

Ceselli A. ;

Righini G. .

Mathematical Programming Computation, 2014, 6 (02) :171-197

[6]

Bo Dai, 2011, Logistics Research, V3, P101, DOI 10.1007/s12159-011-0046-9

[7]

Crainic T. G., 2009, CIRRELT

[8]

Desrosiers J., 1995, Handbooks Oper. Res. Management Sci., V8, P35

[9] Ant colony system for a VRP with multiple time windows and multiple visits [J].

Favaretto, Daniela ;

Moretti, Elena ;

Pellegrini, Paola .

JOURNAL OF INTERDISCIPLINARY MATHEMATICS, 2007, 10 (02) :263-284

[10] A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows [J].

Lin, Shih-Wei ;

Yu, Vincent F. .

APPLIED SOFT COMPUTING, 2015, 37 :632-642

← 1 2 →