Data mining-based dispatching system for solving the local pickup and delivery problem

被引:14
作者
Chen, Weiwei [1 ]
Song, Jie [2 ]
Shi, Leyuan [1 ]
Pi, Liang [1 ]
Sun, Peter [3 ]
机构
[1] Univ Wisconsin, Dept Ind & Syst Engn, Madison, WI 53706 USA
[2] Peking Univ, Dept Ind Engn & Management, Beijing 100871, Peoples R China
[3] Schneider Natl Inc, Green Bay, WI 54306 USA
基金
英国科研创新办公室;
关键词
Local pickup and delivery; Logistics; Data mining; Optimization; Decision making; LOGISTIC-REGRESSION; NESTED PARTITIONS; INDUCTION; ALGORITHM;
D O I
10.1007/s10479-012-1118-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The Local Pickup and Delivery Problem (LPDP) has drawn much attention, and optimization models and algorithms have been developed to address this problem. However, for real world applications, the large-scale and dynamic nature of the problem causes difficulties in getting good solutions within acceptable time through standard optimization approaches. Meanwhile, actual dispatching solutions made by field experts in transportation companies contain embedded dispatching rules. This paper introduces a Data Mining-based Dispatching System (DMDS) to first learn dispatching rules from historical data and then generate dispatch solutions, which are shown to be as good as those generated by expert dispatchers in the intermodal freight industry. Three additional benefits of DMDS are: (1) it provides a simulation platform for strategic decision making and analysis; (2) the learned dispatching rules are valuable to combine with an optimization algorithm to improve the solution quality for LPDPs; (3) by adding optimized solutions to the training data, DMDS is capable to generate better-than-actuals solutions very quickly.
引用
收藏
页码:351 / 370
页数:20
相关论文
共 28 条
[1]  
[Anonymous], 1984, OLSHEN STONE CLASSIF, DOI 10.2307/2530946
[2]  
[Anonymous], 1998, FEATURE EXTRACTION C
[3]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
[4]   Vehicle routing problem with time windows, part II:: Metaheuristics [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :119-139
[5]   Efficient insertion heuristics for vehicle routing and scheduling problems [J].
Campbell, AM ;
Savelsbergh, M .
TRANSPORTATION SCIENCE, 2004, 38 (03) :369-378
[6]   LOTUS: An algorithm for building accurate and comprehensible logistic regression trees [J].
Chan, KY ;
Loh, WY .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2004, 13 (04) :826-852
[7]   METHODS FOR ROUTING WITH TIME WINDOWS [J].
DESROSIERS, J ;
SOUMIS, F ;
DESROCHERS, M ;
SAUVE, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 23 (02) :236-245
[8]   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
[9]   Application of data mining approaches to drug delivery [J].
Ekins, Sean ;
Shimada, Jun ;
Chang, Cheng .
ADVANCED DRUG DELIVERY REVIEWS, 2006, 58 (12-13) :1409-1430
[10]  
Fagerholt K., 2000, International Transactions in Operational Research, V7, P231, DOI 10.1111/j.1475-3995.2000.tb00196.x