Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems
Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems. Those examples have a common feature of discrete design domain...
Main Authors: | Ali Ahmid, Thien-My Dao, Ngan Van Le |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-09-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/10/286 |
Similar Items
-
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
by: M. B. Dowlatshahi, et al.
Published: (2017-07-01) -
Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach
by: Hengki Tamando Sihotang
Published: (2021-12-01) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
by: Fadl Dahan, et al.
Published: (2019-04-01) -
Modification of Ant Colony Optimization Algorithm to Solve the Traveling Salesman Problem
by: Alda Larasati Anindya, et al.
Published: (2020-12-01) -
Negative Learning Ant Colony Optimization for MaxSAT
by: Teddy Nurcahyadi, et al.
Published: (2022-08-01)