Chapter 5
Operations Research and Goods Transportation
Teodor Gabriel Crainic,
Frédéric Semet,
Teodor Gabriel Crainic
Search for more papers by this authorFrédéric Semet
Search for more papers by this authorTeodor Gabriel Crainic,
Frédéric Semet,
Teodor Gabriel Crainic
Search for more papers by this authorFrédéric Semet
Search for more papers by this authorBook Editor(s):Vangelis Th. Paschos,
Vangelis Th. Paschos
Search for more papers by this authorSummary
This chapter illustrates the richness of the transport applications of operations research. It target goods transport, of which the chapter presents a brief introduction, and it tackle a few sectors that are major both in their socio-economic importance and in the methodological developments with which they are associated. The chapter deals with some important design models of transport and logistics systems, whether they are deployed on a large or small scale. It devotes to tactical planning and operations problems of long-distance transporters. The chapter describes the principal models for these variants as well as the associated exact solution methods. It devotes to heuristic approaches. It concentrates on three main variants of the vehicle routing problem (VRP): the capacitated vehicle routing problem (CVRP), the capacitated vehicle routing problem with length constraints (CVRPLC), and the vehicle routing problem with time windows (VRPTW).
Bibliography
- Achuthan N.R., Caccetta L., Hill S.P., “An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem”, Transportation Science, vol. 37, p. 153–169, 2003.
- Addinnour-Helm S., Venkataramanan M.A., “Solution Approaches to Hub Location Problems”, Annals of Operations Research, vol. 78, p. 31–50, 1998.
- Ahuja R.K., Magnanti T.L., Orlin J.B., Network Flows – Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, 1993.
- Aikens C.H., “Facility Location Models for Distribution Planning”, European Journal of Operational Research, vol. 22, p. 263–279, 1985.
- Armacost A.P., Barnhart C., Ware K.A., “Composite Variable Formulations for Express Shipment Service Network Design”, Transportation Science, vol. 36, num. 1, p. 1–20, 2002.
- Assad A.A., “Models for Rail Transportation”, Transportation Research A: Policy and Practice, vol. 14, p. 205–220, 1980.
- Augerat P., Approche polyédrale du problème de tournées de véhicules, PhD thesis, Institut National Polytechnique de Grenoble, Grenoble, France, 1995.
- Augerat P., Belenger J.M., Benavent E., Corberan A., Naddef D., “Separating Capacity Constraints in the CVRP Using Tabu Search”, European Journal of Operational Research, vol. 106, p. 546–557, 1998.
- Aykin T., “On a Quadratic Integer Program for the Location of Interacting Hub Facilities”, European Journal of Operational Research, vol. 46, p. 409–411, 1990.
- Aykin T., “Lagrangian Relaxation Based Approaches to Capacitated Hub-and- Spoke Network Design Problem”, European Journal of Operational Research, vol. 79, p. 501–523, 1994.
- Aykin T., “Networking Policies for the Hub-and-Spoke Systems with Application to the Air Transportation System”, Transportation Science, vol. 29, p. 201–221, 1995.
- Aykin T., “The Hub Location and Routing Problem”, European Journal of Operational Research, vol. 83, p. 200–219, 1995.
- Baker B.M., Ayechew M.A., “A Genetic Algorithm for the Vehicle Routing Problem”, Computers & Operations Research, vol. 30, p. 787–800, 2003.
- Balinski M., Quandt R., “On an Integer Program for a Delivery Problem”,Operations Research, vol. 12, p. 300–304, 1964.
- Balakrishnan A., Magnanti T.L., Mirchandani P., “ Network Design”, M. DELl'AMICO, F. Maffioli, S. Martello, Eds., Annotated Bibliographies in Combinatorial Optimization, p. 311–334, John Wiley & Sons, New York, 1997.
- Barnhart C., Schneur R.R., “Network Design for Express Freight Service”,Operations Research, vol. 44, num. 6, p. 852–863, 1996.
- Beasley J.E., “Route-first Cluster-second Methods for Vehicle Routing”, Omega, vol. 11, p. 403–408, 1983.
- Bent R., VAN HENTENRYCK P., “ A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows”, Transportation Science, 2003.
- Berger J., Barkaoui M., Bräysy O., “A Route-Directed Hybrid Genetic Approach for the Vehicle Routing Problem with Time Windows”, INFOR, vol. 41, p. 179–194, 2003.
- Bourbeau B., Gendron B., Crainic, T.G., “Branch-and-Bound Parallelization Strategies Applied to a Depot Location and Container Fleet Management Problem”, Parallel Computing, vol. 26, num. 1, p. 27–46, 2000.
- Bräysy O., “ A Reactive Variable Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows”, INFORMS Journal on Computing, 2001.
- Bräysy O., Hasle, G., Dullaert, W., “A Multi-Start Local Search Algorithm for the Vehicle Routing Problem with Time Windows”, European Journal of Operational Research, vol. 159, p. 586–605, 2004.
- Bräysy O., Gendreau M., “ Vehicle Routing Problem with Time Windows, Part II: Metaheuristics”, Transportation Science, 2005.
- Braklow J.W., Graham W.W., Hassler S.M., Peck K.E., Powell W.B., “Interactive Optimization Improves Service and Performance for Yellow Freight System”, Interfaces, vol. 22, num. 1, p. 147–172, 1992.
- Buedenbender K., Grünert T., Sebastian H.-J., “A Hybrid Tabu Search/Branch and Bound Algorithm for the Direct Flight Network Design Problem”, Transportation Science, vol. 34, num. 4, p. 364–380, 2000.
- Campbell J.F., “Hub Location and the p-Hub Median Problem”, Operations Research, vol. 44, num. 6, p. 923–935, 1996.
- Campbell J.F., “Integer Programming Formulations of Discrete Hub Location Problem”, European Journal of Operational Research, vol. 72, p. 387–405, 1994.
- CAMPO DALl'ORTO L., Crainic T.G., Léal J.E., Powell W.B., “ The Singlenode Dynamic Service Scheduling and Dispatching Problem”, European Journal of Operational Research, 2004.
- Cheung R.K., Chen C.-Y., “A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem”, Transportation Science, vol. 32, num. 2, p. 142–162, 1998.
- Chiang W.-C., Russell R.A., “A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows”, INFORMS Journal on Computing, vol. 9, p. 417–430, 1997.
10.1287/ijoc.9.4.417 Google Scholar
- Christofides N., Mingozzi A., Toth P., “ The Vehicle Routing Problem”, N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Eds., Combinatorial Optimization, p. 315–338, John Wiley and Sons, New York, 1979.
- Christiansen M., Fagerholt K., Nygreen B., Ronen D., “ Maritime Transportation”, C. Barnhart, G. Laporte, Eds., Transportation, of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 2005.
- Clarke G., Wright J.W., “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points”, Operations Research, vol. 12, p. 568–581, 1964.
- Cordeau J.-F., Toth P., Vigo D., “A Survey of Optimization Models for Train Routing and Scheduling”, Transportation Science, vol. 32, num. 4, p. 380–404, 1998.
- Cordeau J.-F., Laporte G., Mercier A., “A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows”, Journal of the Operational Research Society, vol. 52, p. 928–936, 2001.
- Cordone R., Wolfler-Calvo R., “A Heuristic for Vehicle Routing Problem with Time Windows”, Journal of Heuristics, vol. 7, p. 107–129, 2001.
- Cordeau J.-F., Gendreau M., Laporte G., Potvin J.-Y., Semet F., “A Guide to Vehicle Routing Heuristics”, Journal of the Operational Research Society, vol. 53, p. 512–522, 2002.
- Crainic T.G., Ferland J.-A., Rousseau J.-M., “A Tactical Planning Model for Rail Freight Transportation”, Transportation Science, vol. 18, num. 2, p. 165–184, 1984.
- Crainic T.G., Rousseau J.-M., “Multicommodity, Multimode Freight Transportation: A General Modeling and Algorithmic Framework for the Service Network Design Problem”, Transportation Research B: Methodological, vol. 20, p. 225–242, 1986.
- Crainic T.G., “ Rail Tactical Planning: Issues, Models and Tools”, L. Bianco, A. L. Bella, Eds., Freight Transport Planning and Logistics, Springer-Verlag, Berlin, p. 463–509, 1988.
10.1007/978-3-662-02551-2_16 Google Scholar
- Crainic T.G., Roy J., “O.R. Tools for Tactical Freight Transportation Planning”, European Journal of Operational Research, vol. 33, num. 3, p. 290–297, 1988.
- Crainic T.G., Dejax P.J., Delorme L., “Models for Multimode Multicommodity Location Problems with Interdepot Balancing Requirements”, Annals of Operations Research, vol. 18, p. 279–302, 1989.
10.1007/BF02097809 Google Scholar
- Crainic T.G., Delorme L., Dejax P.J., “A Branch-and-Bound Method for Multicommodity Location with Balancing Requirements”, European Journal of Operational Research, vol. 65, num. 3, p. 368–382, 1993.
- Crainic T.G., Gendreau M., Dejax P.J., “Dynamic Stochastic Models for the Allocation of Empty Containers”, Operations Research, vol. 43, p. 102–302, 1993.
- Crainic T.G., Gendreau M., Soriano P., Toulouse M., “A Tabu Search Procedure for Multicommodity Location/Allocation with Balancing Requirements”, Annals of Operations Research, vol. 41, p. 359–383, 1993.
10.1007/BF02023001 Google Scholar
- Crainic T.G., Delorme L., “Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements”, Transportation Science, vol. 27, num. 2, p. 90–101, 1995.
- Crainic T.G., Toulouse M., Gendreau M., “Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements”, Annals of Operations Research, vol. 63, p. 277–299, 1995.
- Crainic T.G., Toulouse M., Gendreau M., “Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements”, OR Spektrum, vol. 17, num. 2/3, p. 113–123, 1995.
- Crainic T.G., Laporte G., “Planning Models for Freight Transportation”, European Journal of Operational Research, vol. 97, num. 3, p. 409–438, 1997.
- Crainic T.G., Toulouse M., Gendreau M., “Towards a Taxonomy of Parallel Tabu Search Algorithms”, INFORMS Journal on Computing, vol. 9, num. 1, p. 61–72, 1997.
10.1287/ijoc.9.1.61 Google Scholar
- Crainic T.G., “Network Design in Freight Transportation”, European Journal of Operational Research, vol. 122, num. 2, p. 272–288, 2000.
- Crainic T.G., “ Long-Haul Freight Transportation”, R.W. Hall, Ed., Handbook of Transportation Science, p. 451–516, Kluwer Academic Publishers, Norwell, 2nd ed., 2003.
10.1007/0-306-48058-1_13 Google Scholar
- Crainic T.G., “ Parallel Computation, Co-operation, Tabu Search”, C. Rego, B. Alidaee, Eds., Metaheuristic Optimization Via Memory and Evolution: Tabu Search and Scatter Search, p. 283–302, Kluwer Academic Publishers, Norwell, 2005.
10.1007/0-387-23667-8_13 Google Scholar
- Crainic T.G., Kim K.H., “ Intermodal Transportation”, C. Barnhart, G. Laporte, Eds., Transportation, of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 2005.
- Dantzig G.B., Ramser J.H., “The Truck Dispatching Problem”, Management Science, vol. 6, p. 80–91, 1959.
- Daskin M.S., Network and Discrete Location. Models, Algorithms, and Applications, John Wiley & Sons, New York, 1995.
- Daskin M.S., Owen S.H., “ Location Models in Transportation”, R.W. Hall, Ed., Handbook of Transportation Science, p. 321–371, Kluwer Academic Publishers, Norwell, 2th ed., 2003.
10.1007/0-306-48058-1_10 Google Scholar
- Davis D.L., DE JONG K., Vose M.D., Whitley L.D., Evolutionary Algorithms, Springer, New York, 1999.
10.1007/978-1-4612-1542-4 Google Scholar
- Dejax P.J., Crainic T.G., “A Review of Empty Flows and Fleet Management Models in Freight Transportation”, Transportation Science, vol. 21, num. 4, p. 227–247, 1987.
- Delorme L., Roy J., Rousseau J.-M., “ Motor-Carrier Operation Planning Models: A State of the Art”, L. Bianco, A. L. Bella, Eds., Freight Transport Planning and Logistics, Springer-Verlag, Berlin, p. 510–545, 1988.
10.1007/978-3-662-02551-2_17 Google Scholar
- Desrochers M., La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes, Publication 470, Centre de Recherche sur les Transports, University of Montreal, Canada, 1986.
- Desrochers M., Desrosiers J., Solomon M.M., “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows”, Operations Research, vol. 40, p. 342–354, 1992.
- Dréo J., Pétrowski, A., Siarry P., Taillard É.D., Métaheuristiques pour l'Optimisation Difficile, Eyrolles, Paris, 2003.
- Z. Drezner, Ed., Facility Location. A Survey of Applications and Methods, Springer-Verlag, New York, 1995.
10.1007/978-1-4612-5355-6 Google Scholar
- Dror M., “A Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW”, Operations Research, vol. 42, p. 977–978, 1995.
- Equi L., Gallo G., Marziale S., Weintraub A., “A Combined Transportation and Scheduling Problem”, European Journal of Operational Research, vol. 97, num. 1, p. 94–104, 1997.
- Erlenkotter D., “A Dual-Based Procedure for Uncapacitated Facility Location”, Operations Research, vol. 26, p. 992–1009, 1978.
- Ernst A.T., Krishnamoorthy, M., “Efficient Algorithms for the Uncapacitated Single Allocation p-Hub Median Problem”, Location Science, vol. 4, num. 3, p. 139–154, 1996.
10.1016/S0966-8349(96)00011-3 Google Scholar
- Farvolden J.M., Powell W.B., A Dynamic Network Model for Less-Than-Truckload Motor Carrier Operations, Working Paper num. 90-05, Department of Industrial Engineering, University of Toronto, Toronto, ON, Canada, 1991.
- Farvolden J.M., Powell W.B., “Subgradient Methods for the Service Network Design Problem”, Transportation Science, vol. 28, num. 3, p. 256–272, 1994.
- Fisher M.L., Jaikumar R., “A Generalized Assignment Heuristic for the Vehicle Routing”, Networks, vol. 11, num. 1, p. 109–124, 1981.
- Franck M., Wolfe P., “An Algorithm for Quadratic Programming”, Naval Research Logistics Quarterly, vol. 3, p. 95–110, 1956.
10.1002/nav.3800030109 Google Scholar
- Gehring H., Homberger J, “Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows”, Journal of Heuristics, vol. 8, p. 251–276, 2002.
- Gendreau M., Hertz A., Laporte G., “New Insertion and Postoptimization Procedures for the Traveling Salesman Problem”, Operations Research, vol. 40, num. 6, p. 1086–1094, 1992.
- Gendreau M., Hertz A., Laporte G., “A Tabu Search Heuristic for the Vehicle Routing Problem”, Management Science, vol. 40, p. 1276–1290, 1994.
- Gendron B., Crainic T.G., “A Branch-and-Bound Algorithm for Depot Location and Container Fleet Management”, Location Science, vol. 3, num. 1, p. 39–53, 1995.
10.1016/0966-8349(95)00005-3 Google Scholar
- Gendron B., Crainic T.G., “A Parallel Branch-and-Bound Algorithm for Multicommodity Location with Balancing Requirements”, Computers & Operations Research, vol. 24, num. 9, p. 829–847, 1997.
- Gendreau M., Hertz A., Laporte G., Stan M., “A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows”, Operations Research, vol. 46, num. 3, p. 330–335, 1998.
- Gendron B., Potvin J.-Y., Soriano P., “Tabu Search with Exact Neighbor Evaluation for Multicommodity Location with Balancing Requirements”, INFOR, vol. 37, num. 3, p. 255–270, 1999.
- Gendron B., Potvin J.-Y., Soriano P., “A Parallel Hybrid Heuristic for the Multicommodity Capacitated Location Problem with Balancing Requirements”, Parallel Computing, vol. 29, p. 591–606, 2003.
- Gendron B., Potvin J.-Y., Soriano P., “A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements”, Annals of Operations Research, vol. 122, p. 193–217, 2003.
- Ghamlouche I., Crainic T.G., Gendreau M., “Cycle-based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design”, Operations Research, vol. 51, num. 4, p. 655–667, 2003.
- Ghamlouche I., Crainic T.G., Gendreau M., “Path Relinking, Cycle-based Neighbourhoods and Capacitated Multicommodity Network Design”, Annals of Operations Research, vol. 131, p. 109–133, 2004.
- Gillett B., Miller L., “A Heuristic Algorithm for the Vehicle Dispatch Problem”, Operations Research, vol. 22, p. 340–349, 1974.
- Glover F., “Future Paths for Integer Programming and Links to Artificial Intelligence”, Computers & Operations Research, vol. 1, num. 3, p. 533–549, 1986.
- Glover F., “Tabu Search – Part I”, ORSA Journal on Computing, vol. 1, num. 3, p. 190–206, 1989.
10.1287/ijoc.1.3.190 Google Scholar
- Glover F., “Tabu Search – Part II”, ORSA Journal on Computing, vol. 2, num. 1, p. 4–32, 1990.
10.1287/ijoc.2.1.4 Google Scholar
- Glover F., Laguna M., Tabu Search, Kluwer Academic Publishers, Norwell, MA, 1997.
10.1007/978-1-4615-6089-0 Google Scholar
- Godfrey G.A., Powell W.B., “An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management I: Single Period Travel Times”, Transportation Science, vol. 36, num. 1, p. 21–39, 2002.
- Godfrey G.A., Powell W.B., “An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management II: Multiperiod Travel Times”, Transportation Science, vol. 36, num. 1, p. 40–54, 2002.
- Golden B.L., Wasil E.A., Kelly J.P., Chao I.M., “ Metaheuristics in Vehicle Routing”, T. Crainic, G. Laporte, Eds., Fleet Management and Logistics, p. 33–56, Kluwer Academic Publishers, Boston, 1998.
10.1007/978-1-4615-5755-5_2 Google Scholar
- GrüNert T., Sebastian H.-J., Thäerigen M., “ The Design of a Letter-Mail Transportation Network by Intelligent Techniques”, R. Sprague, Ed., Proceedings Hawaii International Conference on System Sciences 32, 1999.
- Grünert T., Sebastian H.-J., “Planning Models for Long-haul Operations of Postal and Express Shipment Companies”, European Journal of Operational Research, vol. 122, p. 289–309, 2000.
- Hadjiconstantinou E., Christofides N., Mingozzi A., “A New Exact Algorithm for the Vehicle Routing Problem Based on q-paths and k-shortest Paths Relaxations”, Annals of Operations Research, vol. 61, p. 21–43, 1995.
- Haghani A.E., “Formulation and Solution of Combined Train Routing and Makeup, and Empty Car Distribution Model”, Transportation Research B: Methodological, vol. 23, num. 6, p. 433–452, 1989.
- Holland J.H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
- Homberger J., Gehring H., “Two Evolutionary Metaheuristics for the Vehicle Routing Problem with Time Windows”, INFOR, vol. 37, p. 297–318, 1999.
- Houck D.J., Picard J.-C., Queyranne M., Vemugant R.R., “The Traveling Salesman as a Constrained Shortest Path Problem: Theory and Computational Experience”, Operations Research, vol. 17, p. 93–109, 1980.
- Instances de Christofides, Mingozzi and Toth, http://mscmga.ms.ic.ac.uk/jeb/orlib/vrpinfo.html.
- Instances de Solomon, http://web.cba.neu.edu/msolomon/problems.htm.
- Instances de PTVC exact, http://www.branchandcut.org.
- Jaillet P., Song G., Yu G., “Airline Network Design and Hub Location Problems”, Location Science, vol. 4, num. 3, p. 195–212, 1996.
10.1016/S0966-8349(96)00016-2 Google Scholar
- Jordan W.C., Turnquist M.A., “A Stochastic Dynamic Network Model for Railroad Car Distribution”, Transportation Science, vol. 17, p. 123–145, 1983.
- Jozefowiez N., Modélisation et résolution approchée de problèmes de tournées multi-objectifs, PhD thesis, Lille University of Science and Technology, France, 2004.
- Kim D., Barnhart C., Ware K., Reinhardt G., “Multimodal Express Package Delivery: A Service Network Design Application”, Transportation Science, vol. 33, num. 4, p. 391–407, 1999.
- Klincewicz J.G., “Heuristics for the p-Hub Location Problem”, European Journal of Operational Research, vol. 53, p. 25–37, 1991.
- Klincewicz J.G., “Avoiding Local Optima in the p-Hub Location Problem Using Tabu Search and GRASP”, Annals of Operations Research, vol. 40, p. 283–302, 1992.
10.1007/BF02060483 Google Scholar
- Klincewicz J.G., “Dual Algorithm for the Uncapacitated Hub Location Problem”, Location Science, vol. 4, num. 3, p. 173–184, 1996.
10.1016/S0966-8349(96)00010-1 Google Scholar
- Kohl N., Desrosiers J., Madsen O.B.G., Solomon M.M., Soumis F., “2-Path Cuts for the Vehicle Routing Problem with Time Windows”, Transportation Science, vol. 33, p. 101–116, 1999.
- Kuby M.J., Gray R.G., “The Hub Network Design Problem with Stopovers and Feeders: The Case of Federal Express”, Transportation Research A: Policy and Practice, vol. 27, num. 1, p. 1–12, 1993.
- Labbé M., Peeters D., Thisse J.-F., “ Location on Networks”, M. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, Eds., Network Routing, vol. 8 of Handbooks in Operations Research and Management Science, p. 551–624, North-Holland, Amsterdam, 1995.
- Labbé M., Louveaux F.V., “ Location Problems”, M. DELl'AMICO, F. Maffioli, S. Martello, Eds., Annotated Bibliographies in Combinatorial Optimization, p. 261–281, John Wiley & Sons, New York, 1997.
- Laporte G., Nobert Y., Desrochers M., “Optimal Routing Under Capacity and Distance Restrictions”, Operations Research, vol. 33, p. 1050–1073, 1985.
- Laporte G., Nobert Y., “Exact Algorithm for the Vehicle Routing Problem”, Annals of Discrete Mathematics, vol. 31, p. 147–184, 1987.
- LE BOUTHILLIER A., Crainic T.G., “A Cooperative Parallel Meta-Heuristic for the Vehicle Routing Problem with Time Windows”, Computers & Operations Research, vol. 32, num. 7, p. 1685–1708, 2005.
- LE BOUTHILLIER A., Crainic T.G., Kropf P., “ A Guided Cooperative Cooperative Search”, IEEE Intelligent Systems, 2005.
- Leddon C.D., Wrathall E., “ Scheduling Empty Freight Car Fleets on the Louisville and Nashville Railroad”, Second International Symposium on the Use of Cybernetics on the Railways, p. 1–6, 1967.
- Lenstra J.K., RINNOOY KAN A.H.G., “Complexity of Vehicle Routing and Scheduling Problems”, Networks, vol. 11, p. 221–227, 1981.
- Lin S., “Computer Solutions of the Traveling Salesman Problem”, Bell System Technical Journal, vol. 44, p. 2245–2269, 1965.
- Liu F.H., Shen S.Y., “A Route-Neighborhood-based Metaheuristic for Vehicle Routing Problem with Time Windows”, European Journal of Operational Research, vol. 118, p. 485–504, 1999.
- Lysgaard J., Letchford A.N., Eglese R.W., “A New Branch-and-cut Algorithm for the Capacitated Vehicle Routing Problem”, Mathematical Programming, vol. 100, p. 423–445, 2004.
- Magnanti T.L., Wong R.T., “Network Design and Transportation Planning: Models and Algorithms”, Transportation Science, vol. 18, num. 1, p. 1–55, 1984.
- Mester D., An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions, Report, Working Paper, Institute of Evolution, University of Haifa, Israel, 2002.
- Minoux M., “Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications”, Networks, vol. 19, p. 313–360, 1989.
- P.S. Mirchandani, R.L. Francis, EDS., Discrete Location Theory, John Wiley & Sons, New York, 1990.
- Misra S., “Linear Programming of Empty Wagon Disposition”, Rail International, vol. 3, p. 151–158, 1972.
- Mole R.H., Jameso S.R., “A Sequential Route-building Algorithm Employing a Generalized Savings Criterion”, Operational Research Quarterly, vol. 27, p. 503–511, 1976.
- Naddef D., Rinaldi G., “The Graphical Relaxation: A New Framework for the Symmetric Traveling Salesman Polytope”, Mathematical Programming, vol. 58, p. 53–88, 1993.
- Naddef D., Thienel S., “Efficient Separation Routines for the Symmetric Traveling Salesman Problem I: General Tools and Comb Separation”, Mathematical Programming, vol. 92, p. 237–255, 2002.
- Nadde D., Thienel, S., “Efficient Separation Routines for the Symmetric Traveling Salesman Problem II: Separating Multi Handle Inequalities”, Mathematical Programming, vol. 92, p. 257–285, 2002.
- Nemhauser G.L., Wolsey L.A., Integer and Combinatorial Optimization, John Wiley and Sons, New York, 1988.
10.1002/9781118627372 Google Scholar
- O'kelly M.E., “A Quadratic Integer Program for the Location of Interacting Hub Facilities”, European Journal of Operational Research, vol. 32, p. 393–404, 1987.
- O'kelly M.E., “A Clustering Approach to the Planar Hub Location Problem”, Annals of Operations Research, vol. 40, p. 339–353, 1992.
10.1007/BF02060486 Google Scholar
- O'kelly M.E., “Hub Facilities Location with Fixed Costs”, Papers in Regional Science, vol. 71, p. 292–306, 1992.
10.1007/BF01434269 Google Scholar
- O'kelly M.E., Skorin-Kapov D., Skorin-Kapov J., “Lower Bounds for the Hub Location Problem”, Management Science, vol. 41, p. 713–721, 1995.
- O'kelly M.E., Bryan D., Skorin-Kapov D., Skorin-Kapov J., “Hub Network Design with Single and Multiple Allocation: A Computational Study”, Location Science, vol. 4, num. 3, p. 125–138, 1996.
10.1016/S0966-8349(96)00015-0 Google Scholar
- Or I., Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking, PhD thesis, Northwestern University, Evanston, United States, 1976.
- Osman I.H., “Metastrategy simulated annealing and tabu search for the vehicle routing problem”, Annals of Operations Research, vol. 41, p. 421–451, 1993.
10.1007/BF02023004 Google Scholar
- Pirkul H., Jayaraman V., “Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System”, Transportation Science, vol. 30, num. 4, p. 291–302, 1996.
- Pirkul H., Jayaraman V., “A Multi-Commodity, Multi-Plant, Capacitated Facility Location Problem: Formulation and Efficient Heuristic Solution”, Computers & Operations Research, vol. 25, num. 10, p. 869–878, 1998.
- Potvin J.-Y., Rousseau J.-M., “An Exchange Heuristic for Routing Problems with Time Windows”, Journal of the Operational Research Society, vol. 46, p. 1433–1446, 1995.
- Powell W.B., Sheffi Y., “The Load-Planning Problem of Motor Carriers: Problem Description and a Proposed Solution Approach”, Transportation Research A: Policy and Practice, vol. 17, num. 6, p. 471–480, 1983.
10.1016/0191-2607(83)90167-X Google Scholar
- Powell W.B., “A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks”, Transportation Science, vol. 20, num. 4, p. 246–357, 1986.
- Powell W.B., Sheffi Y., “Interactive Optimization for Motor Carrier Load Planning”, Journal of Business Logistics, vol. 7, num. 2, p. 64–90, 1986.
- Powell W.B., “ A Comparative Review of Alternative Algorithms for the Dynamic Vehicle Allocation Problem”, B.L. Golden, A.A. Assad, Eds., Vehicle Routing: Methods and Studies, p. 249–292, North-Holland, Amsterdam, 1988.
- Powell W.B., Sheffi Y., “Design and Implementation of an Interactive Optimization System for the Network Design in the Motor Carrier Industry”, Operations Research, vol. 37, num. 1, p. 12–29, 1989.
- Powell W.B., Carvalho T.A., Godfrey G.A., Simaõ H.P., “Dynamic Fleet Management as a Logistics Queueing Network”, Annals of Operations Research, vol. 61, p. 165–188, 1995.
- Powell W.B., Jaillet P., Odoni A., “ Stochastic and Dynamic Networks and Routing”, M. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, Eds., Network Routing, vol. 8 of Handbooks in Operations Research and Management Science, p. 141–295, North-Holland, Amsterdam, 1995.
- Powell W.B., Carvalho T.A., “Dynamic Control of Multicommodity Fleet Management Problems”, European Journal of Operations Research, vol. 98, p. 522–541, 1997.
- Powell W.B., Carvalho T.A., “Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management”, Transportation Science, vol. 32, num. 2, p. 90–109, 1998.
- Powell W.B., Carvalho T.A., “Real-Time Optimization of Containers and Flatcars for Intermodal Operations”, Transportation Science, vol. 32, num. 2, p. 110–126, 1998.
- Powell W.B., Topaloglu H., “ Fleet Management”, S. Wallace, W. Ziemba, Eds., Applications of Stochastic Programming, Math Programming Society – SIAM Series on Optimization, SIAM, 2003.
- Powell W.B., “ Dynamic Models of Transportation Operations”, S. Graves, T.A.G. Tok, Eds., Supply Chain Management, vol. 11 of Handbooks in Operations Research and Management Science, p. 677–756, North-Holland, Amsterdam, 2004.
- Powell W.B., Topaloglu H., “ Stochastic Programming in Transportation and Logistics”, A. Ruszczynski, A. Shapiro, Eds., Stochastic Programming, vol. 10 of Handbooks in Operations Research and Management Science, p. 555–635, North-Holland, Amsterdam, 2004.
- Powell W.B., Bouzaïene-ayari B., Simaõ H.P., “ Dynamic Models for Freight Transportation”, C. Barnhart, G. Laporte, Eds., Transportation, Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 2005.
- Prins C., “A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem”, Computers & Operations Research, vol. 31, p. 1985–2002, 2004.
- Ralphs T.K., Kopman L., Pulleyblank W.R., Trotter L.E., “On the Capacitated Vehicle Routing Problem”, Mathematical Programming, vol. 94, p. 343–359, 2003.
- Rego C., Roucairol C., “ A Parallel Tabu Search Algorithm Using Ejection Chains for the VRP”, I. Osman, J. Kelly, Eds., Meta-Heuristics: Theory & Applications, Kluwer Academic Publishers, Norwell, p. 253–295, 1996.
- Renaud J., Boctor F.F., Gilbert L., “An Improved Petal Heuristic for the Vehicle Routing Problem”, Journal of the Operational Research Society, vol. 47, p. 1156–1167, 1996.
- Rochat Y., Semet F., “A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland”, Journal of the Operational Research Society, vol. 45, p. 1233–1246, 1994.
- Rochat Y., Taillard E.D., “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing”, Journal of Heuristics, vol. 1, num. 1, p. 147–167, 1995.
10.1007/BF02430370 Google Scholar
- Roy J., Un modèle de planification globale pour le transport routier des marchandises, Thèse de doctorat, Ecole des Hautes Etudes Commerciales, University of Montreal, Montreal, Canada, 1984.
- Roy J., Delorme L., “NETPLAN: A Network Optimization Model for Tactical Planning in the Less-than-Truckload Motor-Carrier Industry”, INFOR, vol. 27, num. 1, p. 22–35, 1989.
- Roy J., Crainic T.G., “Improving Intercity Freight Routing with a Tactical Planning Model”, Interfaces, vol. 22, num. 3, p. 31–44, 1992.
- Russell R.A., “An Effective Heuristic for the m-Tour Traveling Salesman Problem with some Side Conditions”, Operations Research, vol. 25, p. 517–524, 1977.
- Russell R.A., “Hybrid Heuristics for the Vehicle Routing Problem with Time Windows”, Transportation Science, vol. 29, p. 156–166, 1995.
- Salkin H.M., Mathur K., Foundations of Integer Programming, North-Holland, Amsterdam, 1989.
- Shaw P., “ Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems”, M. Maher, J.-F. Puget, Eds., Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, p. 417–431, Springer-Verlag, New York, 1998.
10.1007/3-540-49481-2_30 Google Scholar
- Skorin-Kapov D., Skorin-Kapov J., “On Tabu Search for the Location of Interacting Hub Facilities”, European Journal of Operational Research, vol. 73, p. 502–509, 1994.
- Skorin-Kapov D., Skorin-Kapov J., O'kelly M.E., “Tight Linear Programming relaxation of Uncapacitated p-Hub Median Problems”, European Journal of Operational Research, vol. 94, p. 582–593, 1996.
- Smith K., Krishnamoorthy M., Palaniswami M., “Neural Versus Traditional Approaches to the Location of Interacting Hub Facilities”, Location Science, vol. 4, num. 3, p. 155–171, 1996.
10.1016/S0966-8349(96)00017-4 Google Scholar
- Solomon M.M., “Time Window Constrained Routing and Scheduling Problems”, Operations Research, vol. 35, p. 254–265, 1987.
- Solomon M.M., Baker E., Schaffer J., “ Vehicle Routing and Scheduling with Time Windows: Efficient Implementations of Solution Improvement Procedures”, Vehicle Routing: Methods and Studies, p. 85–106, North-Holland, 1988.
- Taillard E.D., “Parallel Iterative Search Methods for Vehicle Routing Problems”,Networks, vol. 23, p. 661–673, 1993.
- Taillard E.D., Badeau P., Gendreau M., Guertin F., Potvin J.-Y., “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows”, Transportation Science, vol. 31, num. 2, p. 170–186, 1997.
- Tarantilis C.D., Kiranoudis C.T., “Bone Route: An Adaptive Memory-based Method for Effective Fleet Management”, Annals of Operations Research, vol. 115, p. 227–241, 2002.
- Teghem J., Pirlot M., Résolution de Problèmes de RO par les Métaheuristiques, Hermès, Paris, 2003.
- Thompson P., Psaraftis H., “Cyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems”, Operations Research, vol. 41, p. 935–946, 1993.
- P. Toth, D. Vigo, EDS., The Vehicle Routing Problem, vol. 9 of SIAM Monographs on Discrete Mathematics and Applications, SIAM, 2002.
- Toth P., Vigo D., “The Granular Tabu Search and its Application to the Vehicle Routing Problem”, INFORMS Journal on Computing, vol. 15, p. 333–348, 2003.
- VAN BREEDAM A., “Improvement Heuristics for the Vehicle Routing Problem Based on Simulated Annealing”, European Journal of Operational Research, vol. 86, p. 480–490, 1995.
- White W.W., A Program for Empty Freight Car Allocation, Report num. 360D.29.002, IBM Contributed Program Library, IBM Corporation, Program Information Department, Hawthorne, NY, 1968.
- White W.W., Bomberault A.M., “A Network Algorithm for Empty Freight Car Allocation”, IBM Systems Journal, vol. 8, num. 2, p. 147–171, 1969.
- White W.W., “Dynamic Transshipment Networks: An Algorithm and its Application to the Distribution of Empty Containers”, Networks, vol. 2, num. 3, p. 211–236, 1972.
10.1002/net.3230020304 Google Scholar
