UDC: A unified neural divide-and-conquer framework for large-scale combinatorial optimization problems
Single-stage neural combinatorial optimization solvers have achieved near-optimal results
on various small-scale combinatorial optimization (CO) problems without requiring expert …
on various small-scale combinatorial optimization (CO) problems without requiring expert …
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
This paper is motivated by a non-emergency ambulance transportation service provider that
picks up and drops off patients while considering both the time window for medical …
picks up and drops off patients while considering both the time window for medical …
Solving the large-scale tsp problem in 1 h: Santa claus challenge 2020
R Mariescu-Istodor, P Fränti - Frontiers in Robotics and AI, 2021 - frontiersin.org
The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale
problem instances has been an open problem for a long time. We arranged a so-called …
problem instances has been an open problem for a long time. We arranged a so-called …
Extended maximal covering location and vehicle routing problems in designing smartphone waste collection channels: a case study of Yogyakarta province …
Most people will store smartphone waste or give it to others; this is due to inadequate waste
collection facilities in all cities/regencies in Indonesia. In Yogyakarta Province, there is no …
collection facilities in all cities/regencies in Indonesia. In Yogyakarta Province, there is no …
[HTML][HTML] Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap
A Formella - Journal of Computational Science, 2024 - Elsevier
The traveling salesman problem (TSP) is a well studied NP-hard optimization problem. We
present a novel heuristic to find approximate solutions for the case of the TSP with Euclidean …
present a novel heuristic to find approximate solutions for the case of the TSP with Euclidean …
Threading Subunits for Polymers to Predict the Equilibrium Ensemble of Solid Polymer Electrolytes
We present a computational method for polymer growth called “threading subunits for
polymers (TSP)” that can efficiently sample solid polymer electrolyte structures with …
polymers (TSP)” that can efficiently sample solid polymer electrolyte structures with …
[HTML][HTML] Learning to Guide Local Search Optimisation for Routing Problems
Abstract Machine learning has shown promises in tackling routing problems yet falls short of
state-of-the-art solutions achieved by stand-alone operations research algorithms. This …
state-of-the-art solutions achieved by stand-alone operations research algorithms. This …
Metaheuristic enhancement with identified elite genes by machine learning
The traveling salesman problem (TSP) is a classic NP-hard problem in combinatorial
optimization. Due to its difficulty, heuristic approaches such as hill climbing (HC), variable …
optimization. Due to its difficulty, heuristic approaches such as hill climbing (HC), variable …
Converting MST to TSP path by branch elimination
P Fränti, T Nenonen, M Yuan - Applied Sciences, 2020 - mdpi.com
Travelling salesman problem (TSP) has been widely studied for the classical closed loop
variant but less attention has been paid to the open loop variant. Open loop solution has …
variant but less attention has been paid to the open loop variant. Open loop solution has …
Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design
Handcrafting heuristics for solving complex planning tasks (eg, NP-hard combinatorial
optimization (CO) problems) is a common practice but requires extensive domain …
optimization (CO) problems) is a common practice but requires extensive domain …