Results 21 to 30 of about 10,453,390 (281)
Computation, 2021 This research presents a solution to the family tourism route problem by considering daily time windows. To find the best solution for travel routing, the modified adaptive large neighborhood search (MALNS) method, using the four destructions and the ...
Narisara Khamsing +4 more
doaj +1 more source
Split-merge:using exponential neighborhood search for scheduling a batching machine [PDF]
, 2015 We address the problem of scheduling a single batching machine to minimize the maximum lateness with a constraint restricting the batch size. A solution for this NP-hard problem is defined by a selection of jobs for each batch and an ordering of those ...
Song, Xiang +3 more
core +1 more source
Logistics, 2023 Background: The growth of e-commerce necessitates efficient logistics management to address rising last-mile delivery challenges. To overcome some of the last-mile delivery costs, parcel lockers as a delivery option, can be an alternative solution.
Amira Saker, Amr Eltawil, Islam Ali
doaj +1 more source
An adaptive large neighborhood search heuristic for the share-a-ride problem [PDF]
Computers & Operations Research, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baoxiang Li +3 more
openaire +3 more sources
Adaptive Large Neighborhood Search for Circle Bin Packing Problem
CoRR, 2020 We address a new variant of packing problem called the circle bin packing problem (CBPP), which is to find a dense packing of circle items to multiple square bins so as to minimize the number of used bins. To this end, we propose an adaptive large neighborhood search (ALNS) algorithm, which uses our Greedy Algorithm with Corner Occupying Action (GACOA)
Kun He 0001 +4 more
openaire +3 more sources
Large Neighborhood Search [PDF]
, 2010 Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics.
David Pisinger +3 more
core +1 more source
Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search [PDF]
Jisuanji kexue yu tansuoIn order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, and uniformity has gradually become one of the important goals in multi-objective optimization ...
WEI Qian, JI Bin
doaj +1 more source
Primal-dual variable neighborhood search for the simple plant-location problem [PDF]
, 2007 Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions.
Brimberg, J +3 more
core +1 more source
International Journal of Aerospace Engineering, 2020 Satellite establishes a satellite ground station to satellite link with a ground station to complete data transmission. However, in China, satellite ground stations only exist within the country.
Yingguo Chen +4 more
doaj +1 more source
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services [PDF]
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maurizio Bruglieri +2 more
openaire +2 more sources