A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop
The goal of Machine Learning to automatically learn from data, extract knowledge and to
make decisions without any human intervention. Such automatic (aML) approaches show …
make decisions without any human intervention. Such automatic (aML) approaches show …
The linear ordering problem revisited
Abstract The Linear Ordering Problem is a popular combinatorial optimisation problem
which has been extensively addressed in the literature. However, in spite of its popularity …
which has been extensively addressed in the literature. However, in spite of its popularity …
Using pairwise precedences for solving the linear ordering problem
V Santucci, J Ceberio - Applied Soft Computing, 2020 - Elsevier
It is an old claim that, in order to design a (meta) heuristic algorithm for solving a given
optimization problem, algorithm designers need first to gain a deep insight into the structure …
optimization problem, algorithm designers need first to gain a deep insight into the structure …
[图书][B] Advances in bio-inspired computing for combinatorial optimization problems
CM Pintea - 2014 - Springer
” Advances in Bio-inspired Combinatorial Optimization Problems” illustrates several recent
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
A new precedence-based ant colony optimization for permutation problems
In this paper we introduce ACOP, a novel ACO algorithm for solving permutation based
optimization problems. The main novelty is in how ACOP ants construct a permutation by …
optimization problems. The main novelty is in how ACOP ants construct a permutation by …
Extending distance-based ranking models in estimation of distribution algorithms
Recently, probability models on rankings have been proposed in the field of estimation of
distribution algorithms in order to solve permutation-based combinatorial optimisation …
distribution algorithms in order to solve permutation-based combinatorial optimisation …
Secure traveling salesman problem with intelligent transport systems features
Meeting the security requests in transportation is nowadays a must. The intelligent transport
systems (ITSs) represent the support for addressing such a challenge, due to their ability to …
systems (ITSs) represent the support for addressing such a challenge, due to their ability to …
A hybrid algorithm based on particle swarm optimization and ant colony optimization algorithm
Particle swarm optimization (PSO) and Ant Colony Optimization (ACO) are two important
methods of stochastic global optimization. PSO has fast global search capability with fast …
methods of stochastic global optimization. PSO has fast global search capability with fast …
Hybrid heuristics for the linear ordering problem
The linear ordering problem (LOP) is one of the classical NP-Hard combinatorial
optimization problems. Motivated by the difficulty of solving it up to optimality, in recent …
optimization problems. Motivated by the difficulty of solving it up to optimality, in recent …
Multi-agents features on Android platforms
The current paper shows the multi-agents capabilities for valid and flexible applications
when using a framework. Agent-based functions were used within JADE framework for an …
when using a framework. Agent-based functions were used within JADE framework for an …