Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 53, Issue 20, Pages 6040-6058Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2015.1010744
Keywords
adaptive large neighbourhood search; lot sizing; vehicle routing problem with time-windows; perishable goods
Categories
Funding
- FAPESP [2010/06901-1]
- CNPq from Brazil [590003/2009-7]
- ERDF - European Regional Development Fund through the COMPETE Programme (operational programme for competitiveness)
- National Funds through the FCT - Fundacao para a Ciencia e a Tecnologia (Portuguese Foundation for Science and Technology) [FCOMP-01-2014-FEDER-041499]
Ask authors/readers for more resources
Production and distribution problems with perishable goods are common in many industries. For the sake of the competitiveness of the companies, the supply chain planning of products with restricted lifespan should be addressed with an integrated approach. Particularly, at the operational level, the sizing and scheduling of production lots have to be decided together with vehicle routing decisions to satisfy the customers. However, such joint decisions make the problems hard to solve for industries with a large product portfolio. This paper proposes an adaptive large neighbourhood search (ALNS) framework to tackle the problem. This metaheuristic is well known to be effective for vehicle routing problems. The proposed approach relies on mixed-integer linear programming models and tools. The ALNS outperforms traditional procedures of the literature, namely, exact methods and fix-and-optimize, in terms of quality of the solution and computational time of the algorithms. Nine in ten runs of ALNS yielded better solutions than traditional procedures, outperforming on average 12.7% over the best solutions provided by the latter methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available