Researchers have developed a new reward-density heuristic, termed the Efficiency heuristic, for dynamic multi-vehicle routing problems. This heuristic aims to maximize cumulative reward collected by a fleet of vehicles within a set time frame, while continuously replanning as new tasks emerge. Tested on applications like autonomous drone task allocation and urban taxi dispatch, the Efficiency heuristic demonstrated performance comparable to advanced metaheuristic algorithms but required significantly less computational time, establishing Pareto dominance. AI
IMPACT This heuristic could enable more efficient real-time decision-making in logistics and urban mobility systems.
RANK_REASON The cluster contains a research paper published on arXiv detailing a new heuristic for a complex optimization problem.
- Adaptive Large Neighbourhood Search
- alphaXiv
- arXiv
- CatalyzeX Code Finder for Papers
- CORE Recommender
- DagsHub
- Efficiency heuristic
- genetic algorithm
- Gotit.pub
- Hugging Face
- Orienteering Problem with Functional Profits for multi-source dynamic path construction
- ScienceCast
- simulated annealing
- vehicle routing problem
AI-generated summary · Google Gemini · from 2 sources. How we write summaries →
