Skip to main content
SpringerLink
Log in

Variable Neighborhood Search with Path-Relinking for the Capacitated Location Routing Problem

  • Conference paper
  • First Online:
Proceedings of the Institute of Industrial Engineers Asian Conference 2013

  • 1162 Accesses

Abstract

The Location Routing Problem (LRP) integrates strategic decisions (facility location) and tactical decisions (vehicle routing) aimed at minimizing the total cost associated with location opening cost and routing cost. It belongs to the class of NP-hard problems. In this study, we present a variable neighborhood search with path-relinking (VNSPR) for solving the CLRP. The path-relinking procedure is integrated into the variable neighborhood search (VNS) framework. We tested our heuristic approach on three well-know CLRP data sets and the results were compared with those reported in the literature. Computational results indicate that the proposed VNSPR heuristic is competitive with existing approaches for the CLRP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  • Barreto SS (2004) Análise e Modelização de Problemas de localização-distribuição [Analysis and modelling of location-routing problems]. University of Aveiro, Portugal

    Google Scholar 

  • Barreto S, Ferreira C, Paixão J, Santos BS (2007) Using clustering analysis in a capacitated location-routing problem. Eur J Oper Res 179(3):968–977

    Article  MATH  Google Scholar 

  • Braysy O (2003) A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J Comput 15(4):347–368

    Article  MathSciNet  Google Scholar 

  • Escobar JW, Linfati R, Toth P (2013) A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput Oper Res 40(1):70–79

    Google Scholar 

  • Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur J Oper Res 6(2):224–226

    Article  MATH  Google Scholar 

  • Lenstra JK, Kan AHGR (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227

    Article  Google Scholar 

  • Prins C, Prodhon C, Calvo R (2006) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4(3):221–238

    Google Scholar 

  • Taillard É, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A Tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170–186

    Google Scholar 

  • Ting C-J, Chen C-H (2013) A multiple ant colony optimization algorithm for the capacitated location routing problem. Int J Prod Econ 141(1):34–44

    Article  Google Scholar 

  • Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur J Oper Res 116(1):87–99

    Article  MATH  Google Scholar 

  • 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(2):288–299

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan

    Meilinda F. N. Maghfiroh, A. A. N. Perwira Redi & Vincent F. Yu

Authors
  1. Meilinda F. N. Maghfiroh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. N. Perwira Redi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent F. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meilinda F. N. Maghfiroh .

Editor information

Editors and Affiliations

  1. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Yi-Kuei Lin

  2. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Yu-Chung Tsao

  3. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Shi-Woei Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Singapore

About this paper

Cite this paper

Maghfiroh, M.F.N., Perwira Redi, A.A.N., Yu, V.F. (2013). Variable Neighborhood Search with Path-Relinking for the Capacitated Location Routing Problem. In: Lin, YK., Tsao, YC., Lin, SW. (eds) Proceedings of the Institute of Industrial Engineers Asian Conference 2013. Springer, Singapore. https://doi.org/10.1007/978-981-4451-98-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-981-4451-98-7_34

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4451-97-0

  • Online ISBN: 978-981-4451-98-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation