Travelling salesman problem with time windows (TSPTW) is a well-known NP-hard problem in which the objective is to minimize the total travel cost or makespan when visiting each of a set of customers within a given time period. In the literature, TSPTW with the objective of travel cost minimization is extensively studied and a good many heuristic methods are developed to solve these problems. However, TSPTW with the objective of makespan minimization rarely studied and fewer solution approaches are proposed. In this study, we develop a novel differential evolution algorithm to solve TSPTW with the objective of makespan minimization. The performance of the proposed algorithm is tested on several benchmark problems from the literature. According to the experimental results, the differential evaluation algorithm outperforms the existing approaches for makespan minimization.
Nihan Kabadayi, Istabul University School of Business, Turkey
Timur Keskinturk, Istabul University School of Business, Turkey
Stream: Computational Social Science
This paper is part of the ACSS2015 Conference Proceedings (View)
View / Download the full paper in a new tab/window
Comments & FeedbackPlace a comment using your LinkedIn profile
Share this Research