Orienteering Problem: A survey of recent variants, solution approaches and applications
The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typ...
Saved in:
Main Authors: | GUNAWAN, Aldy, LAU, Hoong Chuin, VANSTEENWEGEN, Pieter |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3271 https://ink.library.smu.edu.sg/context/sis_research/article/4273/viewcontent/Orienteering_Problem_A_survey_of_recent_variants_solution_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Orienteering Problem: A survey of recent variants, solution approaches and applications
by: GUNAWAN, Aldy, et al.
Published: (2016) -
Well-tuned algorithms for the Team Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2017) -
The capacitated team orienteering problem
by: GUNAWAN, Aldy, et al.
Published: (2019) -
Iterated local search algorithm for the capacitated team orienteering problem
by: GUNAWAN, Aldy, et al.
Published: (2018) -
A selective-discrete particle swarm optimization algorithm for solving a class of orienteering problems
by: GUNAWAN, Aldy, et al.
Published: (2017)