Abstract
AbstractTruck and trailer routing problem (TTRP) is one of the most frequently encountered problem in city distribution, particularly in populated and intensive downtown. This paper addresses this problem and designs a novel backtracking search algorithm (BSA) based meta-heuristics to solve it. The initial population is created by T-sweep heuristic and then based on the framework of backtracking search algorithm, four types of route improvement strategies are used as building blocks to improve the solutions of BSA in the process of mutation and crossover. The computational experiments and results indicate that the proposed BSA algorithm can provide an effective approach to generate high-quality solutions within the satisfactory computational time.
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 callDisclaimer: 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.
