A constraint programming heuristic for a heterogeneous vehicle routing problem with split deliveries
| dc.contributor.author | Ozfirat P.M. | |
| dc.contributor.author | Ozkarahan I. | |
| dc.date.accessioned | 2025-04-10T11:15:50Z | |
| dc.date.available | 2025-04-10T11:15:50Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | This article considers fresh goods distribution of a retail chain store in Turkey. The problem is formulated as a vehicle routing problem with a heterogeneous fleet for which no exact algorithm has ever been designed to solve it. A fast and effective algorithm based on constraint programming is proposed for the solution. The procedure is tested on some of the benchmark problems in literature. The real-life case is first solved assuming that delivery of a customer cannot be split between vehicles. Then it is resolved considering split deliveries. Solutions of both strategies are compared with the current performance of the firm to determine a distribution strategy. Results indicate considerable improvement in the performance of the firm. | |
| dc.identifier.DOI-ID | 10.1080/08839511003715196 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/51308 | |
| dc.publisher | Bellwether Publishing, Ltd. | |
| dc.title | A constraint programming heuristic for a heterogeneous vehicle routing problem with split deliveries | |
| dc.type | Article |