Displaying similar documents to “Optimal networks for mass transportation problems”

A Cooperative Sensor Network: Optimal Deployment and Functioning

Alfonso Farina, Antonio Graziano, Francesca Mariani, Francesco Zirilli (2011)

RAIRO - Operations Research

Similarity:

A network of mobile cooperative sensors is considered. The following problems are studied: (1) the “optimal" deployment of the sensors on a given territory; (2) the detection of local anomalies in the noisy data measured by the sensors. In absence of an information fusion center in the network, from “local" interactions between sensors “global" solutions of these problems are found.

Optimal Multiphase Transportation with prescribed momentum

Yann Brenier, Marjolaine Puel (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

A multiphase generalization of the Monge–Kantorovich optimal transportation problem is addressed. Existence of optimal solutions is established. The optimality equations are related to classical Electrodynamics.

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...

Forecast horizon and planning horizon paths in time-indexed network

Stanisław Bylka (2006)

Banach Center Publications

Similarity:

The problem of existence of a forecast (or planning) horizon has been considered in many special models, more or less precisely. We specify and investigate this problem for families of cheapest paths in networks with weakly ordered nodes. In a discrete network, the standard forward algorithm finds the subnetwork generated by optimal paths. The proposed forward procedure reduces subnetworks such that the forecast horizon remains unchanged. Based on the final subnetwork, we have an answer...

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...

A discrete-time approximation technique for the time-cost trade-off in PERT networks

Amir Azaron, Masatoshi Sakawa, Reza Tavakkoli-Moghaddam, Nima Safaei (2007)

RAIRO - Operations Research

Similarity:


We develop a discrete-time approximation technique dealing with the time-cost trade-off problem in PERT networks. It is assumed that the activity durations are independent random variables with generalized Erlang distributions, in which the mean duration of each activity is a non-increasing function of the amount of resource allocated to it. It is also assumed that the amount of resource allocated to each activity is controllable. Then, we construct an optimal control problem with...