Two-level particle swarm optimization for the multi-modal team orienteering problem with time windows

Citation data:

Applied Soft Computing, ISSN: 1568-4946, Vol: 61, Page: 1022-1040

Publication Year:
Usage 4
Abstract Views 2
Link-outs 2
Social Media 188
Shares, Likes & Comments 188
Citations 1
Citation Indexes 1
Vincent F. Yu, Parida Jewpanya, Ching-Jung Ting, A.A.N. Perwira Redi
Elsevier BV
Computer Science
article description
This study presents a new variant of the team orienteering problem with time windows (TOPTW), called the multi-modal team orienteering problem with time windows (MM-TOPTW). The problem is motivated by the development of a tourist trip design application when there are several transportation modes available for tourists to choose during their trip. We develop a mixed integer programming model for MM-TOPTW based on the standard TOPTW model with additional considerations of transportation mode choices, including transportation cost and transportation time. Because MM-TOPTW is NP-hard, we design a two-level particle swarm optimization with multiple social learning terms (2L-GLNPSO) to solve the problem. To demonstrate the applicability and effectiveness of the proposed model and algorithm, we employ the proposed 2L-GLNPSO to solve 56 MM-TOPTW instances that are generated based on VRPTW benchmark instances. The computational results demonstrate that the proposed 2L-GLNPSO can obtain optimal solutions to small and medium-scale instances. For large-scale instances, 2L-GLNPSO is capable of producing high-quality solutions. Moreover, we test the proposed algorithm on standard TOPTW benchmark instances and obtains competitive results with the state-of-art algorithms.

This article has 0 Wikipedia mention.