The article introduces an adapted version of the Convex Hull Cheapest Insertion (CHCI) heuristic to address the Precedence Constrained Traveling Salesperson Problem (TSP-PC). The new algorithm, named ACHCI, considers precedence constraints in tour construction. By comparing it with the Nearest Neighbor (NN) heuristic on benchmark data, it shows that ACHCI excels when delivery nodes are centrally located and pickup nodes are at the periphery. The paper details the steps of the ACHCI algorithm, emphasizing how it respects precedence relations during node insertions. Computational experiments reveal that ACHCI performs better than NN in 97% of cases with specific spatial configurations of precedence constraints. However, its performance diminishes when child nodes have limited feasible insertion segments due to their spatial distribution.
다른 언어로
소스 콘텐츠 기반
arxiv.org
더 깊은 질문