Drive: Dynamic routing of independent vehicles

被引：200

作者：

Savelsbergh, M ^{[1
]}

Sol, M

机构：

[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA

[2] Baan Co, Ede, Netherlands

来源：

OPERATIONS RESEARCH | 1998年 / 46卷 / 04期

关键词：

D O I：

10.1287/opre.46.4.474

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present DRIVE (Dynamic Routing of Independent VEhicles), a planning module to be incorporated in a decision support system for the direct transportation at Van Gend and Loos BV. Van Gend and Loos BV is the largest company providing road transportation in the Benelux, with about 1400 vehicles transporting 160,000 packages from thousands of senders to tens of thousands of addressees per day. The heart of DRIVE is a branch-and-price algorithm. Approximation and incomplete optimization techniques as well as a sophisticated column management scheme have been employed to create the right balance between solution speed and solution quality. DRIVE has been tested by simulating a dynamic planning environment with real-life data and has produced very encouraging results.

引用

页码：474 / 490

页数：17

共 13 条

[1] A GLOBAL APPROACH TO CREW-PAIRING OPTIMIZATION [J].

ANBIL, R ;

TANGA, R ;

JOHNSON, EL .

IBM SYSTEMS JOURNAL, 1992, 31 (01) :71-78

[2] Branch-and-price: Column generation for solving huge integer programs [J].

Barnhart, C ;

Johnson, EL ;

Nemhauser, GL ;

Savelsbergh, MWP ;

Vance, PH .

OPERATIONS RESEARCH, 1998, 46 (03) :316-329

[3] SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].

CARPANETO, G ;

TOTH, P .

MANAGEMENT SCIENCE, 1980, 26 (07) :736-743

[4] A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS [J].

DESROCHERS, M ;

DESROSIERS, J ;

SOLOMON, M .

OPERATIONS RESEARCH, 1992, 40 (02) :342-354

[5]

DESROSIERS J, 1996, NETWORK ROUTING, P35

[6] THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS [J].

DUMAS, Y ;

DESROSIERS, J ;

SOUMIS, F .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 54 (01) :7-22

[7]

KINDERVATER GAP, 1997, LOCAL SEARCH COMBINA, P337

[8] MINTO, A MIXED-INTEGER OPTIMIZER [J].

NEMHAUSER, GL ;

SAVELSBERGH, MWP ;

SIGISMONDI, GC .

OPERATIONS RESEARCH LETTERS, 1994, 15 (01) :47-58

[9]

Ryan D. M., 1981, Computer Scheduling of Public Transport. Urban Passenger Vehicle and Crew Scheduling. Proceedings of an International Workshop, P269

[10] THE GENERAL PICKUP AND DELIVERY PROBLEM [J].

SAVELSBERGH, MWP .

TRANSPORTATION SCIENCE, 1995, 29 (01) :17-29

← 1 2 →