Results 11 to 20 of about 161,336 (310)
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodo Manthey, Jesse van Rhijn
openalex +3 more sources
Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization [PDF]
Researchers recently extended Distributed Constraint Optimization Problems (DCOPs) to Communication-Aware DCOPs so that they are applicable in scenarios in which messages can be arbitrarily delayed. Distributed asynchronous local search and inference algorithms designed for CA-DCOPs are less vulnerable to message latency than their counterparts for ...
Ben Rachmut, Roie Zivan, William Yeoh
openalex +5 more sources
Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP [PDF]
The 2-Opt heuristic is a simple, easy-to-implement local search heuristic for the traveling salesman problem. While it usually provides good approximations to the optimal tour in experiments, its worst-case performance is poor. In an attempt to explain the approximation performance of 2-Opt, we prove an upper bound of exp(O(sqrt(log(1/sigma))) for the ...
Künnemann, Marvin, Manthey, Bodo
openaire +4 more sources
Learning 2-opt Local Search from Heuristics as Expert Demonstrations [PDF]
Deep Reinforcement Learning (RL) has achieved high success in solving routing problems. However, state-of-the-art deep RL approaches require a considerable amount of data before they reach reasonable performance. This may be acceptable for small problems, but as instances grow bigger, this fact severely limits the applicability of these methods to many
Da Costa, Paulo +3 more
openaire +2 more sources
An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem [PDF]
The Multi-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm ...
Imran, A. (Arif)
core +13 more sources
Improving EAX with restricted 2-opt [PDF]
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements have been proposed for EAX in GA. However, some of the improvements have to make compromises between performance and solution quality.
Chen-hsiung Chan +3 more
openaire +1 more source
Estimating Above-Ground Biomass of Potato Using Random Forest and Optimized Hyperspectral Indices
Spectral indices rarely show consistency in estimating crop traits across growth stages; thus, it is critical to simultaneously evaluate a group of spectral variables and select the most informative spectral indices for retrieving crop traits.
Haibo Yang, Fei Li, Wei Wang, Kang Yu
doaj +1 more source
The effects of default nudges on promoting approval of welfare cuts: An exploration during COVID-19
The global COVID-19 pandemic has created significant financial and operational challenges for some businesses. As a result, temporary welfare benefit reduction may be a tough but future-oriented choice for both employers and employees.
Xin Liu +5 more
doaj +1 more source
Inclusion of residual tissue in biobanks: opt-in or opt-out? [PDF]
Residual samples are an important source of tissue for biobanks. They refer to leftover tissue that is obtained in the course of clinical care. Residual samples can be included through an opt-in method--that is, a person explicitly expresses consent to ...
Noor A A Giesbertz +2 more
doaj +1 more source
Two Helichrysum italicum extracts, OPT-1 (rich in phenolic acids) and OPT-2 (rich in total phenols and flavonoids), were prepared using hydroxypropyl-β-cyclodextrin (HP-β-CD)-assisted extraction.
Lejsa Jakupović +8 more
doaj +1 more source

