Displaying similar documents to “Resource allocation in a mobile telephone network : a constructive repair algorithm”

Resource allocation in a mobile telephone network: A constructive repair algorithm

Patrice Boizumault, Philippe David, Housni Djellab (2010)

RAIRO - Operations Research

Similarity:

To cope with its development, a French operator of mobile telephone network must periodically plan the purchase and the installation of new hardware, in such a way that a hierarchy of constraints (required and preferred) is satisfied. This paper presents the “constructive repair” method we used to solve this problem within the allowed computing time (1 min). This method repairs the planning during its construction. A sequence of repair procedures is defined: if a given repair cannot...

A hybrid approach for scheduling transportation networks

Mahjoub Dridi, Imed Kacem (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical...

MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

Nabil Absi, Safia Kedad-Sidhoum (2007)

RAIRO - Operations Research

Similarity:

We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons...