In this work a discrete and a dynamic model for evaluating the reliability of telecommunication networks, are defined, in the case where the set of terminals K is arbitrary. Three methods are presented. The first one is exact type called generalized method of Ahmad, while the two others are approximate and simulation-based type. The three methods are compared by an application to the Bejaia di...

The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today’s complex and ever changing networks, network operators need to plan their networks very accurately and rapidly. Sacrificing accuracy generally has severe impacts on the scalability and maintainability of the network at a later stage. A ...

Introduction At a time when radio spectrum is a highly valued commodity and where environmental issues are high on the agenda of local planning authorities, it has become vital for network planners to determine the optimum network design to satisfy these demands. Accurately predicting propagation in highly cluttered environments, where local effects are dominant, is not a simple task. Using a m...

This paper presents two automatic cellular network design algorithms which determine the favourable positions of transmitters with respect to co-channel interference (CCI). The proposed methods are capable of maximizing the average CCI ratio in the planning region while optimizing the covered teletraac demand. Additionally, we investigate how the proposed algorithms can be extended for locating...

Narrative generation represents an application domain for AI planning where plan quality is related to properties such as shape of plan trajectory. In our work we have developed a plan-based approach to narrative generation that uses character relationships as a key determinant in controlling plan shape (relationships are key in genres such as serial dramas and soaps). Our approach is implement...

Immense levels of data and the complexity of current logistics networks have made software support indispensable. Recurring calculations in network design and transportation planning can be automated with the help of planning software. Furthermore sophisticated algorithms are available to improve planning performance and reduce planning efforts. After a brief introduction of requirements in log...

Based on the theory of complex network, this paper focuses on the planning of logistics nodes for strategic supply chain. I propose a practical mathematical modeling framework that simultaneously captures many practical aspects but still understated in the existing literatures of network planning problems. Moreover, capacity expansion and reduction scenarios are also analyzed as well as modular...

Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) d ecomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks. networks are required to be totally ordered, and (3) whe...

Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, lines adequacy rate has not been considered at the end of ...

Radio network planning for UMTS technology is a relevant task for operators in the current roll-out phase. We recall a mathematical mixed-integer programming model for planning cost-efficient radio networks under network quality constraints. Based on this model, we present network planning methods. Computational results are given for two large-scale, realistic scenarios, and we compare the mixe...