Abstract
A novel heuristic method to solve the capacitated arc routing problem
Highlights
The capacitated arc routing problem (CARP) is one of the most important routing problems in literature, and attracted interest of many researchers
The aim of CARP is to design a set of vehicle tours of minimum total routing cost such that each tour starts and ends at the depot, each required edge is serviced by exactly one vehicle, and the total demand serviced by any vehicle most not exceed the vehicle’s capacity
The main objective of the current research is to propose a new heuristic for classical CARP that employs some ideas of “Double Outer Scan heuristic” and “Path-scanning whit Ellipse Rule heuristic” to solve the problem
Summary
The capacitated arc routing problem (CARP) is one of the most important routing problems in literature, and attracted interest of many researchers. Due to the computational complexity of the problem, there have been remarkable attempts by researchers in developing heuristic and metaheuristics algorithms to solve it. The main objective of the current research is to propose a new heuristic for classical CARP that employs some ideas of “Double Outer Scan heuristic” and “Path-scanning whit Ellipse Rule heuristic” to solve the problem. This proposed heuristic is based on selecting an unserved edge randomly, extending it by both of its end points, into a vehicle’s tour based on four effective criteria.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Industrial Engineering Computations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
