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...
محفوظ في:
| المؤلف الرئيسي: | Almiqdad Elzein (13141038) (author) |
|---|---|
| مؤلفون آخرون: | Gianni A. Di Caro (23275861) (author) |
| منشور في: |
2022
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems
حسب: Bilal Khurshid (16715865)
منشور في: (2024) -
Effective solutions for the capacitated vehicle routing problem and for the split delivery vehicle routing problem with time windows. (c2013)
حسب: Hilal, Nathalie
منشور في: (2013) -
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
حسب: Raka Jovanovic (17947838)
منشور في: (2024) -
Applying Graph Neural Networks to the Decision Version of Graph Combinatorial Optimization Problems
حسب: Raka Jovanovic (17947838)
منشور في: (2023) -
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem
حسب: Abu Zitar, Raed
منشور في: (2021)