Skip to main content
SpringerLink
Log in
Book cover

Information Technology and Intelligent Transportation Systems pp 707–728Cite as

A Novel Meta-Heuristic Combinatory Method for Solving Capacitated Vehicle Location-Routing Problem with Hard Time Windows

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 454))

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177(2):649–672

    Article  MathSciNet  MATH  Google Scholar 

  2. 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

    Article  MathSciNet  MATH  Google Scholar 

  3. 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

    Google Scholar 

  4. Barreto S, Ferreira C, Paixa J, Santos BS (2007) Using clustering analysis in capacitated location-routing problem. Eur J Oper Res 179:968–977

    Article  MATH  Google Scholar 

  5. 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

    Article  Google Scholar 

  6. 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

    Article  MathSciNet  MATH  Google Scholar 

  7. 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

    Article  MATH  Google Scholar 

  8. 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

    Article  Google Scholar 

  9. 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

    Article  MathSciNet  MATH  Google Scholar 

  10. 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

    Article  Google Scholar 

  11. 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

    Google Scholar 

  12. Mladenovi’c N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  13. 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

    Google Scholar 

  14. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    Article  MathSciNet  MATH  Google Scholar 

  15. http://web.cba.neu.edu/~msolomon

  16. http://prodhonc.free.fr/homepage

Download references

Author information

Authors and Affiliations

  1. Department of Computer, Technical and Vocational University, Behshahr Branch, Behshahr, Iran

    Ali Asghar Rahmani Hosseinabadi

  2. Department of Electrical, Computer and Biomedical Engineering, Qazvin Islamic Azad University, Qazvin Branch, Qazvin, Iran

    Fataneh Alavipour

  3. Faculty of Computer Science and Information Technology, Department of Computer System and Technology, University of Malaya, 50603, Kuala Lumpur, Malaysia

    Shahaboddin Shamshirbnd

  4. Department of Automation and Applied Informatics, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina E. Balas

Authors
  1. Ali Asghar Rahmani Hosseinabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fataneh Alavipour
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shahaboddin Shamshirbnd
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Valentina E. Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shahaboddin Shamshirbnd .

Editor information

Editors and Affiliations

  1. Department of Automation and Applied Informatics, Aurel Vlaicu University of Arad Faculty of Engineering, Arad, Romania

    Valentina Emilia Balas

  2. Bournemouth University, Poole, United Kingdom

    Lakhmi C. Jain

  3. School of Information Engineering, Chang'an University, Xi'an, China

    Xiangmo Zhao

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation