Hybrid metaheuristic solutions to inventory location routing problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 70, Issue 1, 2014, Pages 305-323

  Zhang, Ying ^a   Qi, Mingyao ^a   Miao, Lixin ^a   Liu, Erchao ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Inventory location routing; Inventory routing problem; Location routing problem; Metaheuristic; Simulated annealing; Supply chain

Indexed keywords

FLEET OPERATIONS; INTEGER PROGRAMMING; LOCATION; SUPPLY CHAINS;

HYBRID METAHEURISTICS; INVENTORY LOCATION; INVENTORY LOCATION ROUTING; INVENTORY ROUTING PROBLEMS; LOCATION ROUTING PROBLEM; LOCATION-ROUTING; METAHEURISTIC; MULTIPLE DEPOT; PLANNING HORIZONS; SUPPLY CHAIN NETWORK;

SIMULATED ANNEALING;

MATHEMATICAL ANALYSIS; OPTIMIZATION; SIMULATED ANNEALING; TRANSPORT VEHICLE; COST ANALYSIS; HEURISTICS; INVENTORY;

EID: 84907094287     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2014.07.010     Document Type: Article

References (32)

1. Ambrosino D., Grazia Scutellà M. Distribution network design: new problems and related models. Eur. J. Oper. Res. 2005, 165(3):610-624.
2. Anily S., Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Manage. Sci. 1990, 36(1):92-114.
3. Andersson H., Hoff A., Christiansen M., Hasle G., Lokketangen A. Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 2010, 37(9):1515-1536.
4. Barreto S., Ferreira C., Paixao J., Santos B.S. Using clustering analysis location-routing in a capacitated problem. Eur. J. Oper. Res. 2007, 179(3):968-977.
5. Bertazzi L., Paletta G., Speranza M.G. Deterministic order-up-to level policies in an inventory routing problem. Transp. Sci. 2002, 36(1):119-132.
6. Cha B.C., Moon I.K., Park J.H. The joint replenishment and delivery scheduling of the one-warehouse, n-retailer system. Transp. Res. Part E Logist. Transp. Rev. 2008, 44(5):720-730.
7. Daskin M.S. Network and Discrete Location: Models, Algorithms and Applications 1995, Wiley-Interscience Publication, New York.
8. Guerrero W.J., Prodhon C., Velasco N., Amaya C.A. Hybrid heuristic for the inventory location-routing problem with deterministic demand. Int. J. Prod. Econ. 2013, 146(1):359-370.
9. Huang S., Lin P. A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty. Transp. Res. Part E Logist. Transp. Rev. 2010, 46(5):598-611.
10. Jabal-Ameli M.S., Aryanezhad M.B., Ghaffari-Nasab N. A variable neighborhood descent based heuristic to solve the capacitated location-routing problem. Int. J. Ind. Eng. Comput. 2011, 2(1):141-154.
11. Javid A.A., Azad N. Incorporating location, routing and inventory decisions in supply chain network design. Transp. Res. Part E Logist. Transp. Rev. 2010, 46(5):582-597.
12. Liu S.C., Lee S.B. A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. Int. J. Adv. Manuf. Technol. 2003, 22(11-12):941-950.
13. Liu S.C., Lin C.C. A heuristic method for the combined location routing and inventory problem. Int. J. Adv. Manuf. Technol. 2005, 26(4):372-381.
14. Ma H., Davidrajuh R. An iterative approach for distribution chain design in agile virtual environment. Ind. Manage. Data Syst. 2005, 105(6):815-834.
15. Max Shen Z.-J., Qi L. Incorporating inventory and routing costs in strategic location models. Eur. J. Oper. Res. 2007, 179(2):372-389.
16. Mete H.O., Zabinsky Z.B. Stochastic optimization of medical supply location and distribution in disaster management. Int. J. Prod. Econ. 2010, 126(1):76-84.
17. Miranda P.A., Garrido R.A. Valid inequalities for Lagrangian relaxation in an inventory location problem with stochastic capacity. Transp. Res. Part E Logist. Transp. Rev. 2008, 44(1):47-65.
18. Moin N.H., Salhi S. Inventory routing problems: a logistical overview. J. Oper. Res. Soc. 2006, 58(9):1185-1194.
19. Nozick L.K., Turnquist M.A. Integrating inventory impacts into a fixed-charge model for locating distribution centers. Transp. Res. Part E Logist. Transp. Rev. 1998, 34(3):173-186.
20. Prins C., Prodhon C., Calvo R.W. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 2006, 4(3):221-238.
21. Prodhon C., Prins C. A survey of recent research on location-routing problems. Eur. J. Oper. Res. 2014, 238(1):1-17.
22. Qi M., Zhang Y., Zhang J., Miao L. A new two-phase hybrid metaheuristic for vehicle routing problem with time windows. J. East Asia Soc. Transp. Stud. 2013, 10:880-896.
23. Qin L., Miao L., Ruan Q., Zhang Y. A local search method for periodic inventory routing problem. Expert Syst. Appl. 2014, 41(2):765-778.
24. Rego C. A subpath ejection method for the vehicle routing problem. Manage. Sci. 1998, 44(10):1447-1459.
25. Rennemo S.J., Rø K.F., Hvattum L.M., Tirado G. A three-stage stochastic facility routing model for disaster response planning. Transp. Res. Part E Logist. Transp. Rev. 2014, 62(0):116-135.
26. Reza Sajjadi S., Hossein Cheraghi S. Multi-products location-routing problem integrated with inventory under stochastic demand. Int. J. Ind. Syst. Eng. 2011, 7(4):454-476.
27. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 1987, 35(2):254-265.
28. Ting C., Chen C. A multiple ant colony optimization algorithm for the capacitated location routing problem. Int. J. Prod. Econ. 2013, 141(1):34-44.
29. Toth P., Vigo D. The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 2003, 15(4):333-346.
30. Viswanathan S., Mathur K. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems. Manage. Sci. 1997, 43(3):294-312.
31. Yu V.F., Lin S.W., Lee W.Y., Ting C.J. A simulated annealing heuristic for the capacitated location routing problem. Comput. Ind. Eng. 2010, 58(2):288-299.
32. Zachariadis E.E., Tarantilis C.D., Kiranoudis C.T. An integrated local search method for inventory and routing decisions. Expert Syst. Appl. 2009, 36(7):10239-10248.