Previous Article in Journal
Motion Analysis of International Energy Agency Wind 15 MW Floating Offshore Wind Turbine under Extreme Conditions
Previous Article in Special Issue
Enhanced Target Localization in the Internet of Underwater Things through Quantum-Behaved Metaheuristic Optimization with Multi-Strategy Integration
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

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

College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China
*
Author to whom correspondence should be addressed.
J. Mar. Sci. Eng. 2024, 12(7), 1167; https://doi.org/10.3390/jmse12071167
Submission received: 18 June 2024 / Revised: 8 July 2024 / Accepted: 8 July 2024 / Published: 11 July 2024

Abstract

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

Share and Cite

MDPI and ACS Style

Liu, Y.; Wang, Z.; Liu, J. A Quick Pheromone Matrix Adaptation Ant Colony Optimization for Dynamic Customers in the Vehicle Routing Problem. J. Mar. Sci. Eng. 2024, 12, 1167. https://doi.org/10.3390/jmse12071167

AMA Style

Liu Y, Wang Z, Liu J. A Quick Pheromone Matrix Adaptation Ant Colony Optimization for Dynamic Customers in the Vehicle Routing Problem. Journal of Marine Science and Engineering. 2024; 12(7):1167. https://doi.org/10.3390/jmse12071167

Chicago/Turabian Style

Liu, Yuxin, Zhitian Wang, and Jin Liu. 2024. "A Quick Pheromone Matrix Adaptation Ant Colony Optimization for Dynamic Customers in the Vehicle Routing Problem" Journal of Marine Science and Engineering 12, no. 7: 1167. https://doi.org/10.3390/jmse12071167

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop