Fuel Distribution Problem (FDP) is a combinatorial optimization task closely related but not identical to the Capacitated Vehicle Routing Problem (CVRP), and can also be seen as a variant of the classical Multiple Container Packing Problem. The differences between FDP and CVRP are simple but crucial, because affect both on the optimization strategy and on the design of the instances. A memetic immune algorithm is presented based on DFS algorithm and local search operator. The results show that presented algorithm seems to be efficient, in order to quality and homogeneity of solutions.
A Memetic Clonal Selection Algorithm for a Combinatorial Optimization Problem
PAVONE, MARIO FRANCESCO;
2010-01-01
Abstract
Fuel Distribution Problem (FDP) is a combinatorial optimization task closely related but not identical to the Capacitated Vehicle Routing Problem (CVRP), and can also be seen as a variant of the classical Multiple Container Packing Problem. The differences between FDP and CVRP are simple but crucial, because affect both on the optimization strategy and on the design of the instances. A memetic immune algorithm is presented based on DFS algorithm and local search operator. The results show that presented algorithm seems to be efficient, in order to quality and homogeneity of solutions.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
