1,840
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems

, &
Pages 7219-7242 | Received 08 Jun 2009, Accepted 26 Oct 2009, Published online: 02 Feb 2010

References

  • Ahuja , K , Magnanti , TL and Orlin , JB . 1993 . Network flows: theory, algorithms, and applications , Englewood Cliffs, NJ : Prentice Hall .
  • Asef-Vaziri , A , Hall , NG and George , R . 2008 . The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path . Computers & Operations Research , 35 ( 5 ) : 1546 – 1561 .
  • Bent , R and Van Hentenryck , P . 2006 . A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows . Computers & Operations Research , 33 ( 4 ) : 875 – 893 .
  • Bilge , U and Ulusoy , G . 1995 . A time window approach to simultaneous scheduling of machines and material handling system in an FMS . Operations Research , 43 ( 6 ) : 1058 – 1070 .
  • Bronmo , G , Christiansen , M and Nygreen , B . 2007 . Ship routing and scheduling with flexible cargo sizes . Journal of the Operational Research Society , 58 ( 9 ) : 1167 – 1177 .
  • Chen , ZL and Xu , H . 2006 . Dynamic column generation for dynamic vehicle routing with time windows . Transportation Science , 40 ( 1 ) : 74 – 88 .
  • De Koster , R(M)BM , Le-Anh , T and Van der Meer , JR . 2004 . Testing and classifying vehicle dispatching rules in three real-world settings . Journal of Operations Management , 22 ( 4 ) : 369 – 386 .
  • De Koster , R(M)BM and Yu , M . 2008 . Minimizing makespan and throughput times at Aalsmeer flower auction . Journal of the Operational Research Society , 59 ( 9 ) : 1182 – 1190 .
  • De Koster , R(M)BM , Le-Duc , T and Yu , Y . 2008 . Optimal storage rack design for a 3-dimensional compact AS/RS . International Journal of Production Research , 46 ( 6 ) : 1495 – 1514 .
  • Desaulniers , G , Lavigne , J and Soumis , F . 1998 . Multi-depot vehicle scheduling problems with time windows and waiting costs . European Journal of Operational Research , 111 ( 3 ) : 479 – 494 .
  • Desrochers , M and Soumis , F . 1988 . A generalized permanent labeling algorithm for the shortest-path problem with time windows . Infor , 26 ( 3 ) : 191 – 212 .
  • Dumas , Y , Desrosiers , J and Soumis , F . 1991 . The pickup and delivery problem with time windows . European Journal of Operational Research , 54 ( 1 ) : 7 – 22 .
  • Egbelu , PJ and Tanchoco , JMA . 1984 . Characterization of automated guided vehicle dispatching rules . International Journal of Production Research , 22 ( 3 ) : 359 – 374 .
  • Fleischmann , B , Gnutzmann , S and Sandvoss , E . 2004 . Dynamic vehicle routing based on online traffic information . Transportation Science , 38 ( 4 ) : 420 – 433 .
  • Hsu , JC . 1996 . Multiple comparisons: theory and methods , London : Chapman & Hall .
  • Ichoua , S , Gendreau , N and Potvin , JY . 2000 . Diversion issues in real-time vehicle dispatching . Transportation Science , 34 ( 4 ) : 426 – 438 .
  • Jang , J , Suh , J and Ferreira , PM . 2001 . An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines . International Journal of Production Research , 39 ( 17 ) : 3901 – 3921 .
  • Kim , BI . 2007 . Effectiveness of vehicle reassignment in a large-scale overhead hoist transport system . International Journal of Production Research , 45 ( 4 ) : 789 – 802 .
  • Kim , KH and Bae , JW . 2004 . A look-ahead dispatching method for automated guided vehicles in automated port container terminals . Transportation Science , 38 ( 2 ) : 224 – 234 .
  • Kindervater , GAP and Savelsbergh , MWP . 1992. Local search in physical distribution management. Discussion paper no. 77. Erasmus University Rotterdam, the Netherlands
  • Krishnamurthy , NN , Batta , R and Karwan , MH . 1993 . Developing conflict-free routes for automated guided vehicles . Operations Research , 41 ( 6 ) : 1077 – 1090 .
  • Laporte , G . 2000 . Classical and modern heuristics for the vehicle routing problem . International Transactions in Operations Research , 7 ( 4–5 ) : 285 – 300 .
  • Le-Anh , T and De Koster , R(M)BM . 2006 . A review of design and control of automated guided vehicle systems . European Journal of Operational Research , 171 ( 1 ) : 1 – 23 .
  • Mes , M , Van der Heijden , M and Van Harten , A . 2007 . Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems . European Journal of Operational Research , 181 ( 1 ) : 59 – 75 .
  • Morihiro , Y , Miyamoto , T and Kumagai , S . 2007 . An initial assignment method for tasks assignment and routing problem of autonomous distributed AGVs . IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences , 90 ( 11 ) : 2465 – 2471 .
  • Ohlmann , JW and Thomas , BW . 2007 . A compressed-annealing heuristic for the traveling salesman problem with time windows . Informs Journal on Computing , 19 ( 1 ) : 80 – 90 .
  • Pisinger , D and Ropke , S . 2007 . A general heuristic for vehicle routing problems . Computers & Operations Research , 34 ( 8 ) : 2403 – 2435 .
  • Powell , WB . 1996 . A stochastic formulation of the dnamic assignment problem, with an application to truckload motor carriers . Transportation Science , 30 ( 3 ) : 195 – 219 .
  • Psaraftis , HN . 1988 . “ Dynamic vehicle routing problems ” . In Vehicle routing: methods and studies , Edited by: Golden , BL and Assad , AA . 233 – 248 . Amsterdam : Elsevier Science .
  • Ropke , S , Cordeau , JF and Laporte , G . 2007 . Models and branch-and-cut algorithms for pickup and delivery problems with time windows . Networks , 49 ( 4 ) : 258 – 272 .
  • Savelsbergh , MWP . 1995 . The general pickup and delivery problem . Transportation Science , 29 ( 1 ) : 17 – 29 .
  • Savelsbergh , MWP and Sol , M . 1998 . Drive: dynamic routing of independent vehicles . Operations Research , 46 ( 4 ) : 474 – 490 .
  • Singh , SP and Tiwari , MK . 2002 . Intelligent agent framework to determine the optimal conflict-free path for an automated guided vehicles system . International Journal of Production Research , 40 ( 16 ) : 4195 – 4223 .
  • Thomas , BW . 2002. Anticipatory route selection problems. Thesis (PhD). University of Michigan
  • Tompkins , JA . 2003 . Facilities planning , New York : John Wiley and Sons .
  • Van der Meer , JR . 2000. Operational control of internal transport system. Thesis (PhD). Erasmus University, Rotterdam, the Netherlands
  • Vis , IFA , De Koster , R(M)BM and Savelsbergh , MWP . 2005 . Minimum vehicle fleet size under time-window constraints at a container terminal . Transportation Science , 39 ( 2 ) : 249 – 260 .
  • Xiang , ZH , Chu , CB and Chen , HX . 2006 . A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints . European Journal of Operational Research , 174 ( 2 ) : 1117 – 1139 .
  • Yang , J , Jaillet , P and Mahmassani , H . 2004 . Real-time multivehicle truckload pickup and delivery problems . Transportation Science , 38 ( 2 ) : 135 – 148 .
  • Yu , Y and De Koster , R(M)BM . 2009a . Designing an optimal turnover-based storage rack for a 3D compact automated storage and retrieval system . International Journal of Production Research , 47 ( 6 ) : 1551 – 1571 .
  • Yu , Y and De Koster , R(M)BM . 2009b . Optimal zone boundaries for two class-based compact three-dimensional automated storage and retrieval systems . IIE Transactions , 41 ( 3 ) : 194 – 208 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.