An intelligent zone-based delivery scheduling approach

被引:11
作者
Wang, H [1 ]
Xue, D [1 ]
机构
[1] Univ Calgary, Dept Mech & Mfg Engn, Calgary, AB T2N 1N4, Canada
关键词
intelligent scheduling; fuzzy-based pattern classification; genetic algorithm; state-space search; optimization;
D O I
10.1016/S0166-3615(02)00017-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper introduces a zone-based delivery scheduling approach developed using artificial intelligence techniques. In this approach, delivery scheduling is conducted at three different levels: (1) classification of past delivery demand patterns and prediction of future delivery demand using a multi-level pattern clustering and matching method, (2) creation of delivery zones, including their center locations, delivery frequencies, and delivery cost rates, for each of these delivery demand patterns, and (3) identification of the optimal delivery methods, sequence, and timing parameters of delivery tasks. The system was implemented using Smalltalk, an object oriented programming language. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:109 / 125
页数:17
相关论文
共 19 条
[1]   PARALLEL SAVINGS BASED HEURISTICS FOR THE DELIVERY PROBLEM [J].
ALTINKEMER, K ;
GAVISH, B .
OPERATIONS RESEARCH, 1991, 39 (03) :456-469
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
[Anonymous], Pattern Recognition With Fuzzy Objective Function Algorithms
[4]   ON INTEGER-PROGRAM FOR DELIVERY PROBLEM [J].
BALINSKI, ML ;
QUANDT, RE .
OPERATIONS RESEARCH, 1964, 12 (02) :300-&
[5]   TRAVELING SALESMAN PROBLEM - A SURVEY [J].
BELLMORE, M ;
NEHAUSE.GL .
OPERATIONS RESEARCH, 1968, 16 (03) :538-&
[7]  
CLARKE G, 1964, OPER RES, V12, P569
[8]  
Eilon S, 1971, Distribution management
[9]   A BRANCH-AND-BOUND ALGORITHM FOR THE CAPACITATED VEHICLE-ROUTING PROBLEM ON DIRECTED-GRAPHS [J].
FISCHETTI, M ;
TOTH, P ;
VIGO, D .
OPERATIONS RESEARCH, 1994, 42 (05) :846-859
[10]   AN OPTIMAL SOLUTION METHOD FOR LARGE-SCALE MULTIPLE TRAVELING SALESMEN PROBLEMS [J].
GAVISH, B ;
SRIKANTH, K .
OPERATIONS RESEARCH, 1986, 34 (05) :698-717