Results 21 to 30 of about 12,651,596 (195)

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, Wassan, Niaz A., Salhi, Said   +2 more
core   +1 more source

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

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, Cabo, Marta, Possani, Edgar, Potts, Chris N.   +3 more
core   +1 more source

Research on the scheduling method of ground resource under uncertain arrival time

Operations Research Perspectives, 2023
We present a two-stage scheduling approach including proactive and reactive scheduling to solve the ground resource scheduling problem with uncertain arrival time.
Guoning Xu, Yupeng Lin, Zhiying Wu, Qingxin Chen, Ning Mao   +4 more
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, Hansen, P, Urosevic, D, Mladenović, N   +3 more
core   +1 more source

Vehicle Routing Problem with Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm

, 2020
Cross-docking is a logistics strategy that aims at less transportation costs and fast customer deliveries. Incorporating an efficient vehicle routing could increase the benefits of the cross-docking. In this paper, the vehicle routing problem with reverse cross-docking (VRP-RCD) is studied.
Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu   +3 more
openaire   +3 more sources

Research on Route Optimization of Single-Supply-Point Perishable Goods Multimodal Transport Considering Transportation Vibration Loss

Mathematics
As the market of perishable goods in China continues to expand, reducing quality loss during transportation has become an urgent issue for the industry.
Yang Xu, Mei-Juan Ma, Xin Zhang, Bin Su, Meng Zhang, Qing-E Guo   +5 more
doaj   +1 more source

Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem.

PLoS ONE, 2023
In this paper, a dynamic sub-route-based self-adaptive beam search Q-learning (DSRABSQL) algorithm is proposed that provides a reinforcement learning (RL) framework combined with local search to solve the traveling salesman problem (TSP). DSRABSQL builds
Jin Zhang, Qing Liu, XiaoHang Han
doaj   +1 more source

Buffer capacity allocation in unreliable production lines: An adaptive large neighborhood search approach

Engineering Science and Technology, an International Journal, 2021
The design of a production line directly affects the system performance which is usually measured by its throughput. The problem involving determination of the optimal capacity and location of the buffers in a production line is known as the buffer ...
Mehmet Ulaş Koyuncuoğlu, Leyla Demir
doaj   +1 more source

Flowchart of adaptive large neighborhood search algorithm.

, 2018
Flowchart of adaptive large neighborhood search algorithm.
Dezhi Zhang (3685177), Shuangyan Li (502833), Xin Wang (91924), Nan Ni (4873021), Zhuo Zhang (72795)   +4 more
core   +1 more source