Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preferencebased sear...
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...