An iterated local search algorithm for the team orienteering problem with variable profits

An iterated local search algorithm for the team orienteering problem with variable profits

The orienteering problem (OP) is a routing problem that has numerous applications in various domains such as logistics and tourism. The objective is to determine a subset of vertices to visit for a vehicle so that the total collected score is maximized and a given time budget is not exceeded. The ex...

Full description

Saved in:
Bibliographic Details
Main Authors: GUNAWAN, Aldy, NG, Kien Ming, KENDALL, Graham, LAI, Junhan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2018
Subjects:
Orienteering problem
variable profit
mathematical programming model
iterated local search
Software Engineering
Theory and Algorithms
Online Access:https://ink.library.smu.edu.sg/sis_research/4039
https://ink.library.smu.edu.sg/context/sis_research/article/5041/viewcontent/Iterated_local_search_algorithm_2018_av.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/4039
https://ink.library.smu.edu.sg/context/sis_research/article/5041/viewcontent/Iterated_local_search_algorithm_2018_av.pdf

Similar Items