A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem

View/Open
Cita com:
hdl:2117/123216
Document typeArticle
Defense date2018-11-01
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
The Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem where the fixed schedule constraint is relaxed and the quantity to deliver to each customer at each visit is a decision variable. This flexibility leads to remarkable savings in total costs and this explains the interest in studying the problem and developing effective solution approaches. In this work, an iterative two-phase matheuristic is developed to solve medium and large instances of the problem. Computational tests are made on benchmark instances and on newly generated instances. The results of the matheuristic are compared to the best-known solutions, on small-size instances, and to lower bounds on larger instances. Computational results show that good quality solutions are obtained in a reasonable amount of time.
CitationArchetti, C., Fernandez, E., Huerta, D. A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. "Computers & operations research", 1 Novembre 2018, vol. 99, p. 27-37.
ISSN0305-0548
Publisher versionhttps://www.sciencedirect.com/science/article/pii/S0305054818301448
Files | Description | Size | Format | View |
---|---|---|---|---|
COR-D-17-00795R1.pdf | 686,8Kb | View/Open |