Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325144 
Year of Publication: 
2021
Citation: 
[Journal:] EURO Journal on Transportation and Logistics (EJTL) [ISSN:] 2192-4384 [Volume:] 10 [Issue:] 1 [Article No.:] 100036 [Year:] 2021 [Pages:] 1-10
Publisher: 
Elsevier, Amsterdam
Abstract: 
In this paper, an algorithm, called ACS-OPHS, is proposed to tackle the Orienteering Problem with Hotel Selection (OPHS). This algorithm is strongly based on the Ant Colony System (ACS); however, it differs from the ACS in the way the paths are constructed, in tuning a parameter of the transition rule and in the pheromone trails updating rules. The ACS-OPHS uses a bi-directional search strategy and employs a novel and fast approach to identify all feasible intermediate hotels in an offline manner. Moreover, in the ACS-OPHS, the relative importance of exploitation versus exploration is determined according to the progress of the algorithm in approaching to the global optima. The ACS-OPHS is a simple and well-performing approach to solve the OPHS. Concerning the standard benchmark instances, it outperforms the state-of-the-art algorithms in several instances and produces competitive solutions in reasonable time. This algorithm also improves the best known results of four instances with unknown optimal solutions.
Subjects: 
Ant colony system
Intermediate facilities
Orienteering problem
Orienteering problem with hotel selection
Routing problems
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.