Results 81 to 90 of about 12,651,596 (195)

Fuel-Efficient Multi-Sortie Scheduling for Forestry Helicopter Spraying Using Hybrid Adaptive Large Neighborhood Search with Sortie Consolidation

open access: yesAlgorithms
Forestry helicopter spraying requires fuel-efficient allocation of coverage tasks to successive sorties. Coverage-path generation alone does not resolve this allocation under coupled pesticide depletion and load-dependent fuel consumption. We formulate a
Liping Chen   +4 more
doaj   +1 more source

Research on the A* Algorithm Based on Adaptive Weights and Heuristic Reward Values

open access: yesWorld Electric Vehicle Journal
Aiming at the problems of the A* algorithm’s long running time, large number of search nodes, tortuous paths, and the planned paths being prone to colliding with the corner points of obstacles, adaptive weighting and reward value theory are proposed to ...
Xizheng Wang, Gang Li, Zijian Bian
doaj   +1 more source

An adaptive large neighborhood search algorithm for selective and periodic inventory routing problem

open access: yes, 2020
In this thesis we develop the first metaheuristic method for a selective and periodic inventory routing problem (SPIRP) that arises in reverse logistics. The problem concerns a biodiesel production company collecting used vegetable oil from restaurants and hotels which are the source nodes using and wasting vegetable oil in considerable amounts.
openaire   +1 more source

A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem

open access: yes, 2010
This paper presents a hybrid of a general heuristic framework that has been successfully applied to vehicle routing problems and a general purpose MIP solver. The framework uses local search and an adaptive procedure which choses between a set of large neighborhoods to be searched.
Muller, Laurent Flindt   +1 more
openaire   +1 more source

A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem

open access: yes, 2007
We propose a metaheuristic algorithm for the multi-resource generalized assignment problem (MRGAP). MRGAP is a generalization of the generalized assignment problem, which is one of the representative combinatorial optimization problems known to be NP ...
Shinji Iwasaki   +3 more
core  

An adaptive large neighborhood search algorithm for the carrier-vehicle traveling salesman problem

open access: yes, 2020
Birçok zorlu operasyon, farklı kabiliyetteki araçların birlikte çalışmasını ve koordinasyonunu gerektirir. Bu tarz çok araçlı sistemler, arama kurtarma ve keşif gibi çeşitli operasyonların etkisini arttırır, maliyetini azaltır ve güvenliğini sağlar. Taşıyıcı-Taşıt ikili araç sistemi, tamamlayıcı operasyonel kabiliyete sahip iki farklı aracın koordineli
openaire   +1 more source

Adaptive large neighborhood search heuristic for the elevator dispatching problem

open access: yes
In this project, we will focus on developing an Adaptive Large Neighborhood Search algorithm to provide solutions for the Elevator Dispatching Problem with destination control.
Caldeira da Silvia Beels, Martim
core  

Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance

open access: yes, 2010
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions in this paper are two-fold.
Srinidhi, N   +3 more
core  

An improved adaptive large neighborhood search algorithm on collaborative last mile delivery with roaming customers

open access: yesInternational Journal of Industrial Engineering Computations
This paper addresses the challenge of rising operational costs in last-mile delivery caused by end-customer no-shows. The study proposes a collaborative operational framework for last-mile delivery that accommodates roaming customers, enabling them to be serviced by multiple depots as they transition between different locations.
Yandong He   +3 more
openaire   +1 more source

Generic adaptive heuristics for large neighborhood search

open access: yes, 2010
The Large Neighborhood Search (LNS) approach for solving Constrained Optimization Problems has been proved to be eective on a wide range of problems. LNS is a local search metaheuristic that uses a complete search method (such as CP) to explore a large ...
Deville, Yves   +3 more
core  

Home - About - Disclaimer - Privacy