Multi-depot periodic vehicle routing problem with due dates and time windows

Roberto Cantu-Funes, M. Angélica Salazar-Aguilar and Vincent Boyer

Journal of the Operational Research Society, 2018, vol. 69, issue 2, 296-306

Abstract: This paper introduces a variant of the well-known Multi-Depot Periodic Vehicle Routing Problem, which is inspired by a real situation of a distribution company. The problem consists in determining the number of extra vehicles to rent, the assignment of vehicles to plants, and the routes between plants and distribution centers, while the transportation cost is minimized. We propose a mixed integer linear formulation and a Reactive Greedy Randomized Adaptive Search Procedure to solve the problem. Extensive computational results show that the proposed procedure provides high-quality solutions with an average gap lower than 2.5% from the computed lower bound.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1057/s41274-017-0206-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:69:y:2018:i:2:p:296-306

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1057/s41274-017-0206-7

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().