A novel framework for a stand-alone Orienteering Problem reinforcement learning-driven beam search

This study improves the orienteering algorithm since neural network-based routing strategies have crucial issues. Most conventional approaches use node coordinates, but they use encoder-decoder patterns that don't understand the self-referential nature of routing tasks, resulting in low accuracy during the first steps of node selection and making them impractical. A hybrid technique using a variant beam search algorithm and a learnt heuristic function with higher quality and shorter computation time is offered to overcome these difficulties. Our solution uses an attention-based functional neural network to learn structural dependence between nodes via distance matrices. The reinforcement learning infrastructure trains the heuristic function to enhance node choices and sequences. Experiments show that the single- and multi-label temporal correlation models surpass existing benchmarks on numerous benchmark datasets. In particular, the suggested model generates near optimum solutions with 98.7% accuracy and beats the state-of-the-art technique by 4.3%. Using the suggested framework, convergence is 30% quicker and computing efficiency increases. These findings show that the strategy is beneficial and more efficient, accurate, and practical than current approaches for handling routing difficulties.

Authors

Institutions

Publication Details

Published
2025-06-05
DOI
https://doi.org/10.1109/iccsp64183.2025.11089193
Primary Topic
Blind Source Separation Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A novel framework for a stand-alone Orienteering Problem reinforcement learning-driven beam search

Subodh Kumar Suman, G. S. Annie Grace Vimala, S Sivankalai, S Selvakumaran et al.
Blind Source Separation Techniques
article

A novel framework for a stand-alone Orienteering Problem reinforcement learning-driven beam search

Subodh Kumar Suman, G. S. Annie Grace Vimala, S Sivankalai, S Selvakumaran, K Saravanan, P Vithiya
article en

Abstract

This study improves the orienteering algorithm since neural network-based routing strategies have crucial issues. Most conventional approaches use node coordinates, but they use encoder-decoder patterns that don't understand the self-referential nature of routing tasks, resulting in low accuracy during the first steps of node selection and making them impractical. A hybrid technique using a variant beam search algorithm and a learnt heuristic function with higher quality and shorter computation time is offered to overcome these difficulties. Our solution uses an attention-based functional neural network to learn structural dependence between nodes via distance matrices. The reinforcement learning infrastructure trains the heuristic function to enhance node choices and sequences. Experiments show that the single- and multi-label temporal correlation models surpass existing benchmarks on numerous benchmark datasets. In particular, the suggested model generates near optimum solutions with 98.7% accuracy and beats the state-of-the-art technique by 4.3%. Using the suggested framework, convergence is 30% quicker and computing efficiency increases. These findings show that the strategy is beneficial and more efficient, accurate, and practical than current approaches for handling routing difficulties.

Central Leather Research Institute (IN), Anna University, Chennai (IN), Global College (CY), Artificial Intelligence in Medicine (Canada) (CA), Tilka Manjhi Bhagalpur University (IN)
Reduced inequalities
Openalex Percentile: Top 76%
Blind Source Separation Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.