We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

In this Brief Report, we investigate the collective synchronization of a system of coupled oscillators on a Barabási-Albert scale-free network. We propose an approach of structural perturbations aiming at those nodes with maximal betweenness. This method can markedly enhance the network synchronizability, and is easy to realize. The simulation results show that the eigenratio will sharply decre...

in this paper smart operation of micro energy hub is presented. energy hub system consists of certain energy hubs and interconnectors that are coordinated by energy hub system operator. an energy hub contains several converters and storages to serve demanded services in most efficient manner from available energy carriers. in this paper, the flexibility of energy delivery point is enhanced u...

the rings considered in this article are commutative with identity $1neq 0$. by a proper ideal of a ring $r$,  we mean an ideal $i$ of $r$ such that $ineq r$.  we say that a proper ideal $i$ of a ring $r$ is a  maximal non-prime ideal if $i$ is not a prime ideal of $r$ but any proper ideal $a$ of $r$ with $ isubseteq a$ and $ineq a$ is a prime ideal. that is, among all the proper ideals of $r$,...

We classify, up to isomorphism, maximal curves covered by the Hermit-ian curve H by a prime degree Galois covering. We also compute the genus of maximal curves obtained by the quotient of H by several automorphisms groups. Finally we discuss the value for the third largest genus that a maximal curve can have.

In this article, a new genetic algorithm (GA), called the Nash equilibrium sorting (NESGA,) is introduced to identify equilibria for competitive maximal covering location problem with two and three competitors, which combinatorial game theory where it computationally intractable enumerate all decision options of competitors. Although GAs are widely used in optimization, their applications non-c...