An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem
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 wa...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
ETASR
2013
|
| Online Access: | http://etasr.com/index.php/ETASR/article/view/292 http://hdl.handle.net/20.500.11937/26323 |
| _version_ | 1848751953859837952 |
|---|---|
| author | Caccetta, Louis Alameen, M. Abdul-Niby, M. |
| author_facet | Caccetta, Louis Alameen, M. Abdul-Niby, M. |
| author_sort | Caccetta, Louis |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T08:00:55Z |
| format | Journal Article |
| id | curtin-20.500.11937-26323 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:00:55Z |
| publishDate | 2013 |
| publisher | ETASR |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-263232017-01-30T12:52:50Z An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem Caccetta, Louis Alameen, M. Abdul-Niby, M. 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. 2013 Journal Article http://hdl.handle.net/20.500.11937/26323 http://etasr.com/index.php/ETASR/article/view/292 ETASR restricted |
| spellingShingle | Caccetta, Louis Alameen, M. Abdul-Niby, M. An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem |
| title | An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem |
| title_full | An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem |
| title_fullStr | An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem |
| title_full_unstemmed | An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem |
| title_short | An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem |
| title_sort | improved clarke and wright algorithm to solve the capacitated vehicle routing problem |
| url | http://etasr.com/index.php/ETASR/article/view/292 http://hdl.handle.net/20.500.11937/26323 |