Truck and Trailer Routing Problem Solving by a Backtracking Search Algorithm

作     者：Shiyi YUAN Jianwen FU Feng CUI Xin ZHANG 

作者机构：School of Economics and ManagementBeijing University of TechnologyBeijing 100124China Research Department of Beijing Smarter Eye Technology Co.LtdBeijing 100123China Institute of Fundamental and Interdisciplinary SciencesBeijing Union UniversityBeijing 100101China 

出 版 物：《Journal of Systems Science and Information》 (系统科学与信息学报（英文）)

年 卷 期：2020年第11卷第3期

页      面：253-272页

核心收录：

学科分类：08[工学] 081104[工学-模式识别与智能系统] 0811[工学-控制科学与工程] 

基　　金：Supported by Premium Funding Project for Academic Human Resources Development in Beijing Union University(BPHR2020CZ06) 

主　　题：Truck algorithm trail 

摘      要：Truck 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.