Results 241 to 250 of about 10,453,390 (281)
Some of the next articles are maybe not open access.

A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem

European Journal of Operational Research, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Zulj
exaly   +3 more sources

An adaptive large neighborhood search for the discrete and continuous Berth allocation problem

Computers and Operations Research, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Glaydston Mattos Ribeiro   +2 more
exaly   +3 more sources

Adaptive large neighborhood search for scheduling of mobile robots

Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Our work addresses the scheduling of mobile robots for transportation and processing of operations on machines in a flexible manufacturing system. Both mobile robots and automated guided vehicles (AGVs) can transport components among machines in the working space.
Quang-Vinh Dang 0002   +2 more
openaire   +1 more source

Evaluating the importance of randomization in adaptive large neighborhood search

International Transactions in Operational Research, 2016
AbstractRandomization is common in many implementations of metaheuristics, and is typically a main ingredient while considering adaptive large neighborhood search (ALNS). This paper considers a standard implementation of ALNS for maritime pickup and delivery problems, identifies seven randomized components in that implementation, and proposes and ...
Ahmad Hemmati, Lars Magnus Hvattum
openaire   +1 more source

An adaptive large neighborhood search heuristic for the Pollution-Routing Problem

European Journal of Operational Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emrah Demir   +2 more
openaire   +3 more sources

Adaptive large neighborhood search applied to the design of electronic circuits

Applied Soft Computing, 2018
Abstract In this paper, a new algorithm is proposed for solving the Gate Matrix Layout Problem (GMLP). This combinatorial problem is NP -Hard and aims to determine the physical layout of the components of an electronic circuit in order to minimize the number of tracks required to connect its nets.
Vinícius Gandra Martins Santos   +1 more
openaire   +1 more source

Adaptive large neighborhood search for solving the circle bin packing problem

Computers & Operations Research, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kun He 0001   +4 more
openaire   +2 more sources

A hybrid adaptive large neighborhood search heuristic for the team orienteering problem

Computers & Operations Research, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farouk Hammami   +2 more
openaire   +2 more sources

An Adaptive Large Neighborhood Search Method to Plan Patient’s Journey in Healthcare

2021
In this paper an adaptation of the Adaptive Large Neighborhood Search (ALNS) to a patient’s care planning problem is proposed. We formalize it as an RCPSP problem that consists of assigning a start date and medical resources to a set of medical appointments. Different intensification and diversification movements for the ALNS are presented.
Olivier Gérard   +3 more
openaire   +1 more source

Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem

2015
This paper is devoted to new approach to increase level of time consistency of heuristics and propose Dynamic Adaptive Large Neighborhood Search (DALNS) algorithm to improve solutions generated by ALNS.
Viacheslav A. Shirokikh   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy