#### Filter Results:

- Full text PDF available (66)

#### Publication Year

1999

2017

- This year (2)
- Last 5 years (28)
- Last 10 years (62)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Christian Blum, Andrea Roli
- ACM Comput. Surv.
- 2003

The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the… (More)

- Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
- Appl. Soft Comput.
- 2011

Research inmetaheuristics for combinatorial optimizationproblemshas lately experienced anoteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus of research has changed from being rather algorithm-oriented to being more problemoriented. Nowadays the focus is on solving the problem at… (More)

Ant Colony Optimization (ACO) [2] is a recently proposed metaheuristic approach for solving hard combinatorial optimization problems. The inspiring source of ACO is the foraging behavior of real ants. In most ACO implementations the hyperspace for the pheromone values used by the ants to build solutions is only implicitly limited. In this paper we propose a… (More)

- Michela Milano, Andrea Roli
- IEEE Trans. Systems, Man, and Cybernetics, Part B
- 2004

In this work, we introduce a multiagent architecture called the MultiAGent Metaheuristic Architecture (MAGMA) conceived as a conceptual and practical framework for metaheuristic algorithms. Metaheuristics can be seen as the result of the interaction among different kinds of agents: The basic architecture contains three levels, each hosting one or more… (More)

- Christian Blum, Andrea Roli
- Hybrid Metaheuristics
- 2008

A CSP is formally defined as a triple (X,D,C), where X = {x1, . . . , xn} is the set of variables, D = {D1, . . . , Dn} is the set of domains which define the values a variable can assume and C = {C1, . . . , Cm} is the set of constraints among the variables. The CSP is a decision problem: a solution of the problem is a complete assignment which satisfies… (More)

The Portfolio selection problem is a relevant problem arising in finance and economics. Some practical formulations of the problem include various kinds of nonlinear constraints and objectives and can be efficiently solved by approximate algorithms. Among the most effective approximate algorithms, are metaheuristic methods that have been proved to be very… (More)

- Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf
- CPAIOR
- 2007

Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its more practical and realistic variants, which include various kinds of constraints and objectives, have in many cases to be tackled by approximate algorithms. In this work, we present… (More)

- Andrea Roli, Michela Milano
- AI*IA
- 1999

$EVWUDFW. In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of… (More)

- Franco Zambonelli, Marco Mamei, Andrea Roli
- SELMAS
- 2002

This paper describes the behavior observed in a class of cellular automata that we have defined as “dissipative”, i.e., cellular automata for which the external environment can somehow inject “energy” to dynamically influence the evolution of the automata. In this class of cellular automata, we have observed that stable macro-level global structures emerge… (More)