Results 31 to 40 of about 10,453,390 (281)
Variable neighbourhood decomposition search for 0-1 mixed integer programs [PDF]
, 2009 In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver.
Hanafi, S +7 more
core +1 more source
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj +1 more source
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem [PDF]
, 2008 The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the ...
Imran, Arif +2 more
core +1 more source
Location and Routing Planning Considering Electric Vehicles with Restricted Distance in Agriculture
World Electric Vehicle Journal, 2020 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
An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem [PDF]
Computers & Operations Research, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Wen +4 more
openaire +4 more sources
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
Algorithms, 2019 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
Flowchart of adaptive large neighborhood search algorithm.
, 2018 Flowchart of adaptive large neighborhood search algorithm.
Dezhi Zhang (3685177) +4 more
core +1 more source
A Heuristic Approach for a Real-World Electric Vehicle Routing Problem
Algorithms, 2019 To develop a non-polluting and sustainable city, urban administrators encourage logistics companies to use electric vehicles instead of conventional (i.e., fuel-based) vehicles for transportation services.
Mengting Zhao, Yuwei Lu
doaj +1 more source
, 2018 In the last 15 years, heuristics based on large neighborhood search (LNS) and the variant adaptive large neighborhood search (ALNS) have become some of the most successful paradigms for solving various transportation and scheduling problems.
David Pisinger +3 more
core +1 more source