Displaying similar documents to “A discrete-time approximation technique for the time-cost trade-off in PERT networks ”

On heuristic optimization.

Ciobanu, Camelia, Marin Gheorghe (2001)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Similarity:

Optimization of touristic distribution networks using genetic algorithms.

Josep R. Medina, Víctor Yepes (2003)

SORT

Similarity:

The eight basic elements to design genetic algorithms (GA) are described and applied to solve a low demand distribution problem of passengers for a hub airport in Alicante and 30 touristic destinations in Northern Africa and Western Europe. The flexibility of GA and the possibility of creating mutually beneficial feed-back processes with human intelligence to solve complex problems as well as the difficulties in detecting erroneous codes embedded in the software are described. A new...

A new schedule generation scheme for resource-constrained project scheduling

Cyril Briand (2009)

RAIRO - Operations Research

Similarity:

In this paper, a new schedule generation scheme for resource-constrained project scheduling problems is proposed. Given a project scheduling problem and a priority rule, a schedule generation scheme determines a single feasible solution by inserting one by one each activity, according to their priority, inside a partial schedule. The paper proposes a generation scheme that differs from the classic ones in the fact that it allows to consider the activities in any order, whether their...

Neural networks learning as a multiobjective optimal control problem.

Maciej Krawczak (1997)

Mathware and Soft Computing

Similarity:

The supervised learning process of multilayer feedforward neural networks can be considered as a class of multi-objective, multi-stage optimal control problem. An iterative parametric minimax method is proposed in which the original optimization problem is embedded into a weighted minimax formulation. The resulting auxiliary parametric optimization problems at the lower level have simple structures that are readily tackled by efficient solution methods, such as the dynamic programming...

The Variance Location Problem on a Network with Continuously distributed demand

Ma Cruz López de los Mozos, Juan A. Mesa (2010)

RAIRO - Operations Research

Similarity:

Most location problems on networks consider discrete nodal demand. However, for many problems, demands are better represented by continuous functions along the edges, in addition to nodal demands. Several papers consider the optimal location problem of one or more facilities when demands are continuously distributed along the network, and the objective function dealt with is the median one. Nevertheless, in location of public services it is desirable to use an equity criterion. One...