Zarei H, Basiri P, Yousefikhoshbakht M. An Effective Combination of Tabu Search, Elite Ant System and Local Search Algorithms for Solving the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows. jor 2023; 20 (2) :69-95
URL:
http://jamlu.liau.ac.ir/article-1-1809-en.html
Department of Mathematics, Faculty of Sciences, Bu-Ali Sina University, Hamedan, Iran , yousefikhoshbakht@gmail.com
Abstract: (1276 Views)
The heterogeneous fixed fleet open vehicle routing problem with time windows (HFFOVRPTW) is one of the most important versions of the classical vehicle routing problem (VRP) which has many applications in industrial and services problems. The objective is to find the minimum total fixed and variable cost for a fixed fleet of vehicles so that the total load of each vehicle cannot exceed the capacity of the corresponding vehicle type. Moreover, each customer has a specified time window for service and the vehicles start at the depot and terminate at one of the customers. In this paper, a mixed integer programming model is introduced, and since this problem, like open vehicle routing problem (OVRP) and heterogeneous fixed fleet vehicle routing problem (HFFVRP), belongs to NP-hard combinatorial optimization problems, a modified tabu search algorithm (PTS) is proposed in order to solve this model. In addition, a numerical example is presented to show the correctness of the proposed model, and the results of the proposed metaheuristic algorithm are compared to the exact algorithm, tabu search, and ant colony optimization. The results proved the efficiency of the proposed PTS algorithm.
Type of Study:
Research |
Subject:
Special Received: 2022/10/25 | Accepted: 2023/03/28