Skip to main content

Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2018)

Abstract

This work presents a new variant of the Location Inventory Routing Problem (LIRP), called Pollution LIRP (PLIRP). The PLIRP considers both economic and environmental impacts. A Mixed Integer Programming (MIP) formulation is employed and experimental results on ten randomly generated small-sized instances using CPLEX are reported. Furthermore, it is shown that, CPLEX could not compute any feasible solution on another set of ten randomly generated medium-sized instances, with a time limit of five hours. Therefore, for solving more computationally challenging instances, two Basic Variable Neighborhood Search (BVNS) metaheuristic approaches are proposed. A comparative analysis between CPLEX and BVNS on these 20 problem instances is reported.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Antoniadis, N., Sifaleras, A.: A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems. Electron. Notes Discret Math. 58, 47–54 (2017)

    Article  MathSciNet  Google Scholar 

  2. Cheng, C., Yang, P., Qi, M., Rousseau, L.M.: Modeling a green inventory routing problem with a heterogeneous fleet. Transp. Res. Part E 97, 97–112 (2017)

    Article  Google Scholar 

  3. Coelho, V.N., Santos, H.G., Coelho, I.M., Penna, P.H.V., Oliveira, T.A., Souza, M.J.F., Sifaleras, A.: 5th International Conference on Variable Neighborhood Search (ICVNS 2017). Electron. Notes Discrete Math. 66, 1–5 (2018)

    Google Scholar 

  4. Cunha, J.O., Konstantaras, I., Melo, R.A., Sifaleras, A.: On multi-item economic lot-sizing with remanufacturing and uncapacitated production. Appl. Math. Model. 43, 678–686 (2017)

    MathSciNet  Google Scholar 

  5. Demir, E., Bektas, T., Laporte, G.: A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237, 775–793 (2014)

    Article  Google Scholar 

  6. Ehmke, J., Cambell, A., Thomas, B.: Data-driven approaches for emissions-minimized paths in urban areas. Comput. Oper. Res. 67, 34–47 (2016)

    Article  MathSciNet  Google Scholar 

  7. Hansen, P., Mladenovic, N., Todosijevic, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423–454 (2017)

    Article  MathSciNet  Google Scholar 

  8. Javid, A., Azad, N.: Incorporating location, routing and inventory decisions in supply chain network design. Transp. Res. Part E 46, 582–597 (2010)

    Article  Google Scholar 

  9. Koç, Ç., Bektaş, T., Jabali, O., Laporte, G.: The fleet size and mix pollution-routing problem. Transp. Res. Part B 70, 239–254 (2014)

    Article  Google Scholar 

  10. Koç, Ç., Bektaş, T., Jabali, O., Laporte, G.: The impact of depot location, fleet composition and routing on emissions in city logistics. Transp. Res. Part B 84, 81–102 (2016)

    Article  Google Scholar 

  11. Leenders, B., Velazquez-Martinez, J., Fransoo, J.: Emissions allocation in transportation routes. Transp. Res. Part D 57, 39–51 (2017)

    Article  Google Scholar 

  12. Zhalechian, M., Tavakkoli-Moghaddam, R., Zahiri, B., Mohammadi, M.: Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty. Transp. Res. Part E 89, 182–214 (2016)

    Article  Google Scholar 

  13. Zhang, Y., Qi, M., Miao, L., Liu, E.: Hybrid metaheuristics solutions to inventory location routing problem. Transp. Res. Part E 70, 305–323 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael C. Georgiadis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Karakostas, P., Sifaleras, A., Georgiadis, M.C. (2019). Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds) Variable Neighborhood Search. ICVNS 2018. Lecture Notes in Computer Science(), vol 11328. Springer, Cham. https://doi.org/10.1007/978-3-030-15843-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15843-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15842-2

  • Online ISBN: 978-3-030-15843-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics