activity
20122022
most citedLearning to Optimise General TSP Instances

5 citations · 11 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG20221 cited

Sample-Efficient, Exploration-Based Policy Optimisation for Routing Problems

Nasrin Sultana, Jeffrey Chan, Tabinda Sarwar +1

Model-free deep-reinforcement-based learning algorithms have been applied to a range of COPs~\cite{bello2016neural}~\cite{kool2018attention}~\cite{nazari2018reinforcement}. However…

cs.AI20211 cited

Learning Enhanced Optimisation for Routing Problems

Nasrin Sultana, Jeffrey Chan, Tabinda Sarwar +2

Deep learning approaches have shown promising results in solving routing problems. However, there is still a substantial gap in solution quality between machine learning and operat…

cs.LG20203 cited

Learning Vehicle Routing Problems using Policy Optimisation

Nasrin Sultana, Jeffrey Chan, A. K. Qin +1

Deep reinforcement learning (DRL) has been used to learn effective heuristics for solving complex combinatorial optimisation problem via policy networks and have demonstrated promi…

cs.LG20205 cited

Learning to Optimise General TSP Instances

Nasrin Sultana, Jeffrey Chan, A. K. Qin +1

The Travelling Salesman Problem (TSP) is a classical combinatorial optimisation problem. Deep learning has been successfully extended to meta-learning, where previous solving effor…

cs.NI20121 cited

Study of a new link layer security scheme in a wireless sensor network

Nasrin Sultana, Tanvir Ahmed, A. B. M. Siddique Hossain

Security of wireless sensor network (WSN) is always considered a critical issue and has a number of considerations that separate them from traditional wireless sensor network. Firs…