Abstract An energy-efficient Wireless Sensor Network (WSN) design often requires the
decision of optimal locations (deployment) and power assignments of the sensors to be …

The paper herein presents green p‐median problem (GMP) which uses the adaptive type‐2
neural network for the processing of environmental and sociological parameters including …

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p
medians considering distances and capacities for the services to be given by each median …

The capacitated p-median problem is a well-known location-allocation problem that is NP-
hard. We proposed an advanced Genetic Algorithm (GA) integrated with an Initial Solution …

In this paper, we evaluate the applicability of genetic programming (GP) for the evolution of
distributed algorithms. We carry out a large-scale experimental study in which we tackle …

This study proposes a genetic algorithm based method integrating the minimal paths and
the recursive sum of disjoint products to find maximal network reliability with optimal …

This paper addresses the application of two different grouping-based algorithms to the so-
called capacitated P-median problem (CPMP). The CPMP is an NP-complete problem, well …

In the real world, a computer/communication system is usually modeled as a capacitated-
flow network since each transmission line (resp. facility) denoted by an edge (resp. node) …

In this paper we present a novel grouping harmony search algorithm for the Access Node
Location Problem (ANLP) with different types of concentrators. The ANLP is a NP-hard …

In Open Radio Access Network (O-RAN), intelligent techniques are urged to achieve the
automation of the computing resource allocation, so as to save computing resources and …