— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...