Results 21 to 30 of about 8,476 (163)
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Bruglieri, F. Pezzella, O. Pisacane
openaire +2 more sources
Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows [PDF]
We consider a multitrip vehicle routing problem with time windows (MTVRPTW), in which each vehicle can perform several trips during its working shift. This problem is especially relevant in the context of city logistics. Heuristic solution methods for multitrip vehicle routing problems often separate routing and assignment phases to create trips and ...
François, Véronique +2 more
openaire +2 more sources
Location and Routing Planning Considering Electric Vehicles with Restricted Distance in Agriculture
Electric vehicles (EVs) are anticipated to play a critical role in the green transportation of the future. Logistics companies have started several projects operating with EVs in road transportation.
Chalermchat Theeraviriya +2 more
doaj +1 more source
Adaptive Large Neighborhood Search Enhances Global Network Alignment
Aligning protein-protein interaction networks from different species is a useful mechanism for figuring out orthologous proteins, predicting/verifying protein unknown functions or constructing evolutionary relationships. The network alignment problem is proved to be NP-hard, requiring exponential-time algorithms, which is not feasible for the fast ...
Do Duc Dong +4 more
openaire +2 more sources
Adaptive Large Neighborhood Search for a Production Planning Problem Arising in Pig Farming
. This article aims to resolve a particular production planning and workforce assignment problem. Many production lines may have different production capacities while producing the same product. Each production line is composed of three production stages,
Nat Praseeratasang +4 more
doaj +1 more source
Revisiting the Self-adaptive Large Neighborhood Search
This paper revisits the Self-Adaptive Large Neighborhood Search introduced by Laborie and Godard. We propose a variation in the weight-update mechanism especially useful when the LNS operators available in the portfolio exhibit unequal running times. We also propose some generic relaxations working for a large family of problems in a black-box fashion.
Thomas, Charles +2 more
openaire +2 more sources
Adaptive Large Neighborhood Search for Circle Bin Packing Problem
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)
He, Kun +4 more
openaire +2 more sources
The unrelated parallel machine scheduling problem with sequence dependent setup times (UPMSP-SDST) addressed in this study refers to allocating jobs among a given number of machines and determining their processing sequence on each machine, to minimize ...
Bin Ji +3 more
doaj +1 more source
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules.
Slim Belhaiza
doaj +1 more source
The Partial Max-SAT (PMSAT) problem is an optimization variant of the well-known Propositional Boolean Satisfiability (SAT) problem. It holds an important place in theory and practice, because a huge number of real-world problems, such as timetabling ...
Haifa Hamad Alkasem +1 more
doaj +1 more source

