Planning a selective delivery schedule through Adaptive Large Neighborhood Search

Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)368-378
Number of pages11
JournalComputers and Industrial Engineering
Volume112
DOIs
Publication statusPublished - Oct 2017

Keywords

  • Adaptive Large Neighborhood Search
  • Soft time windows
  • Split deliveries
  • Team orienteering problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Planning a selective delivery schedule through Adaptive Large Neighborhood Search'. Together they form a unique fingerprint.

Cite this