Planning a selective delivery schedule through Adaptive Large Neighborhood Search

Pamela Jocelyn Palomo Martinez, M. Angélica Salazar-Aguilar, Gilbert Laporte

Resultado de la investigaciónrevisión exhaustiva

5 Citas (Scopus)

Resumen

We model and solve a real-life distribution problem faced by a fresh fruit supplier. This problem is formulated as a Multi-Product Split Delivery Capacitated Team Orienteering Problem with Incomplete Service and Soft Time Windows. The problem is modeled through a mixed integer linear programming formulation and solved by an Adaptive Large Neighborhood Search (ALNS) metaheuristic. Computational results over a large set of artificial instances show that the combination of ALNS with a multi-start scheme produces better results than a classical implementation of the ALNS in which a single solution is built and improved.
Idioma originalEnglish
Páginas (desde-hasta)368-378
Número de páginas11
PublicaciónComputers and Industrial Engineering
Volumen112
DOI
EstadoPublished - oct 2017
Publicado de forma externa

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Huella Profundice en los temas de investigación de 'Planning a selective delivery schedule through Adaptive Large Neighborhood Search'. En conjunto forman una huella única.

Citar esto