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 language | English |
|---|---|
| Pages (from-to) | 368-378 |
| Number of pages | 11 |
| Journal | Computers and Industrial Engineering |
| Volume | 112 |
| DOIs | |
| Publication status | Published - Oct 2017 |
Funding
This work was supported by CONACYT and the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189. This support is gratefully acknowledged. Thanks are due to the referee who provided valuable comments on an earlier version of this paper.
Keywords
- Adaptive Large Neighborhood Search
- Soft time windows
- Split deliveries
- Team orienteering problem
ASJC Scopus subject areas
- General Computer Science
- General Engineering
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
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS