Skip to main content
SpringerLink
Log in

Local Search Based Metaheuristics for Two-Echelon Distribution Network with Perishable Products

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 577))

Included in the following conference series:

  • 484 Accesses

Abstract

This article presents a planning problem in a distribution network incorporating two levels inventory management of perishable products, lot-sizing, multi-sourcing and transport capacity with a homogeneous fleet of vehicles. A mixed integer linear programming (MILP) and a greedy heuristic are developed to solve this real planning problem. There are some instances for which the solver cannot give a good lower bound within the limited time and for other instances it takes a lot of time to solve MILP. The greedy heuristic is an alternative to the mixed integer linear program to quickly solve some large instances taking into account original and difficult constraints. For some instances the gap between the solutions of the solver (MILP) and the heuristic becomes quite significant. The variable neighborhood descent (VND), the iterated local search (ILS) and the multi-start iterated local search (MS-ILS) are implemented. These methods are included in an APS (Advanced Planning System) and compared with a MILP solver. The instances are derived from actual data or built using a random generator of instances to have wider diversity for computational evaluation. The VND significantly improves the quality of solutions.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Cuervo, D.P., Goos, P., Sörensen, K., Arràiz, E.: An iterated local search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 237, 454–464 (2014)

    Article  MATH  Google Scholar 

  2. Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H.: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38, 617–640 (2011)

    Article  MATH  Google Scholar 

  3. Feo, T.A., Bard, J.: Flight scheduling and maintenance base planning. Manage. Sci. 35(12), 1415–1432 (1989)

    Article  MathSciNet  Google Scholar 

  4. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MATH  Google Scholar 

  6. Kande, S., Prins, C., Belgacem, L.: Modèle linéaire mixte et heuristiques pour un réseau de distribution à deux èchelons pour des produits pèrissables. Inf. Syst. Oper. Res. (INFOR) 52(2), 73–94 (2014)

    Article  Google Scholar 

  7. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, pp. 321–353. Kluwer Academic Publishers, Norwell, MA (2002)

    Google Scholar 

  8. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, vol. 146, pp. 363–397. Springer, New York (2010)

    Chapter  Google Scholar 

  9. Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., Vitry, G.: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput. Oper. Res. 41, 196–207 (2014)

    Article  MathSciNet  Google Scholar 

  10. Nguyen, V.P., Prins, C., Prodhon, C.: 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 (2012)

    Article  Google Scholar 

  11. Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA assignment. INFORMS J. Comput. 12(3), 164–176 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Prins C., Wolfler Calvo R.: A fast GRASP with path relinking for the capacitated arc routing problem. In: Gouveia, L., Mouro, C. (eds.) INOC 2005: 3rd International Network Optimization Conference, Lisbonne, Portugal, 20–23 March 2005, pp. 289–295. Université de Lisbonne (2005)

    Google Scholar 

  13. Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng. Appl. Artif. Intell. 23, 780–794 (2010)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by FuturMaster, a french software publisher. The reviewers of the paper are greatly acknowledged for their helpful This comments.

Author information

Authors and Affiliations

  1. ICD-LOSI, University of Technology of Troyes, 12 rue Marie Curie, CS 42060, 10004, Troyes Cedex, France

    Sona Kande & Christian Prins

  2. FuturMaster, 1 cours de l’ile seguin, 92100, Boulogne-Billancourt, France

    Sona Kande, Lucile Belgacem & Benjamin Redon

Authors
  1. Sona Kande
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Prins
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lucile Belgacem
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Benjamin Redon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sona Kande .

Editor information

Editors and Affiliations

  1. EPFL SB-DO, Lausanne, Switzerland

    Dominique de Werra

  2. MAS of INFORMS, Madison, Alabama, USA

    Greg H. Parlier

  3. Complutense University, Madrid, Spain

    Begoña Vitoriano

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kande, S., Prins, C., Belgacem, L., Redon, B. (2015). Local Search Based Metaheuristics for Two-Echelon Distribution Network with Perishable Products. In: de Werra, D., Parlier, G., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2015. Communications in Computer and Information Science, vol 577. Springer, Cham. https://doi.org/10.1007/978-3-319-27680-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27680-9_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27679-3

  • Online ISBN: 978-3-319-27680-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation