Parallel m-dimensional relative ant colony optimization (mDRACO) for the Costas-array problem
Abstract The Costas-array problem is a combinatorial constraint-satisfaction problem (CSP) that remains unsolved for many array sizes greater than 30. In order to reduce the time required to solve large instances, we present an Ant Colony Optimization algorithm called m-Dimensional Relative Ant Colo...
Main Authors: | Vulakh, David (Author), Finkel, Raphael (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg,
2022-04-04T12:36:20Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Ant Colony Optimization for Identical Parallel Machine Scheduling problem
by: Jou-Chun Chen, et al.
Published: (2005) -
Antioxidant Activity of Daemonorops draco Resin
by: Sri Purwanti, et al.
Published: (2019-09-01) -
The constituents from Daemonorops draco and their bioactivities
by: Wen-KeDu, et al.
Published: (2015) -
Ant Colony Optimization for Multi-Objective Parallel Machine Scheduling Problem
by: Yu-Ming Hsiao, et al.
Published: (2006) -
The Design and Implementation of Parallel Ant Colony Optimization
by: Tung-Yeh Wu, et al.
Published: (2004)