An iterative three-component heuristic for the team orienteering problem with time windows |
| |
Authors: | Qian Hu Andrew Lim |
| |
Institution: | Department of Management Sciences, City University of Hong Kong, Tat Chee Ave., Kowloon Tong, Hong Kong |
| |
Abstract: | This paper studies the team orienteering problem with time windows, the aim of which is to maximize the total profit collected by visiting a set of customers with a limited number of vehicles. Each customer has a profit, a service time and a time window. A service provided to any customer must begin in his or her time window. We propose an iterative framework incorporating three components to solve this problem. The first two components are a local search procedure and a simulated annealing procedure. They explore the solution space and discover a set of routes. The third component recombines the routes to identify high quality solutions. Our computational results indicate that this heuristic outperforms the existing approaches in the literature in average performance by at least 0.41%. In addition, 35 new best solutions are found. |
| |
Keywords: | Routing Team orienteering problem with time windows Heuristic |
本文献已被 ScienceDirect 等数据库收录! |
|