Artificial Bee Colony Algorithm for Two-dimensional Loading Capacitated Vehicle Routing Problem

被引：0

作者：

Wu Bin ^{[1
]}

Cai Hong ^{[1
]}

Cui Zhi-yong ^{[1
]}

机构：

[1] Nanjing Univ Technol, Sch Econ & Management, Nanjing 210009, Jiangsu, Peoples R China

来源：

2013 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING (ICMSE) | 2013年

关键词：

artificial bee colony algorithm; 2L-CVRP; bin packing problem; vehicle routing problem; OPTIMIZATION; SEARCH;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The artificial bee colony algorithm (ABC) with three loading heuristics for the two-dimensional loading capacitated vehicle routing problem (2L-CVRP) is presented in the paper. The 2L-CVRP is a combination of two well-known NP-hard problems, the capacitated vehicle routing problem, and the two-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for these problems. The problem is solved by different heuristics for the loading part, and by artificial bee colony algorithm for the overall optimization. To solve the representation problem of the solution, a novel real encoding is presented to represent the solution for ABC. The effectiveness of the proposed algorithm is tested, and proven by extensive computational experiments on benchmark instances.

引用

页码：406 / 412

页数：7

共 20 条

[1]

[Anonymous], 2002, The vehicle routing problem pp

[2] A unified exact method for solving different classes of vehicle routing problems [J].

Baldacci, Roberto ;

Mingozzi, Aristide .

MATHEMATICAL PROGRAMMING, 2009, 120 (02) :347-380

[3] A new placement heuristic for the orthogonal stock-cutting problem [J].

Burke, EK ;

Kendall, G ;

Whitwell, G .

OPERATIONS RESEARCH, 2004, 52 (04) :655-671

[4] Heuristics for the strip packing problem with unloading constraints [J].

da Silveira, Jefferson L. M. ;

Miyazawa, Flavio K. ;

Xavier, Eduardo C. .

COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) :991-1003

[5] A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem [J].

Duhamel, Christophe ;

Lacomme, Philippe ;

Quilliot, Alain ;

Toussaint, Helene .

COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (03) :617-640

[6] Two-dimensional online bin packing with rotation [J].

Epstein, Leah .

THEORETICAL COMPUTER SCIENCE, 2010, 411 (31-33) :2899-2911

[7] An exact algorithm for higher-dimensional orthogonal packing [J].

Fekete, Sandor P. ;

Schepers, Joerg ;

van der Veen, Jan C. .

OPERATIONS RESEARCH, 2007, 55 (03) :569-587

[8] Ant colony optimization for the two-dimensional loading vehicle routing problem [J].

Fuellerer, Guenther ;

Doerner, Karl F. ;

Hardl, Richard F. ;

Iori, Manuel .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (03) :655-673

[9] A Tabu Search heuristic for the vehicle routing problem with two-dimensional loading constraints [J].

Gendreau, Michel ;

Iori, Manuel ;

Laporte, Gilbert ;

Martello, Silvaro .

NETWORKS, 2008, 51 (01) :4-18

[10] An exact approach for the vehicle routing problem with two-dimensional loading constraints [J].

Iori, Manuel ;

Salazar-Gonzalez, Juan-Jose ;

Vigo, Daniele .

TRANSPORTATION SCIENCE, 2007, 41 (02) :253-264

← 1 2 →