A Quick Pheromone Matrix Adaptation Ant Colony Optimization for Dynamic Customers in the Vehicle Routing Problem DOI Creative Commons

Yuxin Liu,

Zhitian Wang,

Jin Liu

et al.

Journal of Marine Science and Engineering, Journal Year: 2024, Volume and Issue: 12(7), P. 1167 - 1167

Published: July 11, 2024

The path planning problem is an important issue in maritime search and rescue. This paper models the as a dynamic vehicle routing problem. It first designs generator that transforms existing benchmark sets for static into scenarios. Subsequently, it proposes effective Dynamic Ant Colony Optimization (DACO) algorithm, whose novelty lies dynamically adjusts pheromone matrix to efficiently handle customers’ changes. Moreover, DACO incorporates simulated annealing increase population diversity employs local operator dedicated route modification continuous performance maximization of route. experimental results demonstrated proposed outperformed approaches generating better routes across various sets. Specifically, achieved significant improvements cost, serviced customer quantity, adherence time window requirements. These highlight superiority problem, providing solution similar problems.

Language: Английский

An adaptive differential evolution algorithm to solve the multi-compartment vehicle routing problem: A case of cold chain transportation problem DOI Creative Commons
Supaporn Sankul, Naratip Supattananon, Raknoi Akararungruangkul

et al.

International journal of production management and engineering, Journal Year: 2024, Volume and Issue: 12(1), P. 91 - 104

Published: Jan. 31, 2024

This research paper introduces an adaptive differential evolution algorithm (ADE algorithm) designed to address the multi-compartment vehicle routing problem (MCVRP) for cold chain transportation of a case study twentyeight customers in northeastern Thailand. The ADE aims minimize total cost, which includes both expenses traveling and using vehicles. In general, this consists four steps: (1) first step is generate initial solution. (2) second mutation process. (3) third recombination process, final selection To improve original DE algorithm, proposed increases number equations from one four. Comparing outcomes with those LINGO software based on numerical examples small-sized problems, other methods produce identical results that align global optimal Conversely, larger-sized it demonstrated effectively solves MCVRP case. more efficient than Lingo DE, respectively, terms cost. adapted original, proves advantageous solving MCVRPs large datasets due its simplicity effectiveness. contributes advancing logistics practical solution optimizing

Language: Английский

Citations

1

A Multi-Stage Differential-Multifactorial Evolutionary Algorithm for Ingredient Optimization in the Copper Industry DOI
Xuerui Zhang, Zhongyang Han, Jun Zhao

et al.

IEEE/CAA Journal of Automatica Sinica, Journal Year: 2024, Volume and Issue: 11(10), P. 2135 - 2153

Published: April 1, 2024

Ingredient optimization plays a pivotal role in the copper industry, for which it is closely related to concentrate utilization rate, stability of furnace conditions, and quality production. To acquire practical ingredient plan, should exhibit long duration time with sufficient feeding real applications, an plan model proposed this study effectively guarantee continuous production stable conditions. address complex challenges posed by integer programming model, including multiple coupling stages, intricate constraints, significant non-linearity, multi-stage differential-multifactorial evolution algorithm developed. In algorithm, differential evolutionary (DE) improved three aspects efficiently tackle when optimizing model. First, unlike traditional time-consuming serial approaches, multifactorial utilized optimize models contained population caused parallel manner. Second, repair employed adjust infeasible lists timely addition, local search strategy taking feedback from current optima considering different positions global optimum developed avoiding premature convergence algorithm. Finally, simulation experiments planning horizons using data industry China are conducted, demonstrates superiority method on compared other commonly deployed approaches. It practically helpful reducing material cost as well increasing profit industry.

Language: Английский

Citations

1

A discrete wild horse optimizer for capacitated vehicle routing problem DOI Creative Commons
Chuncheng Fang,

Yanguang Cai,

Yanlin Wu

et al.

Scientific Reports, Journal Year: 2024, Volume and Issue: 14(1)

Published: Sept. 11, 2024

Language: Английский

Citations

1

Optimal Design of Magnetic Sensor Arrays for Tunnel Transmission Lines Based on Noncontact Measurement and Differential Evolution Method DOI
Dongsheng Cai, Xingyu Zhou, Arsalan Habib Khawaja

et al.

IEEE Sensors Journal, Journal Year: 2023, Volume and Issue: 23(20), P. 25271 - 25280

Published: Sept. 8, 2023

Electric power transmission by tunnel technology resolves limitations of overhead lines restricted complex terrain, geological conditions, and environmental protection. A method involves a sophisticated line-laying procedure within smaller measurement space. However, it remains challenging task to monitor their real-time operational status. It is anticipated that monitoring utilizing magnetic can be promising solution. In this article, we propose optimizing sensor arrays using differential evolution (DE) algorithm. The current reconstruction technique based on noncontact measurements for different laying topologies presented. novel condition number-based approach proposed the error assessment. Then, DE algorithm utilized optimization number index optimal array arrangement. Random noise introduced in field emulate real-world scenarios. root-mean-square (RMSE) reconstructed presence reduced from 8.867% 1.267% vertical line configuration method. comparison other methods, yields accurate reliable results.

Language: Английский

Citations

2

A Quick Pheromone Matrix Adaptation Ant Colony Optimization for Dynamic Customers in the Vehicle Routing Problem DOI Creative Commons

Yuxin Liu,

Zhitian Wang,

Jin Liu

et al.

Journal of Marine Science and Engineering, Journal Year: 2024, Volume and Issue: 12(7), P. 1167 - 1167

Published: July 11, 2024

The path planning problem is an important issue in maritime search and rescue. This paper models the as a dynamic vehicle routing problem. It first designs generator that transforms existing benchmark sets for static into scenarios. Subsequently, it proposes effective Dynamic Ant Colony Optimization (DACO) algorithm, whose novelty lies dynamically adjusts pheromone matrix to efficiently handle customers’ changes. Moreover, DACO incorporates simulated annealing increase population diversity employs local operator dedicated route modification continuous performance maximization of route. experimental results demonstrated proposed outperformed approaches generating better routes across various sets. Specifically, achieved significant improvements cost, serviced customer quantity, adherence time window requirements. These highlight superiority problem, providing solution similar problems.

Language: Английский

Citations

0