Ship Pipe Route Design Using Improved A* Algorithm and Genetic Algorithm
Zongran Dong,Xuanyi Bian +1 more
49
TL;DR: This article proposes automatic approaches for solving ship pipe route design with A* algorithm and genetic algorithm and the feasibility and effectiveness of the proposed algorithms are demonstrated by the experiments on the designed and actual cases.
read more
Abstract: The goal of ship pipe route design (SPRD) is to seek the near-optimal paths that meet various constraints and objectives. Due to the complex construction of routing space, diverse piping constraints, and the large number of pipes, SPRD is one of the most difficult and time-consuming tasks even to a skilled pipe designer. This article proposes automatic approaches for solving SPRD with A* algorithm and genetic algorithm (GA). Firstly, by simplifying the equipment and decomposing the routing space into grids, the mathematical model of SPRD is created. Then, the improved A* algorithm (A*-Router) for single pipe routing is introduced. The evaluation function, auxiliary tables and algorithm framework of A*-Router are presented. To obtain high-quality and diverse layouts, the improved GA (A*-GA-Router) is formulated by A*-Router and the connection-points strategy. Several new genetic operators of A*-GA-Router are designed to improve the routing performance. For multiple pipes routing, the novel algorithm (Multi-Pipes-Router) which calls A*-GA-Router internally is put forward. It arranges pipes according to the specified routing sequence and can produce parallel layout under the function of GA optimization and connection-points strategy. To cope with branch-pipe routing widely existing in engineering, a new pipe router (Branch-Pipe-Router) is put forward using a modified Steiner Tree framework in combination with the proposed single pipe routing algorithms. Compared with the traditional methods based on coevolution, it is more versatile and can effectively balance the layout quality and time efficiency. Finally, the feasibility and effectiveness of the proposed algorithms are demonstrated by the experiments on the designed and actual cases.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Improved dynamic adaptive ant colony optimization algorithm to solve pipe routing design
TL;DR: In this paper , an improved dynamic adaptive ACO (IDAACO) is proposed to solve the pipe routing design problem for semi-submersible production platform in oil and gas industry.
27
Ship pipe route design using improved multi-objective ant colony optimization
TL;DR: In this paper , a new ship pipe route design method based on multi-objective ant colony optimization (MOACO) is presented, and the feasibility and efficiency of the proposed method are verified by simulation and actual routing cases.
21
A multi-objective cooperative particle swarm optimization based on hybrid dimensions for ship pipe route design
Yan Lin,Qiaoyu Zhang +1 more
TL;DR: In this article , a multiobjective cooperative particle swarm optimization based on hybrid dimensions (HDMCPSO) for ship pipe route design (SPRD) is presented, which adopts multi-particle dimensions strategy and cooperative update mechanism via representative of each subswarm based on multi-objective particle swarm optimizer.
12
Improved Q-Learning Applied to Dynamic Obstacle Avoidance and Path Planning
01 Jan 2022
TL;DR: In this paper , the priority weight was introduced into the Q-learning algorithm to improve the value evaluation of the algorithm in solving practical problems, and the improved algorithm is compared with existing algorithms and applied to dynamic obstacle avoidance path planning.
12
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
12.7K
Fibonacci heaps and their uses in improved network optimization algorithms
TL;DR: Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
Michael L. Fredman,Robert E. Tarjan +1 more
- 24 Oct 1984
TL;DR: The structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown to obtain improved running times for several network optimization algorithms.
1.7K
Related Papers (5)
Youn-Long Lin,Yu-Chin Hsu,Fur-Shing Tsai +2 more
- 05 Nov 1989
Hsiao-Ping Tseng,Carl M. Sechen +1 more
- 01 Jan 1997