Papers on the Traveling Salesmans Problem

Papers on the Vehicle Routing Problem

Papers on Airline OR and related areas

Papers on the TSP

David Applegate, Robert Bixby, Vasek Chvátal, and William Cook, On the solution of travelling salesman problems, Documenta Mathematica, vol. 3, pp. 645 - 656, 1998. Extra volume ICM 1998.
David Applegate, Robert Bixby, Vasek Chvátal, and William Cook, Finding tours in the tsp, Tech. Rep. TR99-05, Departement of Computational and Applied Mathematics, Rice University, 1999.
Leonard M. Adleman, Molecular computation of solutions to combinatorial problems, Science, vol. 266, pp. 1021 - 1024, 1994.
Norbert Ascheuer, Matteo Fischetti, and Martin Grötschel, A polyhedral study of the asymmetric travelling salesman problem with time windows. Available via WWW at tt www.zib.de, February 1997. Preprint.
Norbert Ascheuer, Matteo Fischetti, and Martin Grötschel, Solving the asymmetric travelling salesman problem with time windows by branch-and-cut, August 1999. Preprint SC 99-31.
Esther M. Arkin, Sandor P. Fekete, and Joseph S. B. Mitchell, Approximation algorithms for lawn mowing and milling, Computational Geometry, vol. 17, pp. 25 - 50, 2000.
Norbert Ascheuer, Michael Jünger, and Gerhard Reinelt, A branch & cut algorithm for the asymmetric hamiltonian path problem with precedence constraints. Available via www at www.zib.de, December 1997. Preprint.
Norbert Ascheuer, Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing Systems. PhD thesis, Konrad-Zuse-Zentrum für Informationstechnik Berlin, February 1996.
Edward K. Baker, An exact algorithm for the time-constrained travelling salesman problem, Operations Research, vol. 31, pp. 938 - 945, September-October 1983.
N. L. Boland, L. W. Clarke, and G. L. Nemhauser, The asymmetric traveling salesman problem with replenishment arcs, European Journal of Operational Research, vol. 123, pp. 408 - 427, 2000.
Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van~der Veen, and Gerhard J. Woeginger, Well-solvable special cases of the TSP: A survey, Tech. Rep. 52, Karl-Franzens-Universität & Technische Universität Graz, Dezember 1995.
Egon Balas and Matteo Fischetti, A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets, Mathematical Programming, vol. 58, no. 3, pp. 325 - 352, 1993.
Egon Balas, Matteo Fischetti, and William R. Pulleyblank, The precedence-constrained asymmetric traveling salesman polytope, Mathematical Programming, vol. 68, no. 3, pp. 241 - 265, 1995.
Giovanni Cesari, Divide and conquer strategies for parallel TSP heuristics, Computers & Operations Research, vol. 23, no. 7, pp. 681 - 694, 1996.
Irene Charon and Olivier Hudry, Application of the noising method to the travelling salesman problem, European Journal of Operational Research, vol. 125, pp. 266 - 277, 2000.
Harlan Crowder and Manfred W. Padberg, Solving large-scale symmetric travelling salesman problems to optimality, Management Science, vol. 26, pp. 495 - 509, March 1980.
Thomas Christof and G. Reinelt, Parallel cutting plane generation for the TSP, extended abstract, Institut für Angewandte Mathematik, Universität Heidelberg, January 1995.
Giogio Carpaneto and Paolo Toth, Some new branching and bounding criteria for the asymmetric travelling salesman problem, Managemant Science, vol. 26, pp. 736 - 743, July 1980.
Yvan Dumas, Jacques Desrosiers, Eric Gelinas, and Marius M. Solomon, An optimal algorithm for the traveling salesman problem with time windows, Operations Research, vol. 43, pp. 367 - 371, March-April 1995.
G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a large-scale traveling-salesman problem, Operations Research, vol. 2, pp. 393 - 410, 1954.
Marco Dorigo and Luca Maria Gambardella, Ant colonies for the traveling salesman problem, Tech. Rep. 1996/3, Université Libre de Bruxelles, 1996.
Martin Desrochers and Gilbert Laporte, Improvements and extensions to the miller-tucker-zemlin subtour elimination constraints, Operations Research Letters, vol. 10, pp. 27 - 36, 1991.
Vladimir G. Deineko, Rüdiger Rudolf, and Gerhard J. Woeginger, Sometimes travelling is easy: The master tour problem, SIAM Journal of Discrete Mathematics, vol. 11, pp. 81 - 93, 1998.
Jacques Desrosiers, Michel Sauvé, and François Soumis, Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows, Management Science, vol. 34, pp. 1005 - 1022, August 1988.
Vladimir G. Deineko and Gerhard J. Woeginger, A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem, Mathematical Programming, Series A, vol. 87, pp. 519 - 542, 2000.
Paulo M. França, Michel Gendreau, Gilbert Laporte, and Felipe M. Müller, The m-traveling salemsman problem with minmax objective, Transportation Science, vol. 29, no. 3, pp. 267 - 275, 1995.
C. N. Fiechter, A parallel tabu search algorithm for large traveling salesman problems, Discrete Applie Mathematics, vol. 51, no. 3, pp. 243 - 267, 1994.
Alan Frieze, Richard M. Karp, and Bruce Reed, When is the assignment bound tight for the asymmetric traveling-salesman problem. Working Paper.
Robert S. Garfinkel, On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling-salesman problem, Operations Research, vol. 21, pp. 340 - 343, 1973.
Michel Gendreau, Alain Hertz, Gilbert Laporte, and Mihnea Stan, A generalized insertion heuristic for the traveling salesman problem with time windows, Operations Research, vol. 43, pp. 330 - 335, May-June 1998.
Fred Glover, Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move, Journal of Heuristics, vol. 2, pp. 169 - 179, 1996.
Michel Gendreau, Gilbert Laporte, and Daniele Vigo, Heuristics for the traveling salesman problem with pickup and delivery, Computers & Operations Research, vol. 26, pp. 699 - 714, 1999.
Michel X. Goemans, Worst-case comparison of valid inequalities for the TSP, Mathematical Programming, 1995.
Martin Grötschel and Manfred W. Padberg, On the symmetric travelling salesman problem I: Inequalities, Mathematical Programming, vol. 16, pp. 265 - 280, 1979.
Martin Grötschel and Manfred W. Padberg, On the symmetric travelling salesman problem II: Lifting theorem and facets, Mathematical Programming, vol. 16, pp. 281 - 302, 1979.
Luis Gouveia and Jose Manuel Pires, The asymmetric travelling salesman problem: on generalizations of disaggregated miller-tucker-zemlin constraints, Discrete Applied Mathematics, vol. 112, pp. 129 - 145, 2001.
Gregory Gutin, Exponential neighbourhood local search for the traveling salesman problem, Computers & Operations Research, vol. 26, pp. 313 - 320, 1999.
Gregory Gutin and Anders Yeo, Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour, Computers & Operations Research, vol. 26, pp. 321 - 327, 1999.
Michael Held and Richard M. Karp, The traveling-salesman problem and minimum spanning trees, Operations Research, vol. 18, pp. 1138 - 1162, 1970.
Michael Held and Richard M. Karp, The traveling-salesman problem and minimum spanning trees: Part ii, Mathematical Programming, vol. 1, pp. 6 - 25, 1971.
David S. Johnson and Lyle A. McGeoch, Local Search in Combinatorial Optimization, ch. The Traveling Salesman Problem: A Case Study in Local Optimization, pp. 215 - 310. John Wiley and Sons, Ltd., 1997. Preliminary draft of chapter.
Michael Jünger, Gerhard Reinelt, and Stefan Thienel, Provably good solutions for the traveling salesman problem, Tech. Rep. 92.114, Institut für Informatik, Universität zu Köln, 1992.
Michael Jünger and Peter Störmer, Solving large-scale traveling salesman problems with parallel branch-and-cut, Tech. Rep. 95.191, Zentrum für paralleles rechnen, Institut für Informatik, Universität zu Köln, 1995.
Sean Kearns, Finding the shortest routes for monkeys and salesmen, ION Science, vol. 08.21.95, August 1995. ION Science is a WWW-journal available at tt http://-www.injersey.com/-media/-IonSci/.
S. Kirkpatrick and G. Toulouse, Configuration space analysis of travelling salesman problems, Journal de Physique, vol. 46, pp. 1277 - 1292, 1985.
Gilbert Laporte, Ardavan Asef-Vaziri, and Chelliah Sriskandarajah, Some applications of the generalized travelling salesman problem, Journal of the Operational Research Society, vol. 47, pp. 1461 - 1467, 1996.
André Langevin, Martin Desrochers, Jacques Desrosiers, Sylvie Gélinas, and François Soumis, A two-commodity flow formulation for the travelling salesman and the makespan problems with time windows, Networks, vol. 23, pp. 631 - 640, 1993.
Luiz Antonio N. Lorena and Marcelo Gonçalves Narciso, Using logical surrogate information in lagrangean relaxation: An application to symmetric traveling salesman problems, European Journal of Operational Research, vol. 138, pp. 473 - 483, 2002.
Jens Lysgaard, Cluster based branching for the asymmetric travelling salesman problem. Presented at the EURO XV/INFORMS XXXIV Joint International Conference, Barcelona, July 1997.
Vicky H. Mak, On the Asymmetric Travelling Salesman Problem with Replenishment Arcs. PhD thesis, Department of Mathematics and Statistics, The University of Melbourne, August 2001.
Aristide Mingozzi, Lucio Bianco, and Salvatore Ricciardelli, Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints, Operations Research, vol. 45, no. 3, pp. 365 - 377, 1997.
Aristide Mingozzi, Lucio Bianco, and Salvatore Ricciardelli, Dynamic programming strategies for the travelling salesman problem with time window and precedence constraints, Operations Research, vol. 45, pp. 365 - 377, May-June 1997.
King Tim Mak and Andrew J. Morton, Distances between traveling salesman tours, Discrete Applied Mathematics, vol. 58, pp. 281 - 291, 1995.
Denis Naddef and Giovanni Rinaldi, The graphical relaxation: A new framework for the symmetric traveling salesman polytype, Mathematical Programming, vol. 58, no. 1, pp. 53 - 88, 1993.
Giuseppe Paletta, The period traveling salesman problem: a new heuristic algorithm, Computers & Operations Research, vol. 29, pp. 1343 - 1352, 2002.
Manfred W. Padberg and Giovanni Rinaldi, Optimization of a 532-city symmetric traveling salesman problem by branch and cut, Operations Research Letters, vol. 6, pp. 1 - 7, March 1987.
Manfred Padberg and Giovanni Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems, SIAM Review, vol. 33, no. 1, pp. 60 - 100, 1991.
Maurice Queyranne and Yaoguang Wang, Hamiltonian path and symmetric travelling salesman polytypes, Mathematical Programming, vol. 58, no. 1, pp. 89 - 110, 1993.
Martin W. P. Savelsbergh, An efficient implementation of local search algorithms for constrained routing, European Journal of Operational Research, vol. 47, pp. 75 - 85, 1990.
Martin W. P. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research, vol. 4, pp. 285 - 305, 1985/6.
Shigeru Tsubakitani and James R. Evans, An empirical study of a new metaheuristic for the traveling salesman problem, European Journal of Operational Research, vol. 104, pp. 113 - 128, 1998.
Shigeru Tsubakitani and James R. Evans, Optimizing tabu list size for the traveling salesman problem, Computers & Operations Research, vol. 25, no. 2, pp. 91 - 97, 1998.
Christos Voudouris and Edward Tsang, Guided local search and its application to the traveling salesman problem, European Journal of Operational Research, vol. 113, pp. 469 - 499, 1999.
William J. Wolfe, A fuzzy hopfield-tank traveling salesman problem model, INFORMS Journal of Computing, vol. 11, no. 4, pp. 329 - 344, 1999.
Russ J. Vander Wiel and Nikolaos V. Sahinidis, An exact solution approach for the time-dependent traveling-salesman problem, Naval Research Logistics, vol. 43, pp. 797 - 820, 1996.

Papers on the VRP

N. R. Achuthan and L. Caccetta, Integer linear programming formulation for a vehicle routing problem, European Journal of Operational Research, vol. 52, pp. 86 - 89, 1991.
David Applegate, William Cook, Sanjeeb Dash, and André Rohe, Solution of a min-max vehicle routing problem, INFORMS Journal of Computing, vol. 14, pp. 132 - 143, Spring 2002.
N. R. Achuthan, L. Caccetta, and S. P. Hill, Capacitated vehicle routing problem: Some new cutting planes, Asia-Pacific Journal of Operational Research, vol. 15, pp. 109 - 123, 1998.
Jürgen Antes and Ulrich Derigs, A new parallel tour construction algorithm for the vehicle routing problem with time windows, tech. rep., Lehrstuhl für Wirtschaftsinformatik und Operations Research, Universität zu Köln, March 1995.
M. A. Al-Fawzan and K. S. Al-Sultan, The vehicle routing problem: a survey, in Proceedings of the Fifth Industrial Engineering Research Conference, pp. 269 - 274, 1996.
Kemal Altinkemer and Bezalel Gavish, Heuristics for delivery problem with constants error guarantees, Transportation Science, vol. 24, pp. 294 - 297, November 1990.
Kemal Altinkemer and Bezalel Gavish, Parallel savings based heuristics for the delivery problem, Operations Research, vol. 39, pp. 456 - 469, May-June 1991.
Tetsuo Asano, Naoki Katoh, and Kazuhiro Kawashima, A new approximation algorithm for the capacitated vehicle routing problem on a tree, Journal of Combinatorial Optimization, vol. 5, pp. 213 - 231, 2001.
J. R. Araque, G. Kudva, T. L. Morin, and J. F. Pekny, A branch-and-cut algorithm for vehicle routing problems, Annals of Operations Research, vol. 50, pp. 37 - 59, 1994.
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, and Takeshi Tokuyama, Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k, in STOC '97, pp. 275 - 283, ACM, 1997.
Yogesh Agarwal, Kamlesh Mathur, and Harvey M. Salkin, A set-partitioning-based exact algorithm for the vehicle routing problem, Networks, vol. 19, pp. 731 - 749, 1989.
L. D. Aronson, Algorithms for vehicle routing - a survey, Tech. Rep. 96-21, Delft University of Technology, 1996.
Enrico Angelelli and Maria Grazia Speranza, The periodic vehicle routing problem with intermediate facilities. Working paper.
C. Archetti and M. G. Speranza, The 1-skip collection problem. Draft, April 2002.
J. Ben Atkinson, A greedy look-ahead heuristic for combinatorial optimization: An application to vehicle scheduling with time windows, Journal of the Operational Research Society, vol. 45, no. 6, pp. 673 - 684, 1994.
J. Ben Atkinson, A greedy randomised search heuristic for time-constrained vechile scheduling and the incorporation of a learning strategy, Journal of the Operational Research Society, vol. 49, pp. 700 - 708, 1998.
Nagraj Balakrishnan, Simple heuristics for the vehicle routing problem with soft time windows, Journal of the Operational Research Society, vol. 44, no. 3, pp. 279 - 287, 1993.
John E. Beasley, Route first-cluster second methods for vehicle routing, Omega, vol. 11, no. 4, pp. 403 - 408, 1983.
Bruno De Backer and Vincent Furnon, Meta-heuristics in constraint programming experiments with tabu search on the vehicle routing problem, in Proceedings of the 2nd International Conference on Metaheuristics, July 1997.
Bruno De Backer and Vincent Furnon, Meta-heuristics - Advances and Trends in Local Search Paradigms for Optimization, ch. 5. Local Search in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problem, pp. 63 - 76. Kluwer Academic Publishers, 1999.
Chuda Basnet, Les Foulds, and Magid Igbaria, Fleetmanager: a microcomputer-based decision support system for vehicle routing, Decision Support Systems, vol. 16, pp. 195 - 207, 1996.
Bruno De Backer, Vincent Furnon, Philip Kilby, Patrick Prosser, and Paul Shaw, Local search in constraint programming: Application to the vehicle routing problem. Submitted to CP-97 Workshop on Scheduling, 1997.
Bruno De Backer, Vincent Furnon, Philip Kilby, Patrick Prosser, and Paul Shaw, Solving vehicle routing problems using constraint programming and metaheuristics. Submitted to Journal of Heuristics, 1997.
C. Basnet, L. R. Foulds, and J. M. Wilson, Heuristics for vehicle routing on tree-like networks, Journal of the Operational Research Society, vol. 50, pp. 627 - 635, 1999.
Lawrence Bodin and Bruce Golden, Classification in vehicle routing and scheduling, Networks, vol. 11, pp. 97 - 108, 1981.
Lawrence Bodin, Bruce Golden, Arjang Assad, and Michael Ball, Routing and scheduling of vehicles and crews - the state of art, Computers & Operations Research, vol. 10, no. 2, pp. 62 - 212, 1983.
Philippe Badeau, Michel Gendreau, François Guertin, Jean Yves Potvin, and Éric Taillard, A parallel tabu search heuristic for the vehicle routing problems with time windows, Tech. Rep. CRT-95-84, Centre de recherche sur les transports, December 1995.
Ulrich Blasum and Winfried Hochstättler, Application of the branch and cut method to the vehicle routing problem, tech. rep., Universität zu Köln, May 2000.
Russell Bent and Pascal Van Hentenryck, citeseer.nj.nec.com/454901.html>A two-stage hybrid local search for the vehicle routing problem with time windows, Tech. Rep. CS-01-06, 2001.
Jonathan F. Bard, Liu Huang, Moshe Dror, and Patrick Jaillet, A branch and cut algorithm for the vrp with satellite facilities, IIE Transactions, vol. 30, pp. 821 - 834, 1998.
A. Bachem, W. Hochstättler, and M. Malich, The simulated trading heuristic for solving vehicle routing problems, Tech. Rep. 93.139, Mathematisches Institut, Universität zu Köln, 1993.
A. Bachem, W. Hochstättler, and M. Malich, Simulated trading - a new parallel approach for solving vehicle routing problems, in Parallel Computing: Trends and Applications, 1994. Report no. 92.125.
A. Bachem, W. Hochstättler, and M. Malich, The simulated trading heuristic for solving vehicle routing problems, Discrete Applied Mathematics, vol. 65, pp. 47 - 72, 1996.
Bernd Bullnheimer, Richard F. Hartl, and Christine Strauss, An improved ant system for the vehicle routing problem. Available on the web, 1997.
Bernd Bullnheimer, Richard F. Hartl, and Christine Strauss, Meta-heuristics - Advances and Trends in Local Search Paradigms for Optimization, ch. 20. Applying the ant system to the vehicle routing problem, pp. 285 - 296. Kluwer Academic Publishers, 1999.
Arno Bruns and Andreas Klose, A locate first - route second heuristic for a combined location-routeing problem, in Operations Research Proceedings 1996 (U. Zimmerman, U. Derigs, W. Gaul, R. H. Möring, and K. P. Schuster, eds.), pp. 49 - 54, Springer, 1996.
Jonathan F. Bard, George Kontoravdis, and Gang Yu, A branch-and-cut procedure for the vehicle routing problem with time windows, Transportation Science, vol. 36, no. 2, pp. 250 - 269, 2002.
Lawrence Bodin and Laurence Levy, Visualization in vehicle routing and scheduling problems, ORSA Journal of Computing, vol. 6, pp. 261 - 269, Summer 1994. Commentary.
J. M. Belenguer, M. C. Martinez, and E. Mota, A lower bound for the split delivery vehicle routing problem, Operations Research, vol. 48, no. 5, pp. 801 - 810, 2000.
Melissa Bowers, Charles E. Noon, and Benjamin Thomas, A parallel implementation of the tssp+1 decomposition for the capacity-constrained vehicle routing problem, Computers & Operations Research, vol. 23, no. 7, pp. 723 - 732, 1996.
Gulay Barbarosoglu and Demet Ozgur, A tabu search algorithm for the vehicle routing problem, Computers & Operations Research, vol. 26, pp. 255 - 270, 1999.
Lawrence D. Bodin, Twenty years of routing and scheduling, Operations Research, vol. 38, pp. 571 - 579, July-August 1990.
Kai Borre, GIS i Danmark, ch. GPS til GIS, pp. 203 - 207. Teknisk Forlag, 1994. In Danish.
John J. Bartholdi, Loren K. Platzman, R. Lee Collins, and William H. Warden, A minimal technology routing system for meals on wheels, Interfaces, vol. 13, no. 3, pp. 1 - 8, 1983.
José Brandão, Meta-heuristics - Advances and Trends in Local Search Paradigms for Optimization, ch. 2. Metaheuristic for the Vehicle Routing Problem with Time Windows, pp. 19 - 36. Kluwer Academic Publishers, 1999.
Olli Bräysy, Local search and Variable Neighborhood Search Algorithms for the Vehicle Routing Problem with Time Windows. PhD thesis, University of Vaasa, 2001.
Alex Van Breedam, Vehicle routing: Bridging the gap between theory and practice, Belgian Journal of Operations Research, Statistics and Computer Science, vol. 35, no. 1, pp. 63 - 80, 1995.
Edward K. Baker and Joanne R. Schaffer, Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints, American Journal of Mathematical and Management Science, vol. 6, no. 3, 4, pp. 261 - 300, 1986.
Barrie M. Baker and Janice Sheasby, Extensions to the generalised assignment heuristic for vehicle routing, European Journal of Operational Research, vol. 119, pp. 147 - 157, 1999.
Enrique Benavent and David Soler, The directed rural postman problem with turn penalties, Transportation Science, vol. 33, no. 4, pp. 408 - 418, 1999.
Dimitris J. Bertsimas and David Simchi-Levi, A new generation of vehicle routing research: robust algorithms, addressing uncertainty, Operations Research, vol. 44, no. 2, pp. 286 - 304, 1996.
Julien Bramel and David Simchi-Levi, Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows, Operations Research, vol. 44, pp. 501 - 509, May-June 1996.
Julien Bramel and David Simchi-Levi, On the effectiveness of set covering formulations for the vehicle routing problem with time windows, Operations Research, vol. 45, pp. 295 - 301, March-April 1997.
Roberto Cordone and Roberto Wolfler Calvo, A heuristic for the vehicle routing problem with time windows, Journal of Heuristics, vol. 7, pp. 107 - 129, 2001.
Zbigniew Czech and Piotr Czarnas, Parallel simulated annealing for the vehicle routing problem with time windows, in Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (EUROMICRO-PDP '02), The IEEE Computer Society, IEEE, 2002.
Ann Campbell, Lloyd Clarke, Anton Kleywegt, and Martin Savelsbergh, The inventory routing problem, tech. rep., The Logistics Institute, Georgia Institute of Technology, October 1997.
V. Campos, A. Corberan, and E. Mota, Polyhedral results for a vehicle routing problem, European Journal of Operational Research, vol. 52, pp. 75 - 85, 1991.
Alain Chabrier, Émilie Danna, and Claude Le Pape, Copération entre génération de colonnes avec tournées sans cycle et recherche locale appliquée au routage de véhicules. Draft [in French], 2002.
P. De Causmaecker, P Demeester, P. De Pauw-Waterschoot, and G. Vanden Berghe, Agents in a route planning application, JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science, vol. 40, pp. 105 - 116, 2000.
Alberto Caprara, Matteo Fischetti, and Adam N. Letchford, On the separation of maximally violated mod-k cuts, Math Programming Series A, vol. 87, pp. 37 - 56, 2000.
J F. Cordeau, M. Gendreau, G. Laporte, J Y. Potvin, and F. Semet, A guide to vehicle routing heuristics, Journal of the Operational Research Society, vol. 53, pp. 512 - 522, 2002.
I Ming Chao, Bruce L. Golden, and Edward A. Wasil, The team orienteering problem, European Journal of Operational Research, vol. 88, no. 3, pp. 464 - 474, 1996.
Gerard Cornuejol and Farid Harche, Polyhedral study of the capacitated vehicle routing problem, Mathematical Programming, vol. 60, pp. 21 - 52, 1993.
A. Concialini and G. Hasle, The greentrip toolkit - sustainable transportation via intelligent routing systems. Available via the web, 1997.
Nicos Christofides, The Travelling Salesman Problem, ch. Vehicle Routing, pp. 431 - 449. John Wiley & Sons, 1985.
Frank H. Cullen, John J. Jarvis, and H. Donald Ratliff, Set partitioning based heuristics for interactive routing, Networks, vol. 11, no. 2, pp. 125 - 143, 1981.
A. Chin, H. Kit, and A. Lim, A new ga approach for the vehicle routing problem, in 11th IEEE International Conference on Tools with Artificial Intelligence, 1999. Proceedings, pp. 307 - 310, IEEE, IEEE Computer Society, 1999.
Teodor Gabriel Crainic and Gilbert Laporte, Fleet Management and Logistics. Kluwer, 1998.
Yves Caseau and François Laburthe, Heuristics for large constrained vehicle routing problems, Journal of Heuristics, vol. 5, pp. 281 - 303, 1999.
Jens Clausen, GIS i Danmark 2, ch. Ruteoptimering - Modeller og løsningsmetoder, pp. 125 - 134. Teknisk forlag, 1999. In Danish.
Lau Hoong Chuin and Dennis Seah Vei Ming, An efficient technique for routing of vehicles reactively. Working paper, available via the web, 1998.
Nicos Christofides, Aristide Mingozzi, and Paolo Toth, The vehicle routing problem, in Combinatorial Optimization (Nicos Christofides, Aristide Mingozzi, Paolo Toth, and Claudio Sandi, eds.), ch. 11, pp. 315 - 338, John Wiley & Sons, 1979.
Nicos Christofides, Aristide Mingozzi, and Paolo Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxation, Mathematical Programming, vol. 20, no. 3, pp. 255 - 282, 1981.
Nicos Christofides, Aristide Mingozzi, and Paolo Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks, vol. 11, no. 2, pp. 145 - 164, 1981.
Jean Francois Cordeau, Federico Pasin, and Marius M. Solomon, An integrated model for logistics network design. Draft, May 2002.
Wen Chyuan Chiang and Robert A. Russell, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Annals of Operations Research, vol. 63, pp. 3 - 27, 1996.
Wen Chyuan Chiang and Robert A. Russell, A reactive tabu search metaheuristic for the vehicle routing problem with time windows, INFORMS Journal of Computing, vol. 9, no. 4, pp. 417 - 430, 1997.
William Cook and Jennifer L. Rich, A parallel cutting-plane algorithm for the vehicle routing problem with time windows, Tech. Rep. TR99-04, Departement of Computational and Applied Mathematics, Rice University, 1999.
Alberto G. Canen and Leonard G. Scott, Bridging theory and practice in VRP, Journal of the Operational Research Society, vol. 46, pp. 1 - 8, 1995.
G. Clarke and W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol. 12, pp. 568 - 581, 1964.
Xiong Chen, Weishui Wan, and Xinhe Xu, Modeling rolling batch planning as vehicle routing problem with time windows, Computers Operations Research, vol. 25, no. 12, pp. 1127 - 1136, 1998.
Claudio Barbieri da Cunha and Joffre Swait, New dominance criteria for the generalized permanent labelling algorithm for the shortest path problem with time windows on dense graphs, International Transactions in Operations Research, vol. 7, pp. 139 - 157, 2000.
Yvan Dumas, Jacques Desrosiers, and cois Soumis Fran, The pickup and delivery problem with time windows, Eurpean Journal of Operational Research, vol. 54, pp. 7 - 22, 1991.
Martin Desrochers, Jacques Desrosiers, and Marius Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, vol. 40, pp. 342 - 354, March-April 1992.
Guy Desaulniers, Jacques Desrosiers, and Maurius M. Solomon, Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems, Tech. Rep. G-99-36, GERAD, August 1999.
Jacques Desrosiers, Yvan Dumas, Marius M. Solomon, and F. Soumis, Time constrained routing and scheduling, tech. rep., GERAD, September 1993.
Guy Desaulniers, Jacques Desrosiers, Maurius M. Solomon, and François Soumis, The vrp with time windows, Tech. Rep. G-99-13, GERAD, February 1999.
Martin Desrochers, An algorithm for the shortest path problem with resource constraints, Tech. Rep. G-88-27, GERAD, École des Hautes Études Commerciales, Université de Montréal, September 1988.
Jan Dethloff, Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up, OR Spektrum, vol. 23, pp. 79 - 96, 2001.
Jan Dethloff, Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls, Journal of the Operational Research Society, vol. 53, no. 1, pp. 115 - 118, 2002.
Mauro Dell'Amico, Matteo Fischetti, and Paolo Toth, Heuristic algorithms for the multi depot vehicle scheduling problem, Management Science, vol. 39, pp. 115 - 125, January 1993.
Cor de Jong, Goos Kant, and André van Vliet, Efficient implementations of the savings method for the vehicle routing problem with time windows. Working paper.
M. Desrochers, C. V. Jones, J. K. Lenstra, M. W. P. Savelsbergh, and L. Stougie, Towards a model and algorithm management system for vehicle routing and scheduling problems. Draft, November 1998.
Wout Dullaert, Gerrit K. Janssens, Kenneth Sörensen, and Bert Vernimmen, New heuristics for the fleet size and mix vehicle routing problem with time windows. Working paper, available via the web, 2001.
Moshe Dror and André Langevin, Transformations and exact node routing solutions by column generation, Tech. Rep. G-2000-19, GERAD, April 2000.
G. Desaulniers, J. Lavigne, and F. Soumis, Multi-depot vehicle scheduling problems with time windows and waiting costs, European Journal of Operational Research, vol. 111, no. 3, pp. 479 - 494, 1998.
Martin Desrochers, Jan K. Lenstra, Martin W. P. Savelsbergh, and François Soumis, Vehicle routing with time windows: Optimization and approximation, Vehicle Routing: Methods and Studies, pp. 65 - 84, 1988. Edited by Golden and Assad.
Moshe Dror, Gilbert Laporte, and Pierre Trudeau, Vehicle routing with split deliveries, Discrete Applied Mathematics, vol. 50, pp. 239 - 254, 1994.
Lucia M. A. Drummund, Luiz S. Ochi, and Dalessandro S. Vianna, An asynchronous parallel metaheuristic for the period vehicle routing problem, Future Generation Computer Systems, vol. 17, pp. 379 - 386, 2001.
Moshe Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Operations Research, vol. 42, pp. 977 - 978, September-October 1994.
Martin Desrochers and François Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR, vol. 26, no. 3, pp. 191 - 212, 1988.
Martin Desrochers and François Soumis, A reoptimization algorithm for the shortest path problem with time windows, European Journal of Operational Research, vol. 35, pp. 242 - 254, 1988.
Jacques Desrosiers, François Soumis, and Martin Desrochers, Routing with time windows by column generation, Networks, vol. 14, no. 4, pp. 545 - 565, 1984.
Jacques Desrosiers, François Soumis, Martin Desrochers, and Michel Sauvé, Routing and scheduling with time windows solved by network relaxation and branch-and-bound on time variables, Computer Scheduling of Public Transport 2, pp. 451 - 469, 1985.
Jacques Desrosiers, François Soumis, Martin Desrochers, and Michel Sauvé, Methods for routing with time windows, European Jounal of Operational Research, vol. 23, pp. 236 - 245, 1986.
Moshe Dror and Pierre Trudeau, Savings by split delivery routing, Transportation Science, vol. 23, pp. 141 - 145, 1989.
Moshe Dror and Pierre Trudeau, Split delivery routing, Naval Research Logistics, vol. 37, pp. 383 - 402, 1990.
W. Dullaert, Impact of relative route length on the choice of time insertion criteria for insertion heuristics for the vehicle routing problem with tim windows. Working paper, available via the web.
Wout Dullaert, Scheduling flexibility and the contribution maximizing vehicle routing problem with time windows. Working paper, available via the web, 2001.
Tim Duncan, Schedule-it: An intelligent vehicle scheduling system. Draft.
Tim Duncan, Experiments in the use of neighbourhood search techniques for vehicle routing, Tech. Rep. AIAI-TR-176, Artificial Intelligence Applications Institute, University of Edinburgh, June 1995.
Martin Desrochers and T. W. Verhoog, A new heuristic for the fleet size and mix vehicle routing problem, Computers & Operations Research, vol. 18, no. 3, pp. 263 - 274, 1991.
H. A. Eiselt, Michel Gendreau, and Gilbert Laporte, Arc routing problems, part i: The chinese postman problem, Operations Research, vol. 43, no. 2, pp. 231 - 243, 1995.
H. A. Eiselt, Michel Gendreau, and Gilbert Laporte, Arc routing problems, part ii: The rural postman problem, Operations Research, vol. 43, no. 3, pp. 399 - 414, 1995.
Georg Engelhard, Tore Grünert, Hans Jürgen Sebastian, Michael Thärigen, Markus Katz, and Ruth Kuchem, Und ab geht die post - transportplanung für den brieftransport der deutschen post ag. Technical Report.
Søren Ellegaard, GIS i Danmark 2, ch. GPS - Det niende vidunder, pp. 39 - 55. Teknisk forlag, 1999. In Danish.
P. W. Frizzell and J. W. Giffin, The split delivery vehicle scheduling problem with time windows and grid network distances, Computers & Operations Research, vol. 22, no. 6, pp. 655 - 667, 1995.
Marshall L. Fisher, Arnold J. Greenfield, R. Jaikumar, and Joseph T. Lester III, A computerized vehicle routing application, Interfaces, vol. 12, August 1982.
Marshall L. Fisher, Optimal solution of vehicle routing problems using minimum k-trees, Operations Research, vol. 42, pp. 626 - 642, July-August 1994.
Marshall Fisher, Vehicle routing, in Network Routing (M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds.), vol. 8 of Handbooks in Operations Research and Management Science, ch. 1, pp. 1 - 79, North-Holland, 1997.
Marshall L. Fisher and Ramchandran Jaikumar, A generalized assignment heuristic for vehicle routing, Networks, vol. 11, pp. 109 - 124, 1981.
Marshall L. Fisher, Kurt O. Jörnsten, and Oli B. G. Madsen, Vehicle routing with time windows - two optimization algorithms, Tech. Rep. IMM-REP-1994-28, Department of Mathematical Modelling, Technical University of Denmark, 1994.
Marshall L. Fisher, Kurt O. Jörnsteen, and Oli B. G. Madsen, Vehicle routing with time windows: Two optimization algorithms, Operations Research, vol. 45, pp. 488 - 492, May-June 1997.
Matteo Fischetti, Andrea Lodi, and Paolo Toth, A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Draft.
Christian Foisy and Jean Yves Potvin, Implementing an insertion heuristic for vehicle routing on parallel hardware, Computers & Operations Research, vol. 20, no. 7, pp. 737 - 745, 1993.
Matteo Fischetti, Paolo Toth, and Daniele Vigo, A branch-and-bound algorithm for the capacitated vehicle routing problem for directed graphs, Operations Research, vol. 42, pp. 846 - 859, September-October 1994.
Bruce L. Golden and Arjang A. Assad, Persepectives on vehicle routing: Exciting new developments, Operations Research, vol. 34, pp. 803 - 810, September-October 1986.
Bruce L. Golden and Edward K. Baker, Future directions in logistics research, Transportation Research A, vol. 19A, no. 5/6, pp. 405 - 409, 1985.
Sylvie Gélinas, Martin Desrochers, Jacques Desrosiers, and Marius M. Solomon, A new branching strategy for time constrained routing problems with application to backhauling, Annals of Operations Research, vol. 61, pp. 91 - 109, 1995.
F. Gheysens, B. Golden, and A. Assad, A comparison of techniques for solving the fleet size and mix vehicle routing problem, OR Spektrum, vol. 6, pp. 207 - 216, 1984.
Michel Gendreau, François Guertin, Jean Yves Potvin, and Éric Taillard, Parallel tabu search for real-time vehicle routing and dispatching, Transportation Science, vol. 33, no. 4, pp. 381 - 390, 1999.
Hermann Gehring and Jörg Homberger, A parallel two-phase metaheuristic for routing problems with time windows, Asia-Pacific Journal of Operational Research, vol. 18, pp. 35 - 47, 2001.
Hermann Gehring and Jörg Homberger, Parallelization of a two-phase metaheuristic for routing problems with time windows, Journal of Heuristics, vol. 8, pp. 251 - 276, 2002.
Manfred Gronalt, Richard F. Hartl, and Marc Reimann, Time constrained pickup and delivery of full truckloads. Draft.
Gianpaolo Ghiani and Gennaro Improta, An algorithm for the hierarchical chinese postman problem, Operations Research Letters, vol. 26, pp. 27 - 32, 2000.
Gianpaolo Ghiani and Gennaro Improta, An efficient transformation of the generalized vehicle routing problem, European Journal of Operational Research, vol. 122, pp. 11 - 17, 2000.
Marc Goetschalckx and Charlotte Jacobs-Blecha, The vehicle routing problem with backhauls, European Journal of Operational Research, vol. 42, no. 1, pp. 39 - 51, 1989.
Arvind Gupta and Ramesh Krishnamurti, Parallel algorithms for vehicle routing problems, in Fourth International Conference on High-Performance Computing, pp. 144 - 151, 1997.
Martin Grötschel, Sven O. Krumke, and Jörg Rambau, Online optimization of complex transportation systems. Prepring, 2001.
Gianpaolo Ghiani and Gilbert Laporte, A branch-and-cut algorithm for the undirected rural portman problem, Tech. Rep. G-97-65, GERAD, 1997.
Holger Glaab, A new variant of a vehicle routing problem: Lower and upper bounds, European Journal of Operational Research, vol. 139, pp. 557 - 577, 2002.
Michel Gendreau, Gilbert Laporte, and Jean Yves Potvin, Metaheuristics for the vehicle routing problem, Tech. Rep. G-98-52, GERAD, 1999.
Bruce L. Golden, Gilbert Laporte, and Éric D. Taillard, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Tech. Rep. CRT-95-74, Centre de recherche sur les transports, 1995.
Bruce L. Golden, Gilbert Laporte, and Éric D. Taillard, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Computers & Operations Research, vol. 24, no. 5, pp. 445 - 452, 1997.
Michel Gendreau, Gilbert Laporte, and Sylvain Yelle, Efficient routing of service vehicles, Engineering Optimization, vol. 28, no. 4, pp. 263 - 271, 1997.
Bruce L. Golden, Tom L. Magnanti, and H. Q. Nguyen, Implementing vehicle routing algorithms, Networks, vol. 7, pp. 113 - 148, 1977.
Bruce L. Golden, Introduction to and recent advances in vehicle routing methods, in Transportation Planning Models (M. Florian, ed.), pp. 383 - 418, Elsevier Science Publishers B.V., 1984.
Nima Golbaharan, An Application of Optimization to the Snow Removal Problem. PhD thesis, Linkøping University, 2001.
Bruno Laurent Garcia, Jean Yves Potvin, and Jean Marc Rousseau, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, Computers & Operations Research, vol. 21, no. 9, pp. 1025 - 1033, 1994.
Luca Maria Gambardella, Éric Taillard, and Giovanni Agazzi, MACS - VRPTW: A multiple ant colony system for vehicle routing problems with time windows, Tech. Rep. IDSIA-06-99, IDSIA, 1999.
D. J. Guan and Xuding Zhu, Multiple capacity vehicle routing on paths, SIAM Journal of Discrete Mathematics, vol. 11, no. 4, pp. 590 - 602, 1998.
Karsten Halse, Modeling and Solving Complex Vehicle Routing Problems. PhD thesis, Department for Mathematical Modeling, Technical University of Denmark, 1992.
Michael A. Haughton, Route reoptimization's impact on delivery efficiency, Transportation Research Part E, vol. 38, pp. 53 - 63, 2002.
Christopher A. Hane, Cynthia Barnhart, Ellis L. Johnson, Roy E. Marsten, Georg L. Nemhauser, and Gabriele Sigismondi, The fleet assignment problem: solving a large-scale integer program, Mathematical Programming, vol. 70, pp. 211 - 232, 1995.
Zachary Hall, Rajan Batta, and Robert Szczerba, Supply-chain optimization, OR Insight, vol. 14, no. 2, pp. 20 - 30, 2001.
Fuh hwa Franklin~Liu and Sheng yuan Shen, An overview of a heuristic for vehicle routing problem with time windows, Computers & Industrial Engineering, vol. 37, pp. 331 - 334, 1999.
Fuh hwa Franklin~Liu and Sheng yuan Shen, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, European Journal of Operational Research, vol. 118, pp. 485 - 504, 1999.
Jörg Homberger and Hermann Gehring, Two evolutionary metaheuristics for the vehicle routing problem with time windows, INFOR, vol. 37, pp. 297 - 318, August 1999.
Anja Hamacher, Winfried Hochstättler, and Christoph Moll, Tree partitioning under constraints clustering for vehicle routing problems, Tech. Rep. 97.283, Universität zu Köln, 1998. 2. revision.
Anja Hamacher, Winfried Hochstättler, and Christoph Moll, Tree partitioning under constraints - clustering for vehicle routing problems, Discrete Applied Mathematics, vol. 99, pp. 55 - 69, 2000.
Curt A. Hjorring, The Vehicle Routing Problem and Local Search Metaheuristics. PhD thesis, Department of Engineering Science, The University of Auckland, October 1995.
M. Haimovich and A. H. G. Rinnooy Kan, Bounds and heuristics for capaciteted routing problems, Mathematics of Operations Research, vol. 10, pp. 527 - 542, November 1985.
Anja Hamacher and Christopher Moll, A new heuristic for vehicle routing with narrow time windows, in Operation Research Proceedings 1996 (U. Zimmerman, U. Derigs, W. Gaul, R. H. Möring, and K. P. Schuster, eds.), pp. 301 - 306, Springer, 1996.
Alain Hertz and Michel Mittaz, A variable neighborhood descent algorithm for the undirected capacitated arc routing problem, Transportation Science, vol. 35, no. 4, pp. 425 - 434, 2001.
Jörg Homberger, Extended solomon's vrptw instances. Available on the web at tt www.fernuni-hagen.de/WINF/touren/inhalte/probinst.htm.
Sung Chul Hong and Yang Byung Park, A heuristic for bi-objective vehicle routing with time window constraints, International Journal of Production Economics, vol. 62, pp. 249 - 258, 1999.
David J. Houck, Jean Claude Picard, Maurice Queyranne, and R. R. Vemuganti, The travelling salesman problem as a constrained shortest path problem: Theory and computational experience, Opsearch, vol. 17, no. 2 & 3, pp. 93 - 109, 1980.
Soumia Ichoua, Problémes de gestion de flottes de véhicules en temps réel. PhD thesis, Université de Montréal, August 2001.
Magid Igbaria, Ralph H. Sprague Jr., Chuda Basnet, and Les Foulds, The impact and benefits of a dss: The case of fleetmanager, Information & Management, vol. 31, pp. 215 - 225, 1996.
G. Ioannou, M. Kritikos, and G. Prastacos, A greedy look-ahead heuristic for the vehicle routing problem with time windows, Journal of the Operational Research Society, vol. 52, pp. 523-537, 2001.
Stefan Irnich, The shortest path problem with k-cyle elimination (k\leq 3): Improving a branch and price algorithm for the vrptw. Available via the web on the authors homepage, 2001.
William R. Stewart Jr. and Bruce L. Golden, A lagrangean relaxation heuristic for vehicle routing, European Journal of Operational Research, vol. 15, pp. 84 - 88, 1984.
Kurt O. Jörnsten, Oli B. G. Madsen, and Bo Sørensen, Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting, Tech. Rep. 5, Department of Mathematical Modelling, Technical University of Denmark, 1986.
Gilbert Laporte Jacques~Renaud, Fayez F.~Boctor, An improved petal heuristic for the vehicle routing problem, Journal of the Operational Research Society, vol. 47, pp. 329 - 336, 1996.
Brian Kallehauge, Solutions to the solomon instances for vrptw. Supplementary report for Masters Thesis no. 13, [in Danish].
Brian Kallehauge, Lagrangean duality and non-differentiable optimization - applied on routing with time windows, Master's thesis, Department of Mathematical Modelling, Technical University of Denmark, 2000. IMM-EKS-2000-13, [in Danish].
George Kontoravdis and Jonathan F. Bard, A grasp for the vehicle routing problem with time windows, ORSA Journal on Computing, vol. 7, no. 1, pp. 10 - 23, 1995.
Niklas Kohl, Jacques Desrosiers, Oli B. G. Madsen, Marius M. Solomon, and François Soumis, k-path cuts for the vehicle routing problem with time windows, Tech. Rep. IMM-REP-1997-12, Department of Mathematical Modelling, Technical University of Denmark, 1997.
Niklas Kohl, Jacques Desrosiers, Oli B. G. Madsen, Marius M. Solomon, and François Soumis, 2-path cuts for the vehicle routing problem with time windows, Transportation Science, vol. 33, no. 1, pp. 101 - 116, 1999.
Brian Kallehauge, Jesper Larsen, and Oli B. G. Madsen, Lagrangean duality applied on vehicle routing with time windows - experimental results, Tech. Rep. IMM-REP-2001-9, Informatics and Mathematical Modelling, Technical University of Denmark, 2001.
Niklas Kohl and Oli B. G. Madsen, An optimization algorithm for the vehicle routing problem with time windows based on lagrangean relaxation, Tech. Rep. 17/1993, Department of Mathematical Modelling, Technical University of Denmark, 1993.
Niklas Kohl and Oli B. G. Madsen, An optimization algorithm for the vehicle routing problem with time windows based on lagrangean relaxation, Operations Research, vol. 45, pp. 395 - 406, May-June 1997.
Niklas Kohl, Exact methods for Time Constained Routing and Related Scheduling Problems. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark, 1995. IMM-PHD-1995-16.
Georgios Athanassio Kontoravdis, The Vehicle Routing Problem with Time Windows. PhD thesis, The University of Texas at Austin, August 1997.
Yiannis A. Koskosidis, Warren B. Powell, and Marius M. Solomon, An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints, Transportation Science, vol. 26, pp. 69 - 85, May 1992.
Philip Kilby, Patrick Prosser, and Paul Shaw, Guided local search for the vehicle routing problem, in MIC97, 2nd International Conference on Metaheuristics, INRIA & PRiSM, 1997.
Philip Kilby, Patrick Prosser, and Paul Shaw, A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Working paper, 1998.
Philip Kilby, Patrick Prosser, and Paul Shaw, Meta-heuristics - Advances and Trends in Local Search Paradigms for Optimization, ch. 32. Guided Local Search for the Vehicle Routing Problem with Time Windows, pp. 473 - 486. Kluwer Academic Publishers, 1999.
Jens Kanstrup Kristensen, Route planning and set partitioning, Master's thesis, Department of Mathematical Modelling, Technical University of Denmark, 1995. [in danish].
A. W. J. Kolen, A. H. G. Rinnooy Kaan, and H. W. J. M. Trienekens, Vehicle routing with time windows, Operations Research, vol. 35, pp. 266 - 273, March-April 1987.
G. A. P. Kindervater and M. W. P. Savelsbergh, Vehicle routing 2 - handling side constraints. part of a book to be published later., 1995.
James P. Kelly and Jiefeng Xu, A set-partitioning-based heuristic for the vehicle routing problem, INFORMS Journal on Computing, vol. 11, no. 2, pp. 161 - 172, 1999.
Gilbert Laporte, The vehicle routing problem: An overview of exact and approximante algorithms, European Journal of Operational Research, vol. 59, pp. 345 - 358, 1992.
Gilbert Laporte, Recent advances in routing algorithms, Tech. Rep. G-97-38, GERAD and École des Hautes Études Commerciales, May 1997.
Jesper Larsen, Parallellization of the Vehicle Routing Problem with Time Windows. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark, 1999. IMM-PHD-1999-62.
Jesper Larsen, Jens Clausen, and Oli B. G. Madsen, Using parallel computers to solve the vehicle routing problem with time windows, Tech. Rep. IMM-TP-2000-15, Informatics and Mathematical Modelling, Technical University of Denmark, 2000.
Adam N. Letchford and Richard W. Eglese, New cutting-planes for vehicle routing problems. Presented at CO '96, April 1996.
Adam N. Letchford, The general routing polyhedron: A unifying framework, European Journal of Operational Research, vol. 112, pp. 122 - 133, 1999.
J. K. Lenstra and A. H. G. Rinnooy Kan, Complexity of vehicle routing and scheduling problems, Networks, vol. 11, pp. 221 - 227, 1981.
Hoong Chuin Lau and Zhe Liang, Pickup and delivery with time windows: Algorithms and test case generation, in Proceedings of the 13th International Conference on Tools with Artificial Intelligence, pp. 333 - 340, IEEE, 2001.
Antoine Landrieu, Yazid Mati, and Zdenek Binder, A tabu search heuristic for the single vehicle pickup and delivery problem with time windows, Journal of Intelligent Manufacturing, vol. 12, pp. 497 - 508, 2001.
Gilbert Laporte and Y. Nobert, A branch and bound algorithm for the capacitated vehicle routing problem, OR Spektrum, vol. 5, pp. 77 - 85, 1984.
Gilbert Laporte, Yves Nobert, and Martin Desrochers, Optimal routing under capacity and distance restrictions, Operations Research, vol. 33, pp. 1050 - 1073, 1985.
Gilbert Laporte and Ibrahim H. Osman, Routing problems: A bibliography, Annals of Operations Researcg, vol. 61, pp. 227 - 262, 1995.
Gilbert Laporte and Frédéric Semet, Classical heuristics for the vehicle routing problem, Tech. Rep. G-98-54, GERAD, 1999.
F H. Liu and S Y. Shen, The fleet size and mix vehicle routing problem with time windows, Journal of Operational Research Society, vol. 50, pp. 721 - 732, 1999.
Tzong Ru Lee and Ji Hwa Ueng, A study of vehicle routing problems with load-balancing, International Journal of Physical Distribution & Logistics Management, vol. 29, no. 10, pp. 646 - 658, 1999.
Karsten Lund, The ultimative list of vehicle routing references. Available on the WWW at tt http://-www.imm.dtu.dk/-documents/-groups/-or/-orweb/-vrp_1.html, June 1996.
Jens Lysgaard, Dynamic transportation networks in vehicle routing and scheduling, Interfaces, vol. 22, pp. 45 - 55, 1992.
Sushil J. Louis, Xiangying Yin, and Zhen Ya Yuan, Multiple vehicle routing with time windows using genetic algorithms. Draft, 1999.
Oli B. G. Madsen, Variable splitting and vehicle routing problems with time windows, Tech. Rep. 1A/1988, Department of Mathematical Modelling, Technical University of Denmark, 1988.
Oli B. G. Madsen, Lagrangean relaxation and vehicle routing, tech. rep., Department of Mathematical Modelling, Technical University of Denmark, 1990.
Oli B. G. Madsen, Large-Scale Optimization and Vehicle Routing. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark, 1997.
T. L. Magnanti, Combinatorial optimization and vehicle fleet planning: Perspectives and prospects, Networks, vol. 11, pp. 179 - 213, 1981.
J. Michael McGovern, Route your way to cost savings, Transportation & Distribution, pp. 42 - 46, April 1998.
Chryssi Malandraki and Mark S. Daskin, Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms, Transportation Science, vol. 26, pp. 185 - 200, August 1992.
Redouane Mechti, Contribution á la résolution des problémes de tournées de véhicule avec fenêtres de temps et composition de flotte. PhD thesis, Universite de Versailles Saint-Quentin-en-Yvelines, March 1999.
Aristide Mingozzi, Simone Giorgi, and Roberto Baldacci, An exact method for the vehicle routing problem with backhauls, Transportation Science, vol. 33, no. 3, pp. 315 - 329, 1999.
Miroslaw Malek, Mohan Guruswamy, Mihir Pandya, and Howard Owens, Serial and parallel simulated annealing and tabu search algorithms for the travelling salesman problem, Annals of Operations Research, vol. 21, pp. 59 - 84, 1989.
Donald L. Miller, A mathcing based exact algorithm for capacitated vehicle routing problems, ORSA Journal of Computing, vol. 7, no. 1, pp. 1 - 9, 1995.
Oli B. G. Madsen and Allan Larsen, Solving the multiple depot vehicle scheduling problem in a major scandinavian city, Tech. Rep. IMM-REP-1997-10, Department of Mathematical Modelling, Technical University of Denmark, 1997.
Pontien Mbaraga, André Langevin, and Gilbert Laporte, Two exact algorithms for the vehicle routing problem on trees, Naval Research Logistics, vol. 46, pp. 75 - 89, February 1999.
R. H. Mole, The curse of unintended rounding error: A case from the vehicle scheduling literature, Journal of the Operational Research Society, vol. 34, pp. 607 - 613, 1983.
Gur Mosheiov, Vehicle routing with pick-up and delivery: Tour-partitioning heuristics, Computers & Industrial Engineering, vol. 34, no. 3, pp. 669 - 684, 1998.
R. Mechti, S. Poujade, C. Roucairol, and B. Lemarié, Exact and approximate methods for a real-life mail collecting approach. Manuscript.
R. Mechti, S. Poujade, C. Roucairol, and B. Lemarié, Global and local moves in tabu search: a real-life mail collecting application. Manuscript.
Abdolhamid Modares, Samerkae Somhom, and Takao Enkawa, A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems, International Transactions in Operations Research, vol. 6, pp. 591-606, 1999.
Oli B. G. Madsen, Kim Tosti, and Jan Vælds, A heuristic method for dispatching repair men, Tech. Rep. IMM-REP-1994-22, Department of Mathematical Modelling, Technical University of Denmark, 1994.
William P. Nanry and J. Wesley Barnes, Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B, vol. 34, pp. 107 - 121, 2000.
Charles E. Noon, John Mittenthal, and Rekha Pillai, A tssp+1 decomposition strategy for the vehicle routing problem, European Journal of Operational Research, vol. 79, no. 3, pp. 524 - 536, 1994.
Otto Anker Nielsen, Ulla Skjelbo, and Per Thorlacius, GIS i Danmark 2, ch. GIS i den kollektive trafikplanlægning, pp. 173 - 192. Teknisk forlag, 1999. In Danish.
H. L. Ong, B. W. Ang, T. N. Goh, and C. C. Deng, A vehicle routing and scheduling problem with time windows and stochastic demand constraints, Asia-Pacific Journal of Operational Research, vol. 14, no. 1, pp. 1 - 17, 1997.
Brian Olsen, Route-planning with time restrictions, Tech. Rep. 2/88, Department of Mathematical Modelling, Technical University of Denmark, 1988. [in danish].
Ibrahim Hassan Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, vol. 41, pp. 421 - 451, 1993.
Luiz S. Ochi, Dalessandro S. Vianna, Lúcia M. A. Drummund, and André O. Victor, An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet, in Genetic Programming. First European Workshop, EuroGP'98 (W. Banzhaf, R. Poli, M. Schoenauer, and T.C. Fogarty, eds.), pp. 187 - 195, Springer Verlag, 1998.
Luiz S. Ochi, Dalessandro S. Vianna, Lucia M. A. Drummund, and André O. Victor, A parallel evolutionary algorithm for the period vehicle routing problem with heterogeneous fleet, Future Generation Computer Systems, vol. 14, pp. 285 - 292, 1998.
H. Paessens, The savings algorithm for the vehicle routing problem, European Journal of Operational Research, vol. 34, pp. 336 - 344, 1988.
Jean Yves Potvin and Sam Bengio, The vehicle routing problem with time windows - part II : Genetic search, INFORMS Journal of Computing, vol. 8, pp. 165 - 172, Spring 1996.
Jean Yves Potvin, Christophe Duhamel, and François Guertin, A genetic algorithm for vehicle routing with backhauling, Applied Intelligence, vol. 6, pp. 345 - 355, 1996.
Jean Yves Potvin, Danny Dubé, and Christian Robillard, A hybrid approach to vehicle routing using neural networks and genetic algorithms, Applied Intelligence, vol. 6, pp. 241 - 252, 1996.
João Pedro Pedroso, Niche search: an application in vehicle routing, in 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence, pp. 177 - 182, IEEE, 1998.
Jean Yves Potvin, Tanguy Kervahut, Bruno Laurent Garcia, and Jean Marc Rousseau, The vehicle routing problem with time windows - part I : Tabu search, INFORMS Journal of Computing, vol. 8, pp. 158 - 164, Spring 1996.
A. Poot, G. Kant, and A. P. M. Wagelmans, A savings based method for real-life vehicle routing problems, Journal of the Operational Research Society, vol. 53, pp. 57 - 68, 2002.
Camilla Ørbæk Petersen and Karsten Lund, Stokastisk ruteplanlægning - løsning og analyse, Master's thesis, Department of Business Administration, University of Odense, March 1995. [in danish].
Narihiro Park, Hiroyuki Okano, and Hiroshi Imai, A path-exchange-type local search algorithm for vehicle routing and its efficient search strategy, Journal of the Operations Research Society of Japan, vol. 43, no. 1, pp. 197 - 208, 2000.
Jean Yves Potvin and Jean Marc Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, European Journal of Operational Research, vol. 66, pp. 331 - 340, 1993.
Jean Yves Potvin and Jean Marc Rousseau, An exchange heuristic for routering problems with time windows, Journal of the Operational Research Society, vol. 46, no. 12, pp. 1433 - 1446, 1995.
Jean Yves Potvin and Christian Robillard, Clustering for vehicle routing with a competitive neural network, Neurocomputing, vol. 8, pp. 125 - 139, 1999.
Jean Yves Potvin, Yu Shen, and Jean Marc Rousseau, Neural networks for automated vehicle dispatching, Computers & Operations Research, vol. 19, no. 3/4, pp. 267 - 276, 1992.
César Rego, Local Search and Neighborhood Structures for Vehicle Routing Problems: Sequential and Parallel Algorithms. PhD thesis, University of Versailles, March 1996.
César Rego, A subpath ejection method for the vehicle routing problem, Management Science, vol. 44, no. 10, pp. 1447 - 1459, 1998.
Louis Martin Rousseau, Michel Gendreau, and Gilles Pesant, Using constraint-based operators to solve the vehicle routing problem with time windows, Journal of Heuristics, vol. 8, pp. 43 - 58, 2002.
David M. Ryan, Curt Hjorring, and Fred Glover, Extensions of the petal methods for vehicle routing, Journal of the Operations Research Society, vol. 44, no. 3, pp. 289 - 296, 1993.
Jennifer L. Rich, A Computational Study of Vehicle Routing Applications. PhD thesis, Rice University, 1999.
Patricio Rodríguez, Miguel Nussbaum, Rodrigo Baeza, Gerardo León, Marcos Sepúlveda, and Agustín Cobián, Using global search heuristics for the capacity vehicle routing problem, Computers & Operation Research, vol. 25, no. 5, pp. 407 - 417, 1988.
Yves Rochat and Éric D. Taillard, Probalistic diversification and intensification in local search for vehicle routing, Journal of Heuristics, vol. 1, pp. 147 - 167, 1995.
Robert A. Russel, An effective heuristic for the m-tour travelling salesman problem with some side conditions, Operations Research, vol. 25, pp. 517 - 524, 1977.
Robert A. Russell, Hybrid heuristics for the vehicle routing problem with time windows, Transportation Science, vol. 29, pp. 156 - 166, May 1995.
Martin W. P. Savelsbergh, The vehicle routing problem with time windows: Minimizing route duration, ORSA Journal of Computing, vol. 4, pp. 147 - 154, Spring 1992.
Marius M. Solomon, Edward K. Baker, and Joanne R. Schaffer, Vehicle Routing: Methods and Studies, ch. Vehicle Routing and Scheduling Problems with Time Window Constraints: Efficient implementations of solution improvement procedures, pp. 85 - 105. Elsevier Science Publishers, 1988.
Linus Schrage, Formulation and structure of more complex/realistic routing and scheduling problems, Networks, vol. 11, pp. 229 - 232, 1981.
Marius M. Solomon and Jacques Desrosiers, Time window constrained routing and scheduling problems, Transportation Science, vol. 22, pp. 1 - 13, February 1988.
Jürgen Schulze and Torsten Fahle, A parallel algorithm for the vehicle routing problem with time window constraints, Annals of Operations Research, vol. 86, pp. 585 - 607, 1999.
Martin W. P. Savelsbergh and Marc Goetschalckx, An efficient approximation algorithm for the fixed routes problem. Available on the web at the hompage of M. W. P. Savelsbergh, September 1992.
Paul Shaw, A new local search algorithm providing high quality solutions to vehicle routing problems. Available on the web, July 1997.
Paul Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in Principles and Practice of Constraint Programming - CP98 (Michael Maher and Jean Francois Puget, eds.), vol. 1520 of Lecture Notes in Computer Science, pp. 417 - 431, Springer, 1998.
Alan Slater, Specification for a dynamic vehicle routing and scheduling system, International Journal of Transport Management, vol. 1, pp. 29 - 40, 2002.
S. Salhi and G. Nagy, A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the Operational Research Society, vol. 50, pp. 1034 - 1042, 1999.
Norman M. Sadeh, Yoichiro Nakakuki, and Sam R. Thangiah, Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing, Annals of Operations Research, vol. 75, pp. 189 - 208, 1997.
Marius M. Solomon, On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints, Networks, vol. 16, pp. 161 - 174, 1986.
Marius M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, vol. 35, pp. 254 - 265, March-April 1987.
Michael R. Swihart and Jason D. Papastavrou, A stochastic and dynamic model for the single-vehicle pick-up and delivery problem, European Journal of Operational Research, vol. 114, pp. 447 - 464, 1999.
Mikkel Sigurd, David Pisinger, and Michael Sig, The pickup and delivery problem with time windows and precedences, Tech. Rep. TR-00/08, Department of Computer Science, University of Copenhagen, 2000.
Marc Sol and Martin W. P. Savelsbergh, A branch-and-price algorithm for the pickup and delivery problem with time windows. Available on the web.
Martin Savelsbergh and Marc Sol, Drive: Dynamic routing of independent vehicles. Available on the web, July 1996.
Frédéric Semet and Éric Taillard, Solving real-life vehicle routing problems efficiently using tabu search, Annal of Operations Research, vol. 41, pp. 469 - 488, 1993.
Éric Taillard, Parallel iterative search methods for vehicle routing problems, Networks, vol. 23, pp. 661 - 673, 1993.
Éric Taillard, A heuristic column generation method for the heterogeneous fleet VRP, tech. rep., CRT, 1996.
Éric Taillard, Phillipe Badeau, Michel Gendreau, François Guertin, and Jean Yves Potvin, A tabu search heristic for the vehicle routing problem with soft time windows, Tech. Rep. CRT-95-66, CRT, 1995.
Sam R. Thangiah, Vehicle routing with time windows using genetic algorithms. Available from the authors homepage.
The GreenTrip Consortium, Efficient logistics via intelligent vehicle routing systems. Presented at the European Conference on Integration in Manufacturing (IiM), Dresden, Germany, September 24-26, 1997, 1997.
C. D. Tarantilis and C. T. Kiranoudis, Distribution of fresh meat, Journal of food engineering, vol. 51, pp. 85 - 91, 2002.
Éric Taillard, Gilbert Laporte, and Michel Gendreau, Vehicle routing with multiple use of vehicles, Tech. Rep. CRT-95-19, Centre de recherche sur les transports, Universite de Montreal, March 1995.
Éric Taillard, Gilbert Laporte, and Michel Gendreau, Vehicle routeing with multiple use of vehicles, Journal of the Operational Research Society, vol. 47, pp. 1065 - 1070, 1996.
K. C. Tan, T. H. Lee, K. Ou, and L. H. Lee, A messy genetic algorithm for the vehicle routing problem with time window constraints, in Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, pp. 679 - 686, 2001.
Sam R. Thangiah, Kendall E. Nygard, and Paul L. Juell, Gideon: a genetic algorithm system for vehicle routing with time windows, in Proceedings. Seventh IEEE Conference on Artificial Intelligence Applications, pp. 322 - 328, IEEE, IEEE Computer Society Press, 1991.
Sam R. Thangiah, Ibrahim H. Osman, and Tong Sun, Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows, Tech. Rep. SRU-CpSc-TR-94-27, Computer Science Department, Slippery Rock University, 1994.
Sam R. Thangiah, Ibrahim H. Osman, and Tong Sun, Metaheuristics for vehicle routing problems with time windows, Tech. Rep. UKC/IMS/OR94/8, Institute of Mathematics and Statistics, University of Kent, 1995.
Paul M. Thomson and Harilaos N. Psaraftis, Cyclic transfer algorithms for multivehicle routing and scheduling problems, Operations Research, vol. 41, pp. 935 - 946, September-October 1993.
Dusan Teodorovic and Goran Pavkovic, The fuzzy set theory appraoch to the vehicle routing problem when demand at nodes is uncertain, Fuzzy Sets and Systems, vol. 82, pp. 307 - 317, 1996.
Sam R. Thangiah, Jean Yves Potvin, and Tong Sun, Heuristic approaches to vehicle routing with backhauls and time windows, Computers & Operations Research, vol. 23, no. 11, pp. 1043 - 1057, 1996.
Paolo Toth and Daniele Vigo, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, European Journal of Operational Research, vol. 113, pp. 528 - 543, 1999.
Eiichi Taniguchi, Tadashi Yamada, and Yasushi Kakimoto, Probabilistic vehicle routing and scheduling with variable travel times, in Proceedings of Control in Transportation Systems, pp. 33 - 38, 2001.
Alex van Breedam, Improvement heuristics for the vehicle routing problem based on simulated annealing, European Journal of Operational Research, vol. 86, pp. 480 - 490, 1995.
Alex van Breedam, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Computers & Operations Research, vol. 28, pp. 289 - 315, 2001.
L. J. J. van~der Bruggen, J. K. Lenstra, and P. C. Schuur, Variable-depth search for the single-vehicle pickup and delivery problem with time windows, Transportation Science, vol. 27, no. 3, pp. 298 - 311, 1993.
H. R. G. van Landeghem, A bi-criteria heuristic for the vehicle routing problem with time windows, European Journal of Operational Research, vol. 36, pp. 217 - 226, 1988.
A. Weintraub, J. Aboud, C. Fernandez, G. Laporte, and E. Ramirez, An emergency vehicle routing dispatching system for an electric utility in chile, Journal of Operational Research Society, vol. 50, pp. 690 - 696, 1999.
Peter Wark and John Holt, A repeated matching heuristic for the vehicle routeing problem, Journal of the Operational Research Society, vol. 45, no. 10, pp. 1156 - 1167, 1994.
Tai Hsi Wu, Chinyao Low, and Jiunn Wei Bai, Heuristic solutions to multi-depot location-routing problems, Computers & Operations Research, vol. 29, pp. 1393 - 1415, 2002.
Heng Wei, Qiang Li, and Carl E. Kurt, Heuristic optimization models for service-request vehicle routing with time windows in a geographic information systems environment, Transportation Research Record, vol. 1667, pp. 42 - 51, 1999.
Anthony Wren, Heuristics ancient and modern: Transport scheduling through the ages, Journal of Heuristics, vol. 4, pp. 87 - 100, 1998.
Hang Xu, Zhi Long Chen, Srinivas Rajagopal, and Sundar Arunapuram, Solving a practical pickup and delivery problem. Draft, 2001.
Candace Arai Yano, Thomas J. Chan, Lori Kaplan Richter, Theodore Cutler, Katta G. Murty, and David McGettigan, Vehicle routing at quality stores, Interfaces, vol. 17, pp. 52 - 63, March-April 1987.

Papers on Airline OR and related areas

Ranga Anbil, Cynthia Barnhart, Levent Hatay, Ellis L. Johnson, and V. S. Ramakrishnan, Crew-pairing optimization at american airlines decision technologies, in Optimization in Industry: Mathematical Programming and Modeling Techniques in Practice (Tito A. Ciriani and Robert C. Leachman, eds.), ch. 2, pp. 31 - 36, John Wiley & Sons, 1993.

Ranga Anbil, Francisco Barahona, Laszlo Ladanyi, Russel Rushmeier, and Jane Snowdon, Airline optimization, OR/MS Today, vol. 26, no. 6, pp. 26 - 29, 1999.

Michael F. Argüello, Jonathan F. Bard, and Gang Yu, A grasp for aircraft routing in response to groundings and delays, Journal of Combinatorial Optimization, vol. 5, pp. 211 - 228, 1997.

Ranga Anbil, John J. Forrest, and William R. Pulleyblank, Column generation and the airline crew pairing problem, Documenta Mathematica, vol. 3, pp. 677 - 686, 1998. Extra Volume ICM 1998.

Ranga Anbil, Eric Gelman, Bruce Patty, and Rajan Tanga, Recent advances in crew-pairing optimization at american airlines, Interfaces, vol. 21, pp. 62 - 74, January-February 1991.

Erik Andersson, Efthymios Housos, Niklas Kohl, and Dag Wedelin, Crew pairing optimization, in OR in Airline Industry (Gang Yu, ed.), Kluwer Academic Publishers, 1997.

Sven Eric Andersson, Opeational planning in airline buisness - can science improve efficiency? experiences from SAS, European Journal of Operational Research, vol. 43, pp. 3 - 12, 1989.

Elin Armini and Angela Wallenburg, Analysis and design of a user interface to crew control, Master's thesis, School of Mathematical and Computing Sciences, Chalmers University of Technology and Gothenburg University, 1999.

A. Bachem, M. Bodmann, G. Bolz, T. Emden-Weinert, A. Erdmann, M. Kiahaschemi, B. Monien, H. J. Prömel, J. Schepers, R. Schrader, J. Schulze, and S. Tschöke, Verbundprojekt paralor: Parallele algorithmen zur wegeoptimierung in flugplanung und logistik, Tech. Rep. 97-268, Universität zu Köln, 1997.

Cynthia Barnhart, Natashia L. Boland, Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, and Rajesh G. Shenoi, Flight string models for aircraft fleeting and routing, Transportation Science, vol. 32, no. 3, pp. 208 - 220, 1998.

John E. Beasley and B. Cao, A dynamic programming based algorithm for the crew scheduling problem, Computers Operations Research, vol. 25, pp. 567 - 582, 1998.

E. Rod Butchers, Paul R. Day, Andrew P. Goldie, Stephen Miller, Jeff A. Meyer, David M. Ryan, Amanda C. Scott, and Chris A. Wallace, Optimised crew scheduling at air new zealand. Draft, March 2000.

Ralf Borndörfer, Martin Grötschel, Fridolin Klostermeier, and Christian Küttner, Telebus berlin : Vehicle scheduling in a dial-a-ride system, Tech. Rep. SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin, April 1997.

Cynthia Barnhart, Ellis L. Johnson, Ranga Anbil, and Levent Hatay, A column-generation technique for the long-haul crew-assignment problem, in Optimization in Industry 2 (T. A. Ciriani and R. C. Leachman, eds.), ch. 2, pp. 7 - 24, John Wiley & Sons, 1994.

Cynthia Barnhart and Rajesh G. Shenoi, An alternate model and solution approach for the long-haul crew pairing problem. Available on the web at Cynthia Barnharts homepage, July 1996.

Sydney C. K. Chu and Edmond C. H. Chan, Crew scheduling of light rail transit in hong kong: from modeling to implementation, Computers Operations Research, vol. 25, no. 11, pp. 887 - 894, 1998.

Hai D. Chu, Eric Gelman, and Ellis L. Johnson, Solving large scale crew scheduling problems, European Journal of Operational Research, vol. 97, pp. 260 - 268, 1997.

L. W. Clarke, C. A. Hane, E. L. Johnson, and G. L. Nemhauser, Maintenance and crew considerations fleet assignment, Transportation Science, vol. 30, no. 3, pp. 249 - 260, 1996.

Lloyd Clarke, Ellis Johnson, George Nemhauser, and Zhongxi Zhu, The aircraft rotation problem, Annals of Operations Research, vol. 67, pp. 33 - 46, 1997.

Jia Ming Cao and Adib Kanafani, Real-time decision support for integration of airline fleight cancellations and delays. part i: Mathematical formulation, Transportation Planning and Technology, vol. 20, pp. 183 - 199, 1997.

Jia Ming Cao and Adib Kanafani, Real-time decision support for integration of airline fleight cancellations and delays. part ii: Algorithm and computational experiments, Transportation Planning and Technology, vol. 20, pp. 201 - 217, 1997.

Michael Clarke, Ladislav Lettovky, and Barry Smith, The development of the airline operations control center. Working paper, August 1999.

Luis Cavique, César Rego, and Isabel Themido, Meta-heuristics - Advances and Trends in Local Search Paradigms for Optimization, ch. 3. New Heuristic Algorithms for the Crew Scheduling Problem, pp. 37 - 47. Kluwer Academic Publishers, 1999.

Luis Cavique, César Rego, and Isabel Themido, Subgraph ejection chains and tabu search for the crew scheduling problem, Journal of the Operational Research Society, vol. 50, pp. 608 - 616, 1999.

Jean Francois Cordeau, Goran Stojkovic, Francois Soumis, and Jacques Desrosiers, Benders decomposition for simultaneous aircraft routing and crew scheduling, Transportation Science, vol. 35, no. 4, pp. 375 - 388, 2001.

Alberto Caprara, Paolo Toth, Daniele Vigo, and Matteo Fischetti, Modeling and solving the crew rostering problem, Operations Research, vol. 46, pp. 820 - 830, November-December 1999.

G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M. M. Solomon, and F. Soumis, Crew pairing at air france, European Journal of Operational Research, vol. 97, pp. 245 - 259, 1997.

Guy Desaulniers, Jacques Desrosiers, Yvan Dumas, Marius M. Solomon, and Francois Soumis, Daily aircraft routing and scheduling, Management Science, vol. 43, pp. 841 - 855, June 1997.

Guy Desaulniers, Jacques Desrosiers, Michel Gamache, and François Soumis, Crew scheduling in air transportation, Tech. Rep. G-97-26, GERAD and École Polytechnique de Montréal and École des Hautes Études Commerciales de Montréal, May 1997.

Guy Desaulniers, Jacques Desrosiers, Arielle Lasry, and Marius M. Solomon, Crew pairing for a regional carrier, Tech. Rep. G-97-33, GERAD and École Polytechnique de Montréal and École des Hautes Études Commerciales de Montréal and Numetrix Limited and Northeastern University, May 1997.

Jolanta Drott, Erik Hasselberg, Niklas Kohl, and Mathias Kremer, A plannning system for locomotive scheduling. Working Paper.

Paul R. Day and David M. Ryan, Flight attendant rostering for short-haul airline operations, Operations Research, vol. 45, pp. 649 - 661, September-October 1997.

Matteo Fischetti, Silvano Martello, Paolo Toth, and Daniele Vigo, An lp-based heuristic approach to the crew scheduling problem, in Tristan III, vol. 1, pp. 1 - 12, 1998.

Paul Forsyth and Anthony Wren, An ant system for bus driver scheduling, Tech. Rep. 97.25, School of Computer Studies, University of Leeds, July 1997.

Michel Gamache, cois Soumis Fran, Gérald Marquis, and Jacques Desrosiers, A column generation approach for large-scale aircrew rostering problems, Operations Research, vol. 47, no. 2, pp. 247 - 263, 1999.

Glenn W. Graves, Richard D. McBride, Ira Gershkoff, Diane Anderson, and Deepa Mahidhara, Flight crew scheduling, Management Science, vol. 39, pp. 736 - 745, June 1993.

Andrew Paul Goldie, Optimal Airline Crew Scheduling Using Dynamic Column Generation. PhD thesis, Department of Engineering Science, School of Engineering, The University of Auckland, 1996.

Tore Grünert, Hans Jürgen Sebastian, and Klaus Büdenbender, A hybrid tabu search/branch and bound algorithm for the direct flight network design problem. Revision 3.5.99, 1999.

M. Gamache, F. Soumis, G. Marquis, and J. Desrosiers, A column generation approach for large scale aircrew rostering problems, Tech. Rep. G-94-20, GERAD, 1998.

Michel Gamache, François Soumis, Daniel Villeneuve, Jacques Desrosiers, and Éric Gélinas, The preferential bidding system at air canada, Tech. Rep. G-97-12, GERAD and École Polytechnique de Montréal and École des Hautes Études Commerciales de Montréal and Ad Opt Technologies Inc., April 1997.

Ram Gopalan and Kalyan T. Talluri, The aircraft maintenance routing problem, Operations Research, vol. 46, pp. 260 - 271, March-April 1998.

Christopher A. Hanse, Cynthia Barnhart, Ellis L. Johnson, Roy E. Marsten, George L. Nemhauser, and Gabriele Sigismondi, The fleet assignment problem: solving a large-scale integer program, Mathematical Programming, vol. 70, pp. 211 - 232, 1995.

Ahmad I. Jarrah, Jon Goodstein, and Ram Narasimhan, An efiicient airline re-fleeting model for the incremental modification of planned fleet assignments, Transportation Science, vol. 34, no. 4, pp. 349 - 363, 2000.

Maj Britt Lykke Jensen and Anders Eggers Rasmussen, Overbookingstrategi - optimering af flysædeallokering hos sas, Master's thesis, Technical University of Denmark, 1999. No. 02/99.

Ahmad I. Z. Jarrah, Gang Yu, Nirup Krishnamurthy, and Ananda Rakshit, A decision support framework for airline flight cancellations and delays, Transportation Science, vol. 27, no. 3, pp. 266 - 280, 1993.

Diego Klapjan and Karsten Schwan, Airline crew pairing generation in parallel. Working paper, 1999.

Helena Ramalhinho Lourenço, José Pinto Paix o, and Rita Portugal, Metaheuristics for the bus-driver scheduling problem. Available via the web, 1998.

Ladislav Lettovsky, Airline Operations Recovery: An Optimization Approach. PhD thesis, Geogia Institute of Technology, 1997.

David Levine, Application of a hybrid genetic algorithm to airline crew scheduling, Computers Operations Research, vol. 23, no. 6, pp. 547 - 558, 1996.

Sylvie Lavoie, Michel Minoux, and Edouard Odier, A new approach for crew pairing problems by column generation with an application to air transport, European Journal of Operational Research, vol. 35, pp. 45 - 58, 1988.

Colin Layfield, Barbara M. Smith, and Anthony Wren, Bus relief point selection using constraint programming, Tech. Rep. 98.22, School of Computer Studies, University of Leeds, October 1998.

Andrew J. Mason, Elastic constraint branching, the wedelin/carmen lagrangian heuristic and integer programming for personnel scheduling. Found at the authors website, September 2001.

A. Mingozzi, M. A. Boschetti, S. Ricciardelli, and L. Bianco, A set partitioning approach to the crew scheduling problem, Operations Research, vol. 47, no. 6, pp. 873 - 888, 1999.

Satya Prakash, B. V. Balaji, and Deepak Tuteja, Optimizing dead mileage in urban bus routes through a nondominated solution approach, European Journal of Operational Research, vol. 114, pp. 465 - 473, 1999.

Brian Rexing, Cynthia Barnhart, Tim Kniker, and Ahmad Jarrah, Airline fleet assignment with time windows. Presented at ISMP '97, May 1997.

D. M. Ryan and B. A. Foster, An integer programming approach to scheduling, in Computer Scheduling of Public Transport (A. Wren, ed.), pp. 269 - 280, North-Holland Publishing Company, 1981.

D. M. Ryan and J. C. Falkner, On the integer properties of scheduling set partitioning models, European Journal of Operational Research, vol. 35, pp. 442 - 456, 1988.

Ananda Rakshit, Nirup Krishnamurthy, and Gang Yu, System operations advisor: A real-time decision support system for managing airline operations at united airlines, Interfaces, vol. 26, no. 2, pp. 50 - 58, 1996.

Jerrold Rubin, A technique for the solution of massive set covering problems, with application to airline crew scheduling, Transportation Science, vol. 7, pp. 34 - 48, 1973.

David M. Ryan, The solution of massive generalized set partitioning problems in aircrew rostering, Journal of the Operational Research Society, vol. 43, no. 5, pp. 459 - 467, 1992.

Mirela Stojkovic, François Soumis, and Jacques Desrosiers, The operational airline crew scheduling problem, Transportation Science, vol. 32, no. 3, pp. 232 - 245, 1998.

Clive Thomas, Kevin Campbell, Gail Hines, and Michael Racer, Airbus packing at Federal Express, Interfaces, vol. 28, pp. 21 - 30, 1998.

Dusan Teodorovic and Slobodan Guberinic, Optimal dispatching strategy on an airline network after a schedule perturbation, European Journal of Operational Research, vol. 15, pp. 178 - 182, 1984.

Dusan Teodorovic and Goran Stojkovic, Model to reduce airline schedule disturbances, Journal of Transportation Engineering, vol. 121, no. 4, pp. 324 - 331, 1995.

Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, and George L. Nemhauser, Airline crew scheduling: A new fomulation and decomposition algorithm, Operations Research, 1997.

Alberto Vasquez-Marquez, American airlines arrival slot allocation, Interfaces, vol. 21, pp. 42 - 61, January-February 1991.

Dag Wedelin, The design of a 0-1 integer optimizer and its application in the carmen system, European Journal of Operational Research, vol. 87, pp. 722 - 730, 1995.

Peter Wark, John Holt, Mikael Rönnqvist, and David Ryan, Aircrew schedule generation using repeated matching, European Journal of Operational Research, vol. 102, no. 1, pp. 21 - 35, 1997.

Anthony Wren and Jean Marc Rousseau, Bus driver scheduling - an overview, Tech. Rep. 93.31, School of Computer Studies, University of Leeds, July 1993.

Shangyao Yan and Chung Gee Lin, Airline scheduling for the temporary closure of airports, Transportation Science, vol. 31, no. 1, pp. 72 - 81, 1997.

Shangyao Yan and Yu Ping Tu, Multifleet routing and multistop flight scheduling for schedule pertubation, European Journal of Operational Research, vol. 103, pp. 155 - 169, 1997.

Shangyao Yan and Dah Hwei Yang, A decision support framework for handling schedule pertubation, Tranportation Research B, vol. 30, no. 6, pp. 405 - 419, 1996.

Shangyao Yan and Hwei Fwa Young, A decision support framework for multi-fleet routing and multi-stop flight scheduling, Transportation Research A, vol. 30, no. 5, pp. 379 - 398, 1996.

Automatically generated : Thu Jun 19 01:00:04 2003