Advanced OR and AI Methods in Transportation PATH RELINKING FOR MULTIPLE OBJECTIVE COMBINATORIAL OPTIMIZATION. TSP CASE STUDY

Abstract. The paper presents a new metaheuristic algorithm for multiple objective combinatorial optimization based on the idea of path relinking. The algorithm is applied to the traveling salesperson problem with multiple link (arc) costs, corresponding to multiple objectives. The multiple costs may for example correspond to financial cost of travel along a link, time of travel, or risk in case of hazardous materials. The algorithm searches for new good solutions along paths in the decision space connecting two other good solutions. It is compared experimentally to state of the art algorithms for multiple objective TSP. 1