Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem

  • Cai Y
N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

An improved artificial fish swarm algorithm (AFSA) for solving a combinatorial optimization problem—a berth allocation problem (BAP), which was formulated. Its objective is to minimize the turnaround time of vessels at container terminals so as to improve operation efficiency customer satisfaction. An adaptive artificial fish swarm algorithm was proposed to solve it. Firstly, the basic principle and the algorithm design of the AFSA were introduced. Then, for a test case, computational experiments explored the effect of algorithm parameters on the convergence of the algorithm. Experimental results verified the validity and feasibility of the proposed algorithm with rational parameters, and show that the algorithm has better convergence performance than genetic algorithm (GA) and ant colony optimization (ACO).

Cite

CITATION STYLE

APA

Cai, Y. (2010). Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem. International Journal of Intelligent Systems and Applications, 2(1), 37–43. https://doi.org/10.5815/ijisa.2010.01.06

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free