# Research on Capacitated Multi-Ship Replenishment Path Planning Problem Based on the Synergistic Hybrid Optimization Algorithm

## TL;DR

This paper introduces a new hybrid algorithm combining ant colony optimization, Clarke-Wright, and genetic algorithms to solve multi-ship replenishment path planning in maritime logistics.

## Contribution

The novel synergistic hybrid optimization algorithm (SHOA) integrates three optimization methods for capacitated multi-ship replenishment path planning.

## Key findings

- The SHOA outperforms ACO, GA, particle swarm optimization, and simulated annealing in solving the capacitated vehicle routing problem.
- The algorithm demonstrates high adaptability and robust planning capabilities across diverse CMSRPPP instances.
- The three-stage framework effectively combines initial path generation and iterative refinement for improved performance.

## Abstract

Ship replenishment path planning is a critical problem in the field of maritime logistics. This study proposes a novel synergistic hybrid optimization algorithm (SHOA) that effectively integrates ant colony optimization (ACO), the Clarke–Wright algorithm (CW), and the genetic algorithm (GA) to solve the capacitated multi-ship replenishment path planning problem (CMSRPPP). The proposed methodology employs a three-stage optimization framework: (1) initial path generation via parallel execution of the CW and ACO; (2) population initialization for the GA by strategically combining optimal solutions from ACO and the CW with randomized solutions; (3) iterative refinement using an enhanced GA featuring an embedded evolutionary reversal operation for local intensification. To evaluate performance, the SHOA is benchmarked against ACO, the GA, the particle swarm optimization algorithm, and the simulated annealing algorithm for the capacitated vehicle routing problem. Finally, the SHOA is applied to diverse CMSRPPP instances, demonstrating high adaptability, robust planning capabilities, and promising practical potential.