Abstract
Capacitated location-routing problem (CLRP), is one of the new research areas in distribution management. This topic combines two problems: locating the facilities and vehicle routing. The goal of CLRP is to open a set of depots, allocating the costumers to depots and then to design the vehicle tours in order to minimize the overall cost. The limitations of time windows has many applications in the real world, however it has not been noticed enough in the CLRP problem. This article considers the capacitated location-routing problem with hard time windows (CLRPHTW). In this paper, first a mixed-integer linear programming model for CLRPHTW problem is presented and then in order to solve this problem a meta-heuristic method based on variable neighborhood search algorithm is proposed. To assess the performance of the proposed method, this framework is examined with a set of examples. The computational tests demonstrate the efficiency of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177(2):649–672
Prins C, Prodhon C, Calvo RW (2006) Solving the capacitated location- routing problem by a GRASP complemented by a learning process and a path relinking. A Q J Oper Res 4(3):221–238
Prins C, Prodhon C, Calvo RW (2006) A memetic algorithm with population management (MA\({\vert }\)PM) for the capacitated location-routing problem. Lecture notes in computer science, vol 3906. Springer, Berlin, pp 183–194
Barreto S, Ferreira C, Paixa J, Santos BS (2007) Using clustering analysis in capacitated location-routing problem. Eur J Oper Res 179:968–977
Prins C, Prodhon C, Ruiz A, Soriano P, Calvo RW (2007) Solving the capacitated locationrouting problem by a cooperative Lagrangean relaxation granular tabu search heuristic. Transp Sci 41:470–483
Marinakis Y, Marinaki M (2008) A particle swarm optimization algorithm with path relinking for the location routing problem. J Math Model Algorithms 7:59–78
Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP\(\times \)ELS approach for the capacitated location-routing problem. Comput Oper Res 37:1912–1923
Yu VF, Lin S-W, Lee W, Ting C-J (2010) A simulated annealing heuristic for the capacitated location-routing problem. Comput Ind Eng 58:288–299
Nguyen V-P, Prins C, Prodhon C (2012) Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur J Oper Res 216:113–126
Nguyen V-P, Prins C, Prodhon C (2012) A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng Appl Artif Intell 25:56–71
Jabal-Ameli MS, Ghaffari-Nasab N (2010) Location-routing problem with time windows: novel mathematical programming formulations. In: 7th International industrial engineering conference. Isfahan, Iran
Mladenovi’c N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100
Kirkpatrick S, Gelatti CD, Vecchi MP (1983) Optimization by simulated annealing. In: Science is currently published by American association for the advancement of science, vol 220, no. 4598, pp 671–680
Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Hosseinabadi, A.A.R., Alavipour, F., Shamshirbnd, S., Balas, V.E. (2017). A Novel Meta-Heuristic Combinatory Method for Solving Capacitated Vehicle Location-Routing Problem with Hard Time Windows. In: Balas, V., Jain, L., Zhao, X. (eds) Information Technology and Intelligent Transportation Systems. Advances in Intelligent Systems and Computing, vol 454. Springer, Cham. https://doi.org/10.1007/978-3-319-38789-5_77
Download citation
DOI: https://doi.org/10.1007/978-3-319-38789-5_77
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-38787-1
Online ISBN: 978-3-319-38789-5
eBook Packages: EngineeringEngineering (R0)