An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem
| dc.contributor.author | Caccetta, Louis | |
| dc.contributor.author | Alameen, M. | |
| dc.contributor.author | Abdul-Niby, M. | |
| dc.date.accessioned | 2017-01-30T12:52:50Z | |
| dc.date.available | 2017-01-30T12:52:50Z | |
| dc.date.created | 2014-03-30T20:00:57Z | |
| dc.date.issued | 2013 | |
| dc.identifier.citation | Caccetta, Louis and Alameen, Mamoon and Abdul-Niby, Mohammed. 2013. An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem. Engineering, Technology & Applied Science Research. 3 (2): pp. 413-415. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/26323 | |
| dc.description.abstract |
This paper proposes an effective hybrid approach that combines domain reduction with the Clarke and Wright algorithm to solve the capacitated vehicle routing problem. The hybrid approach is applied to solve 10 benchmark capacitated vehicle routing problem instances. The dimension of the instances was between 21 to 200 customers. The results show that domain reduction can improve the classical Clarke and Wright algorithm by about 18%. The hybrid approach improves the large instances significantly in comparison with the smaller size instances. This paper will not show the time taken to solve each instance, as the Clarke and Wright algorithm and the hybrid approach took almost the same CPU time. | |
| dc.publisher | ETASR | |
| dc.relation.uri | http://etasr.com/index.php/ETASR/article/view/292 | |
| dc.title | An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem | |
| dc.type | Journal Article | |
| dcterms.source.volume | 3 | |
| dcterms.source.number | 2 | |
| dcterms.source.startPage | 413 | |
| dcterms.source.endPage | 415 | |
| dcterms.source.issn | 17928036 | |
| dcterms.source.title | Engineering, Technology & Applied Science Research | |
| curtin.department | ||
| curtin.accessStatus | Fulltext not available |