TY - GEN
T1 - Guided Clarke and Wright Algorithm to Solve Large Scale of Capacitated Vehicle Routing Problem
AU - Herdianto, Bachtiar
AU - Komarudin,
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/4/23
Y1 - 2021/4/23
N2 - Transportation cost is the critical element of the total logistics costs of an organization. One way to reduce the cost that occurs from this operation is to optimize the delivery route. However, with the increase of delivery location, the potential routes are growing exponentially, escalating the complexity to find the optimal routes. Recent research from F. Arnold and K. Sörensen has shown that Capacitated-Vehicle Routing Problem (CVRP) has some important features to define whether the solution is good or not. Using the features of CVRP, they successfully guide the algorithm in the improvement phase to solve the large-scale CVRP. In this paper, we are focus on the initial phase, employing the Clarke and Wright algorithm (CW algorithm), to construct an initial solution of large-scale CVRP. We attempt to guide the CW algorithm using the most important feature of VRP to solve quickly and effectively. Later, the algorithm also tested to solve various problems' size, until up to 30,000 nodes with the competitive result and promising as a construction algorithm, in the initial phase, to construct another more optimal set of algorithms.
AB - Transportation cost is the critical element of the total logistics costs of an organization. One way to reduce the cost that occurs from this operation is to optimize the delivery route. However, with the increase of delivery location, the potential routes are growing exponentially, escalating the complexity to find the optimal routes. Recent research from F. Arnold and K. Sörensen has shown that Capacitated-Vehicle Routing Problem (CVRP) has some important features to define whether the solution is good or not. Using the features of CVRP, they successfully guide the algorithm in the improvement phase to solve the large-scale CVRP. In this paper, we are focus on the initial phase, employing the Clarke and Wright algorithm (CW algorithm), to construct an initial solution of large-scale CVRP. We attempt to guide the CW algorithm using the most important feature of VRP to solve quickly and effectively. Later, the algorithm also tested to solve various problems' size, until up to 30,000 nodes with the competitive result and promising as a construction algorithm, in the initial phase, to construct another more optimal set of algorithms.
KW - Capacitated-Vehicle Routing Problem
KW - Clarke and Wright Algorithm
UR - http://www.scopus.com/inward/record.url?scp=85107538146&partnerID=8YFLogxK
U2 - 10.1109/ICIEA52957.2021.9436750
DO - 10.1109/ICIEA52957.2021.9436750
M3 - Conference contribution
AN - SCOPUS:85107538146
T3 - 2021 IEEE 8th International Conference on Industrial Engineering and Applications, ICIEA 2021
SP - 449
EP - 453
BT - 2021 IEEE 8th International Conference on Industrial Engineering and Applications, ICIEA 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th IEEE International Conference on Industrial Engineering and Applications, ICIEA 2021
Y2 - 23 April 2021 through 26 April 2021
ER -