Negative Learning Ant Colony Optimization for MaxSAT
Abstract Recently, a new negative learning variant of ant colony optimization (ACO) has been used to successfully tackle a range of combinatorial optimization problems. For providing stronger evidence of the general applicability of negative learning ACO, we investigate how it can be adapted to solv...
Main Authors: | Teddy Nurcahyadi, Christian Blum, Felip Manyà |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2022-08-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://doi.org/10.1007/s44196-022-00120-6 |
Similar Items
-
Clausal Forms in MaxSAT and MinSAT
by: Chu Min Li, et al.
Published: (2022-11-01) -
Dynamic Initial Weight Assignment for MaxSAT
by: Abdelraouf Ishtaiwi, et al.
Published: (2021-03-01) -
Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study
by: Teddy Nurcahyadi, et al.
Published: (2021-02-01) -
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT
by: Zaijun Zhang, et al.
Published: (2022-12-01) -
Fixed fleet open vehicle routing problem: Mathematical model and a modified ant colony optimization
by: Majid Yousefikhoshbakht, et al.
Published: (2023-11-01)