期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 127, 期 -, 页码 213-224出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.11.044
关键词
Metaheuristics; Logistics; Team orienteering problem; Time window; Artificial bee colony; Time-dependent score
资金
- Ministry of Science and Technology of the Republic of China (Taiwan) [MOST 106-2410-H-011-002-MY3, MOST 105-2410-H-182-009-MY2/107-2410-H-182-005-MY2]
- Chang Gung Memorial Hospital, Linkou [CMRPD3G0011]
This study investigates the team orienteering problem with time windows and time-dependent scores (TOPTW-TDS), which is a new variant of the well-known team orienteering problem with time windows (TOPTW). TOPTW-TDS builds a set of paths to maximize the collected scores. The score of visiting an attraction in different depending on the time of visit. A mathematical formulation is proposed for this new problem. Since the problem is NP-hard, a hybrid artificial bee colony (HABC) algorithm is proposed to find the optimal solutions for small instances and near-optimal solutions for larger instances. Three datasets (small, medium and large) are generated with 168 TOPTW-TDS instances. Computational results reveal that the proposed HABC algorithm can generate high-quality TOPTW-TDS solutions. The proposed HABC obtains the optimal solution of each small TOPTW-TDS instance. For medium and large TOPTW-TDS instances, HABC results are comparable with the SA results. Additionally, results from solving TOPTW benchmark instances indicate that the proposed HABC compares well with the state-of-the-art algorithms for TOPTW.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据