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

Displaying 621 – 640 of 1558

Showing per page

Extension of reverse elimination method through a dynamic management of the tabu list

Saïd Hanafi, Arnaud Fréville (2001)

RAIRO - Operations Research - Recherche Opérationnelle

The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called...

Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List

Saïd Hanafi, Arnaud Fréville (2010)

RAIRO - Operations Research

The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called...

Extension of stochastic dominance theory to random variables

Chi-Kwong Li, Wing-Keung Wong (2010)

RAIRO - Operations Research

In this paper, we develop some stochastic dominance theorems for the location and scale family and linear combinations of random variables and for risk lovers as well as risk averters that extend results in Hadar and Russell (1971) and Tesfatsion (1976). The results are discussed and applied to decision-making.

Fast approximation of minimum multicast congestion – Implementation versus theory

Andreas Baltz, Anand Srivastav (2004)

RAIRO - Operations Research - Recherche Opérationnelle

The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known N P -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r ( 1 + ε ) ( r t e x t O P T + exp ( 1 ) ln m ) -approximation can be computed in O ( k m ε - 2 ln k ln m ) time, where β bounds the time for computing an r -approximate minimum Steiner tree. Moreover, we present a new fast heuristic that...

Fast approximation of minimum multicast congestion – Implementation VERSUS Theory

Andreas Baltz, Anand Srivastav (2010)

RAIRO - Operations Research

The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT + exp(1)lnm)-approximation can be computed in O(kmε-2lnklnm) time, where β bounds the time for computing an r-approximate minimum Steiner tree. Moreover,...

Fast simulation for road traffic network

Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2001)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.

Fast simulation for Road Traffic Network

Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2010)

RAIRO - Operations Research

In this paper we present a method to perform fast simulation of large Markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.

Fault diagnosis of networked control systems

Christophe Aubrun, Dominique Sauter, Joseph Yamé (2008)

International Journal of Applied Mathematics and Computer Science

Networked Control Systems (NCSs) deal with feedback control systems with loops closed via data communication networks. Control over a network has many advantages compared with traditionally controlled systems, such as a lower implementation cost, reduced wiring, simpler installation and maintenance and higher reliability. Nevertheless, the networkinduced delay, packet dropout, asynchronous behavior and other specificities of networks will degrade the performance of closed-loop systems. In this context,...

Finding target units in FDH model by least-distance measure model

Ali Ebrahimnejad, Reza Shahverdi, Farzad Rezaee Balf, Maryam Hatefi (2013)

Kybernetika

Recently, some authors used the Least-Distance Measure model in order to obtain the shortest distance between the evaluated Decision Making Unit (DMU) and the strongly efficient production frontier. But, their model is not applicable for situation in which the production possibility set satisfies free disposability property. In this paper, we propose a new approach to this end in FDH model which improves the application potential of the Least-Distance Measure and overcomes the mentioned shortcoming....

Finite buffer GI/Geo/ 1 batch servicing queue with multiple working vacations

P. Vijaya Laxmi, Kanithi Jyothsna (2014)

RAIRO - Operations Research - Recherche Opérationnelle

This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “b”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based on the queue...

Currently displaying 621 – 640 of 1558