TY - JOUR
T1 - Multi-treatment capacitated arc routing of construction machinery in Taiwan's smooth road project
AU - Huang, Shan Huen
AU - Lin, Pei Chun
N1 - Funding Information:
The authors gratefully acknowledges the helpful comments of the editor and the three anonymous reviewers who provided valuable input and comments that have contributed to improving the content and exposition of this paper. This research was supported by a grant from the National Science Council of the Republic of China in Taiwan under grants NSC 99-2410-H-006-084 held by both authors, and under grants NSC 99-2622-H-006-002-CC3 held by the second author.
PY - 2012/1
Y1 - 2012/1
N2 - This study investigates the routing problems of road resurfacing in Taiwan's smooth road project, incorporating multiple treatments served by different construction machinery in a way that propagates extra time window constraints to ensure that a subsequent treatment starts after the required preceding treatment has started or been completed. The routing problem is modeled as a multi-treatment capacitated arc routing problem with time windows (MTCARPTW) in order to determine a set of trips at a minimum total cost that covers all required links of road resurfacing work. The MTCARPTW is first transformed into a traveling salesman problem (TSP); then, a heuristics method based on ant colony optimization (ACO) is applied and evaluated based on the set of given circumstances. The computational results indicate that the proposed algorithm is efficient. This research contributes to identifying a new routing problem, modeling this MTCARPTW, and introducing the ACO to solve the problem efficiently.
AB - This study investigates the routing problems of road resurfacing in Taiwan's smooth road project, incorporating multiple treatments served by different construction machinery in a way that propagates extra time window constraints to ensure that a subsequent treatment starts after the required preceding treatment has started or been completed. The routing problem is modeled as a multi-treatment capacitated arc routing problem with time windows (MTCARPTW) in order to determine a set of trips at a minimum total cost that covers all required links of road resurfacing work. The MTCARPTW is first transformed into a traveling salesman problem (TSP); then, a heuristics method based on ant colony optimization (ACO) is applied and evaluated based on the set of given circumstances. The computational results indicate that the proposed algorithm is efficient. This research contributes to identifying a new routing problem, modeling this MTCARPTW, and introducing the ACO to solve the problem efficiently.
UR - http://www.scopus.com/inward/record.url?scp=81355147658&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=81355147658&partnerID=8YFLogxK
U2 - 10.1016/j.autcon.2011.06.005
DO - 10.1016/j.autcon.2011.06.005
M3 - Article
AN - SCOPUS:81355147658
SN - 0926-5805
VL - 21
SP - 210
EP - 218
JO - Automation in construction
JF - Automation in construction
IS - 1
ER -