A queuing location-allocation model for a capacitated health care system

International audienceThe aim of the present paper is to propose a location-allocation model for a capacitated health care system. This paper develops a discrete modeling framework to determine the optimal number of facilities among candidates and optimal allocations of the existing customers to operating health centers in a coverage distance. In doing so, the total sum of customer and operating facility costs is minimized. Our goal is to create a model that is more practical in the real world. Therefore, setup costs of hospitals are based on the costs of customers, xed costs of establishing health centers, and costs based on the available resources in each level of hospitals. In this paper, the idea of hierarchical structure has been used. There are two levels of service in hospitals, including low and high levels, and sections at diierent levels that provide diierent types of services. The patients refer to diierent sections of the hospital according to their requirements. To solve the model, two meta-heuristic algorithms, including genetic and simulated annealing algorithms and their combination, are proposed. To evaluate the performance of the three algorithms, some numerical examples are produced and analyzed using the statistical test in order to determine which algorithm works better

Data Analytic Approach to Support the Activation of Special Signal Timing Plans in Response to Congestion

Improving arterial network performance has become a major challenge that is significantly influenced by signal timing control. In recent years, transportation agencies have begun focusing on Active Arterial Management Program (AAM) strategies to manage the performance of arterial streets under the flagship of Transportation Systems Management & Operations (TSM&O) initiatives. The activation of special traffic signal plans during non-recurrent events is an essential component of AAM and can provide significant benefits in managing congestion. Events such as surges in demands or lane blockages can create queue spillbacks, even during off-peak periods resulting in delays and spillbacks to upstream intersections. To address this issue, some transportation agencies have started implementing processes to change the signal timing in real time based on traffic signal engineer/expert observations of incident and traffic conditions at the intersections upstream and downstream of congested locations. This dissertation develops methods to automate and enhance such decisions made at traffic management centers. First, a method is developed to learn from experts’ decisions by utilizing a combination of Recursive Partitioning and Regression Decision Tree (RPART) and Fuzzy Rule-Based System (FRBS) to deal with the vagueness and uncertainty of human decisions. This study demonstrates the effectiveness of this method in selecting plans to reduce congestion during non-recurrent events. However, the method can only recommend the changes in green time to the movement affected by the incident and does not give an optimized solution that considers all movements. Thus, there was a need to extend the method to decide how the reduction of green times should be distributed to other movements at the intersection. Considering the above, this dissertation further develops a method to derive optimized signal timing plans during non-recurrent congestion that considers the operations of the critical direction impacted by the incident, the overall corridor, as well as the critical intersection movement performance. The prerequisite of optimizing the signal plans is the accurate measurements of traffic flow conditions and turning movement counts. It is also important to calibrate any utilized simulation and optimization models to replicate the field traffic states according to field traffic conditions and local driver behaviors. This study evaluates the identified special signal-timing plan based on both the optimization and the DT and FRBS approaches. Although the DT and FRBS model outputs are able to reduce the existing queue and improve all other performance measures, the evaluation results show that the special signal timing plan obtained from the optimization method produced better performance compared to the DT and FRBS approaches for all of the evaluated non-recurrent conditions. However, there are opportunities to combine both approaches for the best selection of signal plans

A bi-level model of dynamic traffic signal control with continuum approximation

This paper proposes a bi-level model for traffic network signal control, which is formulated as a dynamic Stackelberg game and solved as a mathematical program with equilibrium constraints (MPEC). The lower-level problem is a dynamic user equilibrium (DUE) with embedded dynamic network loading (DNL) sub-problem based on the LWR model (Lighthill and Whitham, 1955; Richards, 1956). The upper-level decision variables are (time-varying) signal green splits with the objective of minimizing network-wide travel cost. Unlike most existing literature which mainly use an on-and-off (binary) representation of the signal controls, we employ a continuum signal model recently proposed and analyzed in Han et al. (2014), which aims at describing and predicting the aggregate behavior that exists at signalized intersections without relying on distinct signal phases. Advantages of this continuum signal model include fewer integer variables, less restrictive constraints on the time steps, and higher decision resolution. It simplifies the modeling representation of large-scale urban traffic networks with the benefit of improved computational efficiency in simulation or optimization. We present, for the LWR-based DNL model that explicitly captures vehicle spillback, an in-depth study on the implementation of the continuum signal model, as its approximation accuracy depends on a number of factors and may deteriorate greatly under certain conditions. The proposed MPEC is solved on two test networks with three metaheuristic methods. Parallel computing is employed to significantly accelerate the solution procedure

Optimized reduction approach of congestion in mobile ad hoc network based on Lagrange multiplier

Over the past decades, computer networks have experienced an outbreak and with that came severe congestion problems. Congestion is a crucial determinant in the delivery of delay-sensitive applications (voice and video) and the quality of the network. in this paper, the Lagrangian optimization rate, delay, packet loss, and congestion approach (LORDPC) are presented. A congestion avoidance routing method for device-to-device (D2D) nodes in an ad hoc network that addresses the traffic intensity problem. The method of Lagrange multipliers is utilized for active route election to dodge heavy traffic links. To demonstrate the effectiveness of our proposed method, we applied extensive simulation that presents path discovery and selection. Results show that LORDPC decreases delay and traffic intensity while maintaining a high bitrate and low packet loss rate and it outperformed the ad hoc on-demand distance vector (AODV) protocol and the Lagrangian optimization rate, delay, and packet loss, approach (LORDP)

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing framework. We formulate this model with two perspectives simultaneously: (i) customers and (ii) service provider. The objectives of the model are to minimize (i) the total expected travelling and waiting time and (ii) the average facility idle-time. This model represents a mixed-integer nonlinear programming problem which belongs to the class of NP-hard problems. In addition, to solve the model, two metaheuristic algorithms including non-dominated sorting genetic algorithms (NSGA-II) and non-dominated ranking genetic algorithms (NRGA) are proposed. Besides, to evaluate the performance of the two algorithms some numerical examples are roduced and analyzed with some metrics to determine which algorithm works better

The Capacitated Location-Allocation Problem with Interval Parameters

In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be reduced to the p-median problem in polynomial time so it is NP-Hard. A genetic algorithm is proposed to solve the developed model and experimental results of solving the model are presented