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

Displaying 81 – 100 of 113

Showing per page

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2008)

RAIRO - Operations Research - Recherche Opérationnelle

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2009)

RAIRO - Operations Research

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...

Timed Petri-net based formulation and an algorithm for the optimal scheduling of batch plants

Tianlong Gu, Parisa Bahri, Guoyong Cai (2003)

International Journal of Applied Mathematics and Computer Science

The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis of behavioural...

Towards optimal formwork pairing on construction sites

Thierry Benoist (2007)

RAIRO - Operations Research

Minimizing shutterings assembling time on construction sites can yield significant savings in labor costs and crane moves. It requires solving a pairing problem that optimizes the ability for the crane to move chains of shutterings as a whole when they can be later reused together to frame another wall of the site. In this paper, we show that this problem is NP-hard in the strong sense as well as both its multiflow and ordering aspects. We also introduce a linear relaxation that computes reasonably...

Traffic plans.

Marc Bernot, Vicent Caselles, Jean-Michel Morel (2005)

Publicacions Matemàtiques

In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...

Transportation flow problems with Radon measure variables

Marcus Wagner (2000)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

For a multidimensional control problem ( P ) K involving controls u ∈ L ∞ , we construct a dual problem ( D ) K in which the variables ν to be paired with u are taken from the measure space rca (Ω,) instead of ( L ∞ ) * . For this purpose, we add to ( P ) K a Baire class restriction for the representatives of the controls u. As main results, we prove a strong duality theorem and saddle-point conditions.

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)

RAIRO - Operations Research

In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)

RAIRO - Operations Research

In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...

Currently displaying 81 – 100 of 113