The main aim of this paper is to propose a multi-waste mix integer lineal programming model for locating sorting facilities in a three-level (local, regional, and central) reverse logistic network. The objective of the model is to decide the location of the storage and sorting facilities across the network. The model was applied in end of life battery recycling network in Spain. As capacity is ...

With the increase in the number of mobile and distributed services throughout the Internet, locating nodes capable of initiating particular services, or those able to provide particular services or resources is becoming a critical issue. This paper presents a new architecture for service discovery and resource allocation. The architecture adopts a hierarchical tree structure for participating n...

An extension to models for the Maximal Covering Location Problem (MCLP) is applied to the Saudi Arabian Red Crescent Society (SARCS), Riyadh City, Saudi Arabia. The purpose is to identify the optimal locations of emergency medical service (EMS) stations. This is achieved by firstly locating these stations so the maximum expected demand may be reached within a pre-specified target time. Then, se...

Large disturbances in power systems often initiate complex interactions between continuous dynamics and discrete events. Such behaviour can be modeled in a systematic way by a set of differential-algebraic equations, modified to incorporate impulse (state reset) action and constraint switching. The paper presents a practical object-oriented approach to implementing the DAIS model. The systemati...

We study a problem of locating and estimating singularities of a signal measured with noise on a discrete set of points (fixed-design model). The signal consists of a smooth part with bounded first derivative and of finite number of singularities of the type (x ti)p±d¡■, 0 < p < j . The case p = 0 corresponds to a piecewise continuous function. The algorithm is based on convolving the data with...

This paper employs state similarity to improve reinforcement learning performance. This is achieved by first identifying states with similar sub-policies. Then, a tree is constructed to be used for locating common action sequences of states as derived from possible optimal policies. Such sequences are utilized for defining a similarity function between states, which is essential for reflecting ...

By analogy with Monte Carlo algorithms, we propose new strategies for design and redesign of small molecule libraries in high-throughput experimentation, or combinatorial chemistry. Several Monte Carlo methods are examined, including Metropolis, three types of biased schemes, and composite moves that include swapping or parallel tempering. Among them, the biased Monte Carlo schemes exhibit part...

In this paper, a new alignment method based on the particle swarm optimization (PSO) technique is presented. The PSO algorithm is used for locating the optimal coupling position with the highest optical power with three-degrees of freedom alignment. This algorithm gives an interesting results without a need to go thru the complex mathematical modeling of the alignment system. The proposed algor...

A novel paging scheme under delay bounds is proposed for personal communication systems. This paging scheme is independent of the location probability distributions of the mobile users and satisfies the delay bounds, while minimizing the amount of bandwidth used for locating a mobile user. The proposed paging scheme includes the optimal partition algorithm and paging procedure with respect to p...

The Medium-energy Electron Ion Collider (MEIC) is a proposed medium-energy, ring-ring, electron-ion collider based on CEBAF at Jefferson Lab. The collider luminosity and stability are sensitive to the choice of a working point – the betatron and synchrotron tunes of the two colliding beams. Therefore, a careful selection of the working point is essential for stable operation of the collider, as...