All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 21 Next

Displaying 401 – 420 of 612

Showing per page

Advances in parallel heterogeneous genetic algorithms for continuous optimization

Enrique Alba, Francisco Luna, Antonio Nebro (2004)

International Journal of Applied Mathematics and Computer Science

In this paper we address an extension of a very efficient genetic algorithm (GA) known as Hy3, a physical parallelization of the gradual distributed real-coded GA (GD-RCGA). This search model relies on a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimization by using crossover operators tuned to explore and exploit the solutions inside each...

Affectation de véhicules aux routes dans un système de transport multi-école.

Ana M. Cobes, Albert Corominas (1990)

Qüestiió

Este artículo describe una parte del sistema TRESCA para la organización del transporte escolar en Andorra. Una vez determinadas las rutas a ofrecer, conviene asignarles los vehículos para minimizar los costes. El algoritmo que se ha concebido establece las secuencias de rutas de acuerdo con el modelo de Orloff, con una programación lineal entera y con un subalgoritmo glotón.

Agrégation des similarités : une solution oubliée

Michel Petitjean (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Le problème de l’agrégation des similarités signées est résolu à l’aide d’une version dérivant de l’algorithme booléen de Faure et Malgrange. La méthode s’applique à des similarités entières ou réelles, et permet l’énumération des solutions multiples. Elle nécessite une quantité de mémoire égale à trois fois la taille des données d’entrée.

Agrégation des similarités : une solution oubliée

Michel Petitjean (2010)

RAIRO - Operations Research

The signed similarities aggregation problem is solved with a boolean method derived from the Faure and Malgrange algorithm. The method is adequate either for integer similarities or real similarites, and multiple solutions can be enumerated. It needs a space amount equal to three times the input data size.

Airspace sectorization with constraints

Huy Trandac, Philippe Baptiste, Vu Duong (2005)

RAIRO - Operations Research - Recherche Opérationnelle

We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...

Airspace sectorization with constraints

Huy Trandac, Philippe Baptiste, Vu Duong (2010)

RAIRO - Operations Research

We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...

Algorithm for turnpike policies in the dynamic lot size model

Stanisław Bylka (1996)

Applicationes Mathematicae

This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine...

Currently displaying 401 – 420 of 612