The vehicle-routing problem (VRP) has many variants, including the most accurate models of real-life transportation tasks, making it one important mathematical problems in field logistics. Our goal was to design an algorithm that can race against recent solutions for VRP and capacitated (CVRP), while also being applicable with simulations real transports. is a variant bacterial memetic (BMA), w...

Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and the number of used colors k is minimized. This paper presents a memetic algorithm (denoted by MACOL) for solving the problem of graph coloring. The proposed MACOL algorithm integrates several distinguished features such ...

This paper presents and examines the behaviour of a system whereby the rules governing local search within a Memetic Algorithm are co-evolved alongside the problem representation. We describe the rationale for such a system, and the implementation of a simple version in which the evolving rules are encoded as (condition:action) patterns applied to the problem representation, and are e ectively ...

Differential evolution (DE) presents a class of evolutionary computing techniques that appear effective to handle real parameter optimization tasks in many practical applications. However, the performance of DE is not always perfect to ensure fast convergence to the global optimum. It can easily get stagnation resulting in low precision of acquired results or even failure. This paper proposes a...

This paper presents a highly effective memetic algorithm for the maximum diversity problem based on tabu search. The tabu search component uses a successive filter candidate list strategy and the solution combination component employs a combination operator based on identifying strongly determined and consistent variables. Computational experiments on three sets of 40 popular benchmark instance...

This paper deals with the construction of binary sequences with low autocorrelation, a very hard problem with many practical applications. The paper analyzes several metaheuristic approaches to tackle this kind of sequences. More specifically, the paper provides an analysis of different local search strategies, used as standalone techniques and embedded within memetic algorithms. One of our pro...

We introduce a novel evolutionary algorithm (EA) with a semantic network-based representation. For enabling this, we establish new formulations of EA variation operators, crossover and mutation, that we adapt to work on semantic networks. The algorithm employs commonsense reasoning to ensure all operations preserve the meaningfulness of the networks, using ConceptNet and WordNet knowledge bases...

In this paper, two types of tness landscapes of the graph bi-partitioning problem are analyzed, and a memetic algorithm { a genetic algorithm incorporating local search { that nds near-optimum solutions eeciently is presented. A search space analysis reveals that the tness landscapes of geometric and non-geometric random graphs diier significantly , and within each type of graph there are also ...