2023
DOI: 10.3390/photonics10080896
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Objective Optimization for Submarine Cable Route Planning Based on the Ant Colony Optimization Algorithm

Abstract: It is essential to design an appropriate submarine cable route to reduce costs and improve reliability. A methodology that can be used for multi-objective optimization in submarine cable route planning is proposed and numerically studied in this paper. The costs and risks are numerically assessed and mapped to the geographical map. The pheromone and heuristic functions of the ant colony optimization (ACO) algorithm are associated with the geographical map of costs and risks, which enables it to search for a su… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Then mathematical programming [24] is used to solve the problem, but the traditional solution method can only obtain an optimal solution each time, and the relationship between the objectives needs to be studied to transform the multi-objective solution into a single-objective solution, which is complex and inefficient. Intelligent algorithms based on Pareto optimal solutions mainly include multi-objective genetic algorithms (NSGA, NSGA-II, NSGA-III) [46], multi-objective particle swarm optimization (MOPSO) [47], and multi-target human worker ant colony algorithm (MOABC) [48], Their essence is to use modern intelligent algorithms to calculate the Pareto solution set of the multi-objective optimization model and can generate multiple Pareto optimal solutions at a time, which has been widely concerned by scholars at home and abroad. Genetic algorithm (GA) is a kind of search algorithm that simulates the genetic and evolutionary processes of natural organisms and has good applicability to complex nonlinear and multi-dimensional space optimization problems.…”
Section: Key Points Of the Algorithmmentioning
confidence: 99%
“…Then mathematical programming [24] is used to solve the problem, but the traditional solution method can only obtain an optimal solution each time, and the relationship between the objectives needs to be studied to transform the multi-objective solution into a single-objective solution, which is complex and inefficient. Intelligent algorithms based on Pareto optimal solutions mainly include multi-objective genetic algorithms (NSGA, NSGA-II, NSGA-III) [46], multi-objective particle swarm optimization (MOPSO) [47], and multi-target human worker ant colony algorithm (MOABC) [48], Their essence is to use modern intelligent algorithms to calculate the Pareto solution set of the multi-objective optimization model and can generate multiple Pareto optimal solutions at a time, which has been widely concerned by scholars at home and abroad. Genetic algorithm (GA) is a kind of search algorithm that simulates the genetic and evolutionary processes of natural organisms and has good applicability to complex nonlinear and multi-dimensional space optimization problems.…”
Section: Key Points Of the Algorithmmentioning
confidence: 99%