Algorithm selection for the team orienteering problem
This work utilizes Algorithm Selection for solving the Team Orienteering Problem (TOP). The TOP is an NP-hard combinatorial optimization problem in the routing domain. This problem has been modelled with various extensions to address different real-world problems like tourist trip planning. The comp...
Saved in:
Main Authors: | MISIR, Mustafa, GUNAWAN, Aldy, VANSTEENWEGEN, Pieter |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7159 https://ink.library.smu.edu.sg/context/sis_research/article/8162/viewcontent/Evolutionary_Computation_in_Combinatorial_Optimization.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
OSCAR: Online selection of algorithm portfolios with case study on memetic algorithms
by: MISIR, Mustafa, et al.
Published: (2015) -
Building algorithm portfolios for memetic algorithms
by: MISIR, Mustafa, et al.
Published: (2014) -
ADVISER: A web-based algorithm portfolio deviser
by: MISIR, Mustafa, et al.
Published: (2015) -
Simulated annealing for the single-vehicle cyclic inventory routing problem
by: GUNAWAN, Aldy, et al.
Published: (2019) -
A matheuristic algorithm for solving the vehicle routing problem with cross-docking
by: GUNAWAN, Aldy, et al.
Published: (2020)