Advances in modelling of complex systems : preface to the special issue
Advances in Modelling of Complex Systems : Preface to the Special Issue
Advances in parallel heterogeneous genetic algorithms for continuous optimization
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.
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.
Affectation séquentielle de nouvelles machines
Aggregation for Quality Management
Aggregation of networks
Agrégation des similarités : une solution oubliée
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
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.
Airline Seat Management With Round-Trip Requests
Airspace sectorization with constraints
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
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...
Algebraic solution to box-constrained bi-criteria problem of rating alternatives through pairwise comparisons
We consider a decision-making problem to evaluate absolute ratings of alternatives that are compared in pairs according to two criteria, subject to box constraints on the ratings. The problem is formulated as the log-Chebyshev approximation of two pairwise comparison matrices by a common consistent matrix (a symmetrically reciprocal matrix of unit rank), to minimize the approximation errors for both matrices simultaneously. We rearrange the approximation problem as a constrained bi-objective optimization...
Algèbre linéaire et cheminement dans un graphe
Algorithm 14. Initial solution to the zero-one integer linear programming problem
Algorithm. 44. MIMUN. Optimization of one-dimensional multimodal functions in the presence of noise
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 49. An algorithm for solving the machine sequencing problem
Algorithm 5. Solution of the transportation problem by bridges dual labeling method
Algorithm 51. Solution of linear programming problems in zero-one variables