Optimization-based adaptive large neighborhood search for the production routing problem

Transportation Science

Volumn 48, Issue 1, 2014, Pages 20-45

  Adulyasak, Yossiri ^a   Cordeau, Jean François ^a   Jans, Raf ^b  

^a HEC MONTRÉAL   (Canada)

^b GERAD   (Canada)

Author keywords

Adaptive large neighborhood search; Integrated supply chain planning; Network flow; Production routing

Indexed keywords

BENCHMARKING; CUSTOMER SATISFACTION; HEURISTIC ALGORITHMS; NETWORK ROUTING; SUPPLY CHAINS;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; COMPUTATIONAL EXPERIMENT; CONTINUOUS VARIABLES; ENUMERATION SCHEMES; HIGH-QUALITY SOLUTIONS; INTEGRATED SUPPLY CHAIN; NETWORK FLOWS; OPERATIONAL PROBLEMS;

OPTIMIZATION;

EID: 84894570180     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0443     Document Type: Article

References (33)

1. Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37:1515-1536.
2. Archetti C, Bertazzi L, Paletta G, Speranza MG (2011) Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38:1731-1746.
3. Armentano VA, Shiguemoto AL, Løkketangen A (2011) Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38:1199-1209.
4. Azi N, Gendreau M, Potvin J-Y (2010) An adaptive large neighborhood search for a vehicle routing problem with multiple trips. CIRRELT technical report 2010-08, University of Montréal, Canada.
5. Bard JF, Nananukul N (2009) The integrated production- inventorydistribution-routing problem. J. Scheduling 12:257-280.
6. Bard JF, Nananukul N (2010) A branch-and-price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 37:2202-2217.
7. Boudia M, Prins C (2009) A memetic algorithm with dynamic population management for an integrated production-distribution problem. Eur. J. Oper. Res. 195:703-715.
8. Boudia M, Louly MAO, Prins C (2005) Combined optimization of production and distribution. CD-ROM Proc. Internat. Conf. Indust. Engrg. Systems Management (IESM'05), Marrakech, Morocco.
9. Boudia M, Louly MAO, Prins C (2007) A reactive GRASP and path relinking for a combined production-distribution problem. Comput. Oper. Res. 34:3402-3419. (Pubitemid 46517864)
10. Brown G, Keegan J, Vigus B, Wood K (2001) The Kellogg company optimizes production, inventory, and distribution. Interfaces 31(6):1-15. (Pubitemid 33730065)
11. Çetinkaya S, Üster H, Easwaran G, Keskin BB (2009) An integrated outbound logistics model for Frito-Lay: Coordinating aggregate-level production and distribution decisions. Interfaces 39(5):460-475.
12. Chandra P (1993) A dynamic distribution model with warehouse and customer replenishment requirements. J. Oper. Res. Soc. 44:681-692. (Pubitemid 23689192)
13. Chandra P, Fisher ML (1994) Coordination of production and distribution planning. Eur. J. Oper. Res. 72:503-517.
14. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12:568-581.
15. Coelho LC, Cordeau J-F, Laporte G (2012) The inventory-routing problem with transshipment. Comput. Oper. Res. 39:2537-2548.
16. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Management Sci. 6:80-91.
17. Federgruen A, Tzur M (1999) Time-partitioning heuristics: Application to one warehouse, multi-item, multi-retailer lot-sizing problems. Naval Res. Logist. 46:463-486. (Pubitemid 129584916)
18. Fischetti M, Lodi A (2003) Local branching. Math. Programming 98:23-47.
19. Fumero F, Vercellis C (1999) Synchronized development of production, inventory, and distribution schedules. Transportation Sci. 33:330-340. (Pubitemid 30507677)
20. Gendreau M, Hertz A, Laporte G (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40:1086-1094.
21. Glover F (1996) Tabu search and adaptive memory programming-Advances, applications, and challenges. Barr RS, Helgason RV, Kennington JL, eds. Interfaces in Computer Science and Operations Research (Kluwer Academic Publishers, Boston), 1-75.
22. Jin Y, Muriel A (2009) Single-warehouse multi-retailer inventory systems with full truckload shipments. Naval Res. Logist. 56:450-464.
23. Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Sci. 44:125-135.
24. Lei L, Liu S, Ruszczynski A, Park S (2006) On the integrated production, inventory, and distribution routing problem. IIE Trans. 38:955-970. (Pubitemid 44355860)
25. Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44:2245-2269.
26. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. Assoc. Comput. Machinery 7:326-329.
27. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34:2403-2435. (Pubitemid 46073431)
28. Prins C (2012) Problem instances data provided via personal communication with the authors, January 17.
29. Ribeiro GM, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39:728-735.
30. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40:455-472. (Pubitemid 44746135)
31. Ruokokoski M, Solyali{dotless} O, Cordeau J-F, Jans R, Süral H (2010) Efficient formulations and a branch-and-cut algorithm for a production-routing problem. GERAD technical report G-2010-66, HEC Montréal, Canada.
32. Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. technical report, Department of Computer Science, University of Strathclyde, Scotland.
33. Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5:89-96. Canada Canada