A relax-and-price heuristic for the inventory-location-routing problem

International Transactions in Operational Research

Volumn 22, Issue 1, 2015, Pages 129-148

  Guerrero, W J ^a,b,c   Prodhon, C ^a   Velasco, N ^a,b   Amaya, C A ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b UNIVERSIDAD DE LOS ANDES   (Colombia)

^c ESCUELA COLOMBIANA DE INGENIERÍA JULIO GARAVITO   (Colombia)

Author keywords

Column generation; Inventory location routing problem; Lagrangian relaxation; Supply chain design; Vehicle routing problem

Indexed keywords

CHAINS; COST FUNCTIONS; COSTS; FLEET OPERATIONS; GRAPH THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; SUPPLY CHAINS; URBAN TRANSPORTATION;

COLUMN GENERATION; LAGRANGIAN RELAXATION; LOCATION ROUTING PROBLEM; SUPPLY CHAIN DESIGN; VEHICLE ROUTING PROBLEMS;

PROBLEM SOLVING;

EID: 84916224164     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12091     Document Type: Article

References (26)

1. Ambrosino, D., Scutellà, M.-G., 2005. Distribution network design: New problems and related models. European Journal of Operational Research 165, 3, 610-624.
2. Balcik, B., Beamon, B., Krejci, C., Muramatsu, K., Ramirez, M., 2010. Coordination in humanitarian relief chains: Practices, challenges and opportunities. International Journal of Production Economics 126, 22-34.
3. Beasley, J.E., 1993. Lagrangean relaxation. In Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, John Wiley & Sons, New York, pp. 243-303.
4. Belenguer, J.-M., Benavent, E., Prins, C., Prodhon, C., Wolfler-Calvo, R., 2011. A branch-and-cut method for the capacitated location-routing problem. Computers and Operations Research 38, 6, 931-941.
5. Daskin, M., Snyder, L., Berger, R., 2005. Facility location in supply chain design. Logistics Systems: Design and Optimization 1, 39-65.
6. Feillet, D., 2010. A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR: A Quarterly Journal of Operations Research 8, 407-424.
7. Geoffrion, A., 1974. Lagrangian relaxation for integer programming. Mathematical Programming Study 2, 82-114.
8. Guerrero, W., Prodhon, C., Velasco, N., Amaya, C., 2013a. Hybrid heuristic for the inventory location-routing problem with deterministic demand. International Journal of Production Economics 146, 1, 359-370.
9. Guerrero, W., Velasco, N., Prodhon, C., Amaya, C., 2013b. On the generalized elementary shortest path problem: a heuristic approach. Electronic Notes in Discrete Mathematics 41, 503-510.
10. Hansen, P., Mladenovic, N., 2003. Variable neighborhood search. In Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics, Kluwer, Boston, MA, pp. 145-184.
11. Javid, A.A., Azad, N., 2010. Incorporating location, routing and inventory decisions in supply chain network design. Transportation Research Part E: Logistics and Transportation Review 46, 5, 582-597.
12. Kallehauge, B., Larsen, J., Madsen, O.B.G., 2006. Lagrangian duality applied to the vehicle routing problem with time windows. Computers and Operations Research 33, 5, 1464-1487.
13. Liu, S.C., Lee, S.B., 2003. A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. The International Journal of Advanced Manufacturing Technology 22, 941-950.
14. Liu, S.C., Lin, C.C., 2005. A heuristic method for the combined location routing and inventory problem. The International Journal of Advanced Manufacturing Technology 26, 372-381.
15. Manzini, R., 2012. A top-down approach and a decision support system for the design and management of logistic networks. Transportation Research Part E: Logistics and Transportation Review 48, 6, 1185-1204.
16. Melo, M.T., Nickel, S., da Gama, F.S., 2009. Facility location and supply chain management: a review. European Journal of Operational Research 196, 2, 401-412.
17. Mete, H.O., Zabinsky, Z.B., 2010. Stochastic optimization of medical supply location and distribution in disaster management. International Journal of Production Economics 126, 1, 76-84.
18. Nishi, T., Isoya, Y., Inuiguchi, M., 2011. An integrated column generation and lagrangian relaxation for solving flowshop problems to minimize the total weighted tardiness. International Journal of Innovative Computing, Information and Control 7, 11, 6453-6471.
19. Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Wolfler Calvo, R., 2007. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41, 4, 470-483.
20. Prins, C., Prodhon, C., Wolfer-Calvo, R., 2006. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research 4, 221-238.
21. Prodhon, C., Prins, C., 2014. A survey of recent research on location-routing problems. European Journal of Operational Research. In Press. doi: http://dx.doi.org/10.1016/j.ejor.2014.01.005
22. Raidl, G., Puchinger, J., 2008. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. Hybrid Metaheuristics 114, 31-62.
23. Sajjadi, S.R., Cheraghi, S.H., 2011. Multi-products location-routing problem integrated with inventory under stochastic demand. International Journal of Industrial and Systems Engineering 7, 4, 454-476.
24. Salhi, S., Rand, G.K., 1989. The effect of ignoring routes when locating depots. European Journal of Operational Research 39, 2, 150-156.
25. Shen, Z.-J.M., Qi, L., 2007. Incorporating inventory and routing costs in strategic location models. European Journal of Operational Research 179, 2, 372-389.
26. Wagner, H.M., Whitin, T.M., 1958. Dynamic version of the economic lot size model. Management Science 5, 1, 89-96.