A DSS Based on Hybrid Meta-Heuristic ILS-VND for Solving the 1-PDTSP

Abstract

Abstract. The one-commodity pickup-and-delivery travelling salesman problem is a well known combinatorial optimization problem applied in numerous practical situations. It consists of a set of customers dispersed on a geographical area and a vehicle with a predefined capacity that must not be exceeded. The vehicle starts from a depot, and should visit each customer only once then end at at the depot. The objective is to minimize the total length of the traveled path way. As the 1-PDTSP is known to be NP-hard, meta-heuristics perform well when generating solutions in a reasonable computation time. In this paper, we propose a hybrid-meta-heuristic Iterated Local search with Variable Neighborhood Descent (ILS-VND). In order to demonstrate the performance of the proposed approach in term of solution quality, we apply it on benchmark instances. Our approach is also applied in a real case on the city of Jendouba in the north west of Tunisia. The results are then highlighted in a cartographic format using Google Maps.