Results 21 to 30 of about 6,794 (285)
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
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 +4 more
doaj +1 more source
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
Journal of Industrial and Management Optimization, 2023 <p style='text-indent:20px;'>The Vehicle Routing Problem with Multiple Time Windows (VRPMTW) is a generalization of problems in real life logistics distribution, which has a wide range of applications and research values. Several neighborhood search based methods have been used to solve this kind of problem, but it still has drawbacks of ...
Feng, Bin, Wei, Lixin, Hu, Ziyu
openaire +2 more sources
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
Metaheuristics for the Minimum Gap Graph Partitioning Problem [PDF]
, 2021 The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undirected graph into a given number of connected subgraphs with the minimum difference between the largest and the smallest weight in each subgraph. We propose
M. Bruglieri +3 more
core +1 more source
An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem [PDF]
, 2023 In this paper, we propose an adaptive large neighborhood search-based matheuristic algorithm to solve a multi-product many-to-many maritime inventory routing problem.
Ahmad Hemmati +3 more
core +1 more source
International Journal of Engineering Business Management, 2021 The multi-level location routing problem (MLLRP) is an extension of the capacitated location routing problem (CLRP). MLLRPs are considered a class of combinatorial optimization problems that arise in transportation applications, such as agricultural ...
Chalermchat Theeraviriya +2 more
doaj +1 more source
Logistics, 2022 Background: This research aimed to establish a network linked to generation, for the transport route of tapioca starch products to a land port, serving as the logistics hub of Thailand’s Nakhon Ratchasima province.
Chakat Chueadee +2 more
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