An effective hybrid evolutionary algorithm for the set orienteering problem
Y Lu, U Benlic, Q Wu - Information Sciences, 2024 - Elsevier
Abstract The Set Orienteering Problem (SOP) is a variant of the popular Orienteering
Problem (OP) arising from a number of real-life applications. The aim is to find a tour across …
Problem (OP) arising from a number of real-life applications. The aim is to find a tour across …
Learning-guided iterated local search for the minmax multiple traveling salesman problem
The minmax multiple traveling salesman problem involves minimizing the longest tour
among a set of tours. The problem is of great practical interest because it can be used to …
among a set of tours. The problem is of great practical interest because it can be used to …
A Multi-population Integrated Approach for Capacitated Location Routing
The capacitated location-routing problem involves determining the depots from a set of
candidate capacitated depot locations and finding the required routes from the selected …
candidate capacitated depot locations and finding the required routes from the selected …
Approximation Algorithms for High Multiplicity Strip Packing, Thief Orienteering, and K-Median
A Bloch-Hansen - 2024 - ir.lib.uwo.ca
This thesis investigates three research objectives on three different problems:(1) algorithm
design for problems in which the input can be grouped into a small number of classes …
design for problems in which the input can be grouped into a small number of classes …
[PDF][PDF] Optimizing Edge Prediction in Traveling Salesman Problems Using Ensemble Learning and Hyperparameter Tuning
S Sharma, P Mohali, V Mahajan, G Kumar, K Thakur… - drafts.acctcomputing.com
Among the most important combinatorial optimization problems, essentials for various
operational and logistical applications, there is the so-called Traveling Salesman Problem …
operational and logistical applications, there is the so-called Traveling Salesman Problem …