Abstract A discrete fracture network (DFN) model based on non-parametric kernel density estimators (KDE) and directional-linear statistics is developed. The provides a characterization of the with distributions orientation size jointly. solution to Bertrand paradox used for calculation disk sizes from trace lengths, latter calculated intersection disks highwall faces by triangulation. Poisson p...

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...

In this paper, we study WSN design, as a multi-objective optimization problem using GA technique. We study the effects of GA parameters including population size, selection and crossover method and mutation probability on the design. Choosing suitable parameters is a trade-off between different network criteria and characteristics. Type of deployment, effect of network size, radio communication...

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

The optimal locating of facilities has large effects on economic benefits, providing satisfactory service and levels of customer satisfaction. One of the new topics discussed in location problems is hub location and hub facilities are subject to unpredictable disruptions. This paper proposes a nonlinear integer model for reliable single allocation hub location problem that considers backup hub,...