A Novel Hybrid Ant Colony Optimization Algorithm for Emergency Transportation Problems During Post-Disaster Scenarios

IEEE Transactions on Systems Man and Cybernetics Systems, Journal Year: 2016, Volume and Issue: 48(4), P. 545 - 556

Published: Oct. 19, 2016

The increasing impacts of natural disasters have led to concerns regarding predisaster plans and post-disaster responses. During responses, emergency transportation is the most important part disaster relief supply chain operations, its optimal planning differs from traditional problems in objective function complex constraints. In scenarios, fairness effectiveness are two aspects. This paper investigates real-life scenarios formulates problem as an integer linear programming model (called cum-MDVRP), which combines cumulative vehicle routing multidepot problem. cum-MDVRP NP-hard. To solve it, a novel hybrid ant colony optimization-based algorithm proposed by combining both saving algorithms simple two-step 2-opt algorithm. allows ants go out depots for multiple rounds, so we abbreviate it ACOMR. Moreover, present smart design ants' tabus, helps simplify solution constructing process. ACOMR could yield good solutions quickly, then decision makers responses do expert at earliest time. Computational results on standard benchmarking data sets show that performs well, more effective stable than existing algorithms.

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

---

Novel Ant Colony Optimization Methods for Simplifying Solution Construction in Vehicle Routing Problems

IEEE Transactions on Intelligent Transportation Systems, Journal Year: 2016, Volume and Issue: 17(11), P. 3132 - 3141

Published: April 29, 2016

As a novel evolutionary searching technique, ant colony optimization (ACO) has gained wide research attention and can be used as tool for optimizing an array of mathematical functions. In transportation systems, when ACO is applied to solve the vehicle routing problem (VRP), path each only "part" feasible solution. other words, multiple ants' paths may constitute one Previous works mainly focus on algorithm itself, such revising pheromone updating scheme combining with methods. However, this body literature ignores important procedure constructing solutions those "parts". To overcome problem, paper presents (called AMR) VRP. The proposed allows ants go in out depots more than once until they have visited all customers, which simplifies solutions. further enhance AMR, we propose two extensions (AMR-SA AMR-SA-II) by integrating AMR saving algorithms. computational results standard benchmark problems are reported compared from Experimental indicate that algorithms outperform existing

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

---

Cold Chain Logistics Path Optimization via Improved Multi-Objective Ant Colony Algorithm

IEEE Access, Journal Year: 2020, Volume and Issue: 8, P. 142977 - 142995

Published: Jan. 1, 2020

In order to improve the performance and change current situation of cost minimization model widely used in cold chain logistics distribution process, a multi-objective optimization based on cost, carbon emissions customer satisfaction is proposed. Considering characteristic this proposed model, we design an improved ant colony algorithm with heuristic function solve it, termed as ACOMO. Experimental results show that ACOMO can effectively vehicle routing problem outperforms classic algorithms, resulting more Pareto optimal solutions. It offers environmentally friendly solution for problem. Specifically, path obtained by manages achieve above multiple goals, including reduction costs emissions, improvement satisfaction. addition, compared single-target only provides one single route minimization, provide variety options companies practice. Finally, through sensitivity analysis temperature changes cargo damage coefficients, system successfully reference enterprises, promotes enterprises arrange their work be socially responsible.

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

---

A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion

Swarm and Evolutionary Computation, Journal Year: 2018, Volume and Issue: 44, P. 1018 - 1027

Published: Oct. 31, 2018

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

---

Applications of artificial intelligence in anaerobic co-digestion: Recent advances and prospects

Bioresource Technology, Journal Year: 2022, Volume and Issue: 370, P. 128501 - 128501

Published: Dec. 17, 2022

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

---

Handling dynamic capacitated vehicle routing problems based on adaptive genetic algorithm with elastic strategy

Swarm and Evolutionary Computation, Journal Year: 2024, Volume and Issue: 86, P. 101529 - 101529

Published: March 21, 2024

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

---

A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows

Information Sciences, Journal Year: 2015, Volume and Issue: 316, P. 266 - 292

Published: April 17, 2015

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

---

Joint order batching and picker Manhattan routing problem

Computers & Industrial Engineering, Journal Year: 2016, Volume and Issue: 95, P. 164 - 174

Published: March 15, 2016

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

---

Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems

Engineering Applications of Artificial Intelligence, Journal Year: 2020, Volume and Issue: 91, P. 103582 - 103582

Published: March 3, 2020

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

---

A metaheuristic approach to solve Dynamic Vehicle Routing Problem in continuous search space

Swarm and Evolutionary Computation, Journal Year: 2019, Volume and Issue: 48, P. 44 - 61

Published: March 19, 2019

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

---