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 2 Next

Displaying 21 – 40 of 194

Showing per page

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

Asignación de recursos Max-Min: propiedades y algoritmos.

Amparo Mármol Conde, Blas Pelegrín Pelegrín (1991)

Trabajos de Investigación Operativa

Este trabajo trata el problema de asignación de recursos cuando el objetivo es maximizar la mínima recompensa y las funciones recompensa son continuas y estrictamente crecientes. Se estudian diferentes propiedades que conducen a algoritmos que permiten de forma eficiente la resolución de gran variedad de problemas de esta naturaleza, tanto con variables continuas como discretas.

Belief functions induced by multimodal probability density functions, an application to the search and rescue problem

P.-E. Doré, A. Martin, I. Abi-Zeid, A.-L. Jousselme, P. Maupin (2010)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...

Belief functions induced by multimodal probability density functions, an application to the search and rescue problem

P.-E. Doré, A. Martin, I. Abi-Zeid, A.-L. Jousselme, P. Maupin (2011)

RAIRO - Operations Research

In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...

Binary integer programming solution for troubleshooting with dependent actions

Václav Lín (2017)

Kybernetika

We deal with a sequencing problem that arises when there are multiple repair actions available to fix a broken man-made system and the true cause of the system failure is uncertain. The system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting actions designed to identify the cause of the malfunction and fix the system. The task is to find a course of repair with minimal expected cost. We propose a binary integer programming formulation for...

Centralized VERSUS decentralized production planning

Georgios K. Saharidis, Yves Dallery, Fikri Karaesmen (2006)

RAIRO - Operations Research

In the course of globalization, many enterprises change their strategies and are coupled in partnerships with suppliers, subcontractors and customers. This coupling forms supply chains comprising several geographically distributed production facilities. Production planning in a supply chain is a complicated and difficult task, as it has to be optimal both for the local manufacturing units and for the whole supply chain network. In this paper two analytical models are used to solve the production planning...

Currently displaying 21 – 40 of 194