English
| dc.contributor.author | Ozfirat, PM | |
| dc.contributor.author | Ozkarahan, I | |
| dc.date.accessioned | 2024-07-18T11:57:22Z | |
| dc.date.available | 2024-07-18T11:57:22Z | |
| dc.description.abstract | TAYLOR & FRANCIS INC | |
| dc.identifier.issn | 1087-6545 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/7043 | |
| dc.language.iso | Article | |
| dc.publisher | 0883-9514 | |
| dc.subject | 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.title | English | |
| dc.type | FLEET SIZE | |
| dc.type | TIME WINDOWS | |
| dc.type | ALGORITHM |