Set Team Orienteering Problem with Time Windows
This research introduces an extension of the Orienteering Problem (OP), known as Set Team Orienteering Problem with Time Windows (STOPTW), in which customers are first grouped into clusters. Each cluster is associated with a profit that will be collected if at least one customer within the cluster i...
Saved in:
Main Authors: | GUNAWAN, Aldy, YU, Vincent F., SUTANTO, Andros Nicas, JODIAWAN, Panca |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6036 https://ink.library.smu.edu.sg/context/sis_research/article/7039/viewcontent/STOP.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) -
Simulated annealing with reinforcement learning for the set team orienteering problem with time windows
by: YU, Vincent F., et al.
Published: (2024) -
SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2015) -
An Adaptive Large Neighborhood Search for the green mixed fleet vehicle routing problem with realistic energy consumption and partial recharges
by: YU, Vincent F., et al.
Published: (2021) -
Well-tuned algorithms for the Team Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2017)