Iterated local search algorithm for the capacitated team orienteering problem
This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team Orienteering Problem (CTOP). In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the...
Saved in:
Main Authors: | GUNAWAN, Aldy, NG, Kien Ming, YU, Vincent F., ADIPRASETYO, Gordy, LAU, Hoong Chuin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4373 https://ink.library.smu.edu.sg/context/sis_research/article/5376/viewcontent/CTOP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
The capacitated team orienteering problem
by: GUNAWAN, Aldy, et al.
Published: (2019) -
An iterated local search algorithm for the team orienteering problem with variable profits
by: GUNAWAN, Aldy, et al.
Published: (2018) -
An iterated local search algorithm for solving the Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2015) -
Well-tuned algorithms for the team orienteering problem with time windows
by: GUNAWAN, Aldy, et al.
Published: (2017) -
SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2015)