Well-tuned algorithms for the team orienteering problem with time windows

Well-tuned algorithms for the team orienteering problem with time windows

The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start. The objective of the TOPTW is to maximize the total collected score by visiting a set of nodes with...

Full description

Saved in:
Bibliographic Details
Main Authors: GUNAWAN, Aldy, LAU, Hoong Chuin, LU, Kun, KUN, Lu
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2017
Subjects:
Orienteering Problem
Time windows
Iterated Local Search
Simulated Annealing
Hybrid algorithm
Databases and Information Systems
Online Access:https://ink.library.smu.edu.sg/sis_research/4305
https://ink.library.smu.edu.sg/context/sis_research/article/5308/viewcontent/101057_s41274_017_0244_1.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/4305
https://ink.library.smu.edu.sg/context/sis_research/article/5308/viewcontent/101057_s41274_017_0244_1.pdf

Similar Items