Les diapositives de cours disponibles sur le site web Moodle du cours.

• Bartholdi, J. III et S. Hackman, Warehouse and Distribution Science, Release 0.95, The Supply Chain and Logistics Institute, Georgia Institute of Technology, 2011.
• Boctor F. F. et Renaud J., The column-circular, subsets-selection problem : Complexity and solutions. Computers and Operations Research, 27, 4, 383-398, 2000.
• Bodin, L., B. Golden, A. Assad et M. Ball, Routing and Scheduling of Vehicles and Crews - The State of the Art, Computers and Operations Research, 10, 1983, 64-211.
• Daskin Mark, Network and discrete location: models, algorithms, and applications. John Wiley & Sons, 2011.
• Fahimnia, B., A. Jabbarzadeh et J. Sarkis, Greening versus resilience: A supply chain design perspective, Transportation Research Part E: Logistics and Transportation Review, 119, 2018, 129-148.
• Gendreau Michel, Hertz Alain et Laporte Gilbert, An approximation algorithm for the traveling salesman problem with backhauls. Document de travail CRT-95-01, Centre de Recherche sur les Transports.
• Helsgaum Keld, An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126, 2000, 106-130.
• Jabbarzadeh, A., N. Azad et M. Verma, An optimization approach to planning rail hazmat shipments in the presence of random disruptions, OMEGA - The International Journal of Management Science, 2019.
• Jabbarzadeh, A., B. Fahimnia et  S. Seuring, Dynamic supply chain network design for the supply of blood in disasters: a robust model with real world application, Transportation Research Part E: Logistics and Transportation Review, 70, 2014, 225-244.
• Jabbarzadeh, A., B. Fahimnia, J. Sheu, et  H.S. Moghadam, Designing a supply chain resilient to major disruptions and supply/demand interruptions, Transportation Research Part B: Methodological, 94, 2016, 121-149.
• Lawler, E., J. Lenstra, A. Rinnooy Kan et D. Shmoys (eds), The Traveling Salesman Problem, Wiley, 1985.
• Laporte, G., The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms, European Journal of Operational Research, 59, 1992a, 231-247.
• Laporte, G., The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms, European Journal of Operational Research, 59, 1992b, 345-358.
• Lin Shen, Computer solutions of the traveling salesman problem. The Bell System Technical Journal, 1965, 2245-2269.
• Lin S. et Kernighan B. W., An effective heuristic algorithm for the traveling salesman problem, Operations Research, 20, 1973, 498-516.
• Nobert, Y., R. Ouellet et R. Parent(2005). Méthodes de planification en transports, Les Presses de l’Université de Montréal, ISBN : 2-7606-1975-3.
• Renaud J. et Boctor F. F., A sweep based algorithm for the fleet size and mix vehicle routing problem. À paraître dans European Journal of Operational Research.
• Renaud J., Boctor F. F. et Laporte G., Perturbation heuristics for the pickup and delivery traveling salesman problem. À paraître dans Computers and Operations Research.
• Renaud J., Boctor F. F. et Ouenniche J., A routing heuristic for the pickup and delivery traveling salesman problem. Computers and Operations Research, 27, 9, 905-916, 2000.
• Renaud J., et Boctor F. F., An efficient composite heuristic for the symmetric generalized traveling salesman problem. European Journal of Operational Research, 108, 3, 571-584, 1998.
• Renaud J., Boctor F. F. et Laporte G., An improved petal heuristic for the vehicle routeing problem. Journal of the Operational Research Society, 47, 329-336, 1996.
• Renaud J., Laporte G. et Boctor F. F., A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research, 23, 3, 229-235, 1996.
• Renaud J., Boctor F. F. et Laporte G., A fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing, 8, 2, 134-143, 1996.
• Rosenkrantz Daniel J., Stearns Richard E. et Lewis II Philip M., An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6, 3, 1977, 563-581
• Silver. E. et R. Peterson, Decision Systems for Inventory Management and Production Planning, 2nd ed., Wiley, 1987.
• Silver E., Pyke D. et Peterson R., Inventory management and production planning and scheduling. Wiley, 1998.
• Solomon M. M., Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research, 35, 2, 1987, 254-265.
• Syslo, M. M., Deo N. et Kowalik J. S., Discrete optimization algorithms with pascal programs. PrenticeHall, 1983.
• Toth Paolo et Vigo Danielle, An exact algorithm for the vehicle routing problem with backhaul, Transportation Science, vol 31, no 4, 1997, 372-385.
• Taqa Allah D., Renaud J. et Boctor F. F., Le problème d’approvisionnement des stations d’essence - The gas stations supply problem. Journal Européen des Systèmes Automatisés, 34, 1, 11-33, 2000.
• Toth Paolo et Vigo Danielle, A heuristic algorithm for the symmetric and asymetric vehicle routing problems with backhaul, European Journal of Operational Research, 113, 1999, 528-543.
• Tompkins, J.A., J.A. White, Y.A. Bozer et J.M.A. Tanchoco, Facilities Planning, 3e éd., 2003, 760 p., ISBN: 978-0-471-41389-9.
• Wood, D.F. et J.C. Johnson (1996). Contemporary Transportation, 5e éd., Prentice Hall.

http://ena.etsmtl.ca