Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem
نویسندگان
چکیده
منابع مشابه
Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem
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 princip...
متن کاملFish School Search Algorithm for Constrained Optimization
In this work we investigate the effectiveness of the application of niching able swarm metaheuristic approaches in order to solve constrained optimization problems. Sub-swarms are used in order to allow the achievement of many feasible regions to be exploited in terms of fitness function. The niching approach employed was wFSS, a version of the Fish School Search algorithm devised specifically ...
متن کاملA Hybrid Quantum-inspired Artificial Bee Colony Algorithm for Combinatorial Optimization Problem: 0-1 Knapsack
This paper propose a new mixture method called Quantum Artificial Bee Colony (QABC) algorithm. QABC is based on some quantum computing concepts, such as qubits and superposition of states. In QABC these quantum concepts are applied on Artificial Bee Colony (ABC) algorithm. ABC is one of the recent algorithms in optimization area that has earned good popularity and some new works based on origin...
متن کاملTolerances Applied in Combinatorial Optimization
In this paper we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ,Π,MAX) we give some basic properties on upper and lower tolerances. We show that the upper tolerance of an element is well defined, how to compute the upper tolerance of an element, and give equivalent formulations when the u...
متن کاملA combinatorial optimization algorithm for solving the branchwidth problem
In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced by Robertson and Seymour in their series of papers that proved the Graph Minors Theorem. Branch decompositions have proven to be useful in solving many NP-hard problems, such as the traveling salesman, independent set, and ring routing problems, b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems and Applications
سال: 2010
ISSN: 2074-904X,2074-9058
DOI: 10.5815/ijisa.2010.01.06