SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows
The Team Orienteering Problem with Time Windows (TOPTW) is the extended version of the Orienteering Problem where each node is limited by a given time window. The objective is to maximize the total collected score from a certain number of paths. In this paper, a hybridization of Simulated Annealing...
Saved in:
Main Authors: | GUNAWAN, Aldy, LAU, Hoong Chuin, LU, Kun |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3398 https://ink.library.smu.edu.sg/context/sis_research/article/4399/viewcontent/SAILS.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Well-tuned algorithms for the team orienteering problem with time windows
by: GUNAWAN, Aldy, et al.
Published: (2017) -
Well-tuned algorithms for the Team Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2017) -
An iterated local search algorithm for solving the Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2015) -
Simulated annealing with reinforcement learning for the set team orienteering problem with time windows
by: YU, Vincent F., et al.
Published: (2024) -
Iterated local search algorithm for the capacitated team orienteering problem
by: GUNAWAN, Aldy, et al.
Published: (2018)