Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem

References

• Ascheuer N., Grötschel M., Rambau J. Combinatorial online optimization in practice. Optima Newsletter (1998) 57:1–6Google Scholar
• Ascheuer N., Grötschel M., Abdel-Aziz Abdel-Hamid A. Order picking in an automatic warehouse: Solving online asymmetric TSPs. Math. Methods Oper. Res. (1999a) 49:501–515Crossref, Google Scholar
• Ascheuer N., Grötschel M., Krumke S. O., Rambau J., Kall P., Lüthi H. -J. Combinatorial online optimization. Oper. Res. Proc. 1998 (1999b) (Springer, Berlin, Germany) 21–37Google Scholar
• Battiti R. Reactive search: Toward self-tuning heuristics. Modern Heuristic Search Methods (1996) (Wiley, Chichester, U.K.) 61–83Google Scholar
• Bodin L., Golden B., Assad A., Ball M. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10:63–221Crossref, Google Scholar
• Böse J., Reiners T., Steenken D., Voß S., Sprague R. H. Vehicle dispatching at seaport container terminals using evolutionary algorithms. Proc. 33rd Annual Hawaii Internat. Conf. System Sci., IEEE (2000) Piscataway, NJ:1–10Google Scholar
• Breitenbach C., Carl G., Voß S. Transportkostenminimierung versus Servicegradmaximierung im Rahmen einer computergestützten Tourenplanung. Zeitschrift für Planung (1993) 4:363–380Google Scholar
• Caramia M., Italiano G. F., Oriolo G., Pacifici A., Perugia A., Chamoni P., Leisten R., Martin A., Minnemann J., Stadtler H. Routing a fleet of vehicles for dynamic combined pick-up and deliveries services. Oper. Res. Proc. 2001 (2002) (Springer, Berlin, Germany) 3–8Google Scholar
• Černý V. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optimization Theory Appl. (1985) 45:41–51Crossref, Google Scholar
• Desrochers M., Lenstra J. K., Savelsbergh M. W. P. A classification scheme for vehicle routing and scheduling problems. Eur. J. Oper. Res. (1990) 46:322–332Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science, Vol. 8: Network Routing (1995) (North-Holland, Amsterdam, The Netherlands)35–139Google Scholar
• Dijkstra E. A note on two problems in connexion with graphs. Numer. Math. (1959) 1:269–271Crossref, Google Scholar
• Dowsland K. A., Reeves C. Simulated annealing. Modern Heuristic Techniques for Combinatorial Problems (1993) (Blackwell, Halstead, U.K.) 20–69Google Scholar
• Egbelu P. J., Tanchoco J. M. A. Characterization of automatic guided vehicle dispatching rules. Internat. J. Production Res. (1984) 22:359–374Crossref, Google Scholar
• Eglese R. W. Simulated annealing: A tool for operational research. Eur. J. Oper. Res. (1990) 46:271–281Crossref, Google Scholar
• Fiat A., Woeginger G. J.Online Algorithms: The State of the Art (1998) (Springer, Berlin, Germany) Crossref, Google Scholar
• Fiat A., Karp M. R., Luby M., McGeoch L. A., Sleator D. D., Young N. E. Competitive paging algorithms. J. Algorithms (1991) 12:685–699Crossref, Google Scholar
• Fink A.Software-Wiederverwendung bei der Lösung von Planungsproblemen mittels Meta-Heuristiken (2000) (Shaker, Aachen) Google Scholar
• Fink A., Voß S. Generic metaheuristics application to industrial engineering problems. Comput. Indust. Engrg. (1999) 37:281–284Crossref, Google Scholar
• Fink A., Voß S., Voß S., Woodruff D. L. HotFrame: A heuristic optimization framework. Optimization Software Class Libraries (2002) (Kluwer, Boston, MA) 81–154Google Scholar
• Fisher M. L., Jörnsten K. O., Madsen O. B. G. Vehicle routing with time windows: Two optimization algorithms. Oper. Res. (1997) 45:488–492Link, Google Scholar
• Gendreau M., Laporte G., Semet F. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. (2001) 27:1641–1653Crossref, Google Scholar
• Gendreau M., Guertin F., Potvin J.-Y., Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer, Boston, MA) Crossref, Google Scholar
• Goetschalckx M., Ratliff H. D. Sequencing picking operations in a man-aboard order picking system. Material Flow (1988) 4:255–263Google Scholar
• Gutenschwager K.Online-Dispositionsprobleme in der Lagerlogistik: Modellierung—Lösungsansätze—Praktische Umsetzung (2002) (Physica, Heidelberg, Germany) Crossref, Google Scholar
• Gutenschwager K., Lößl F., Stock B. Simulationsstudie zur Optimierung eines Logistikzentrums. Logistik für Unternehmen (2000) 14(11):57–61Google Scholar
• Hajek B. Cooling schedules for optimal annealing. Math. Oper. Res. (1988) 13:311–329Link, Google Scholar
• Han M. H., McGinnis L. F., Shieh J. S., White J. A. On sequencing retrievals in an automated storage/retrieval system. IIE Trans. (1987) 19:56–66Crossref, Google Scholar
• Hasan M., Alkhamis T. Simulated annealing procedure for scheduling competing tasks in flexible manufacturing. Production Planning Control (1997) 8:356–362Crossref, Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34:426–438Link, Google Scholar
• Irani S., Fiat A., Woeginger G. J. Competitive analysis of paging. Online-Algorithms: The State of the Art (1998) (Springer, Berlin, Germany) 52–73Crossref, Google Scholar
• Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. Optimization by simulated annealing: An experimental evaluation: Part I, graph partitioning. Oper. Res. (1989) 37:865–892Link, Google Scholar
• Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. Optimization by simulated annealing: An experimental evaluation: Part II, graph coloring and number partitioning. Oper. Res. (1991) 39:378–406Link, Google Scholar
• Kirkpatrick S., Gelatt Jr C. D., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Kohout R., Erol K. In-time agent-based vehicle routing with a stochastic improvement heuristic. Proc. 16th National Conf. Artificial Intelligence 11th Conf. Innovative Appl. Artificial Intelligence (1999) (AAAI Press/MIT Press, Menlo Park, CA) 864–869Google Scholar
• Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. (1992) 59:345–358Crossref, Google Scholar
• Larsen A., Madsen O., Solomon M. Partially dynamic vehicle routing: Models and algorithms. J. Operational Res. Soc. (2002) 53:638–646Crossref, Google Scholar
• McGeoch L. A., Sleator D. D.On-line Algorithms. Volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1991) (AMS/ACM, Providence, RI) Google Scholar
• Osman I. H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. (1993) 41:421–451Crossref, Google Scholar
• Psaraftis H. N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Sci. (1980) 14:130–154Link, Google Scholar
• Psaraftis H. N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Sci. (1983) 17:351–357Link, Google Scholar
• Psaraftis H. N. Dynamic vehicle routing. Ann. Oper. Res. (1995) 61:143–164Crossref, Google Scholar
• Ratliff H. D., Rosenthal A. S. Orderpicking in a rectangular warehouse: A solvable case of the traveling salesman. Oper. Res. (1983) 31:507–521Link, Google Scholar
• Sandvoß E.Dynamische Tourenplanung auf der Basis von online-Verkehrsinformationen (2002) (Universität Augsburg, Germany) . Ph.D. thesisGoogle Scholar
• Savelsbergh M. W. P., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29:17–29Link, Google Scholar
• Savelsbergh M. W. P., Sol M. DRIVE: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490Link, Google Scholar
• Sleator D. D., Tarjan R. E. Amortized efficiency of list-update and paging rules. Comm. ACM (1985) 28:202–208Crossref, Google Scholar
• Solomon M. M. Algorithms for vehicle routing and scheduling problems with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Vidal R. V. V.Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems (1993) 396(Springer, Berlin, Germany) Crossref, Google Scholar