A clustering metaheuristic for large orienteering problems
<p dir="ltr">The Orienteering Problem is a routing problem that commonly appears in mapping, transportation, distribution, and scheduling scenarios. The Orienteering Problem is a challenging NP-hard problem, such that obtaining optimal or near optimal solutions usually requires a sig...
Saved in:
| Main Author: | Almiqdad Elzein (13141038) (author) |
|---|---|
| Other Authors: | Gianni A. Di Caro (23275861) (author) |
| Published: |
2022
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems
by: Bilal Khurshid (16715865)
Published: (2024) -
Effective solutions for the capacitated vehicle routing problem and for the split delivery vehicle routing problem with time windows. (c2013)
by: Hilal, Nathalie
Published: (2013) -
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
by: Raka Jovanovic (17947838)
Published: (2024) -
Applying Graph Neural Networks to the Decision Version of Graph Combinatorial Optimization Problems
by: Raka Jovanovic (17947838)
Published: (2023) -
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem
by: Abu Zitar, Raed
Published: (2021)