Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products

S. Kande, C. Prins, L. Belgacem, B. Redon

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 were 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. A multi-start iterated local search (MS-ILS), using the variable neighborhood descent (VND) and a greedy randomized heuristic, has been implemented. It has been included in an APS (Advanced Planning System) and compared with an exact resolution of the MILP. The instances are derived from actual data or built using a random generator of instances to have wider diversity for computational evaluation. The MS-ILS significantly improves the quality of solutions.

References

  1. Cuervo, D., Goos, P., Sörensen, K., and Arràiz, E. (2014). An iterated local search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 237:454-464.
  2. Duhamel, C., Lacomme, P., Quilliot, A., and H.Toussaint (2011). A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research, 38:617- 640.
  3. Feo, T. and Bard, J. (1989). Flight scheduling and maintenance base planning. Management Science, 35(12):1415-1432.
  4. Feo, T. and Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109-133.
  5. Hansen, P. and Mladenovic, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3):449-467.
  6. Lourenc¸o, H., Martin, O., and Stützle, T. (2003). In: Handbook of Metaheuristics, chapter Iterated local search, pages 321-353. Kluwer and Dordrecht.
  7. Lourenc¸o, H., Martin, O., and Stützle, T. (2010). In: Handbook of Metaheuristics, volume 146, chapter Iterated local search: Framework and applications, pages 363- 397. Springer, New York.
  8. Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., and Vitry, G. (2014). Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Computers & Operations Research, (41):196-207.
  9. Nguyen, V., Prins, C., and Prodhon, C. (2012). A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Engineering Applications of Artificial Intelligence, 25:56- 71.
  10. Prais, M. and Ribeiro, C. (2000). Reactive grasp: an application to a matrix decomposition problem in tdma assignment. INFORMS Journal on Computing, 12(3):164-176.
  11. Prins, C. and Calvo, R. W. (2005). A fast grasp with path relinking for the capacitated arc routing problem. In et C. Mouro, L. G., editor, INOC 2005: 3rd International Network Optimization Conference, Lisbonne, Portugal, 20-23/03/2005, pages 289-295. Université de Lisbonne.
  12. Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., and Velasco, N. (2010). Grasp/vnd and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engineering Applications of Artificial Intelligence, 23:780-794.
Download


Paper Citation


in Harvard Style

Kande S., Prins C., Belgacem L. and Redon B. (2015). Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 294-303. DOI: 10.5220/0005224902940303


in Bibtex Style

@conference{icores15,
author={S. Kande and C. Prins and L. Belgacem and B. Redon},
title={Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={294-303},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005224902940303},
isbn={978-989-758-075-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Multi-start Iterated Local Search for Two-echelon Distribution Network for Perishable Products
SN - 978-989-758-075-8
AU - Kande S.
AU - Prins C.
AU - Belgacem L.
AU - Redon B.
PY - 2015
SP - 294
EP - 303
DO - 10.5220/0005224902940303