Displaying similar documents to “Genetic and Tabu search algorithms for peptide assembly problem”

Experiments with variants of ant algorithms.

Thomas Stützle, Sebastian Linke (2002)

Mathware and Soft Computing

Similarity:

A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...

MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization

Thibaut Lust, Jacques Teghem (2008)

RAIRO - Operations Research

Similarity:

We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the first parent. A local search is then applied to the offspring. We experiment this scheme with...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

Similarity:

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

Similarity:

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical...