Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
نویسندگان
چکیده
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heuristic. Our improvement is based on replacing the selection of each path to be contracted after deleting a heaviest arc from each short cycle in an Optimal Assignment Problem Solution (OAPS) by contracting a single arc from a short cycle in an OAPS with the largest upper tolerance with respect to one of the relaxed ATSP. The improved algorithm produces higher-quality tours than all previous COP versions and is clearly outperforming all other construction heuristics on robustness.
منابع مشابه
How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP. The selection of arcs to be included by a greedy heuristic is usually done on the base of cost values. We propose to use upper tolerances of an optimal solution to one of the relaxed Asymmetric TSP (ATSP) to ...
متن کاملModelling and Experimental Testing of Asymmetric Information Problems in Lease and Hire Contracts (Based on Contract Theory)
This article aims to study lease and hiring contract in the Iranian-Islamic setting and analyze the asymmetric information problem in these contracts. For doing this, we study the characteristics of lease and hiring contracts in Iran (real world experimental characteristics that recognized in other studies), using library method, then we mathematically model different aspects of asymmetric info...
متن کاملTheory and Methodology Construction heuristics for the asymmetric TSP
Non-Euclidean traveling salesman problem (TSP) construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive eorts devoted to studying Euclidean TSP construction heuristics. This state of aairs is at odds with the fact that asymmetric models are relevant to a wider range of applications, and indeed are un...
متن کاملConstruction heuristics for the asymmetric TSP
Non Euclidean TSP construction heuristics and especially asymmetric TSP construc tion heuristics have been neglected in the literature by comparison with the extensive e orts devoted to studying Euclidean TSP construction heuristics This state of a airs is at odds with the fact that asymmetric models are relevant to a wider range of applica tions and indeed are uniformly more general that symme...
متن کاملImproving the Asymmetric TSP by Considering Graph Structure
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based on general graph properties. We experimentally show that such implied propagators bring robustness to pathological instances and highlight the fact that grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006