|
|
|
 |
Search published articles |
 |
|
Showing 3 results for Location-Allocation
Moeen Moghadas, Taghizadeh Kakhki,
Volume 2, Issue 2 (6-2011)
Abstract
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing centers and locating servers should not exceed a predetermined amount. We present a mathematical model for the problem, and propose a heuristic solution procedure with two local search algorithms for improving the solutions. Finally, some computational results are presented.
Dr. M. Fallah, Dr. Amir Mohajeri, Mr. Mahdi Jamshidi,
Volume 8, Issue 1 (4-2017)
Abstract
A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as maximum allowable electrical flow in cables, permitted length of cables, maximum permitted voltage drops, and balance of load. The relationship between rates of electric current and cable sizes with consideration of constraints such as voltage drops and length are our essential data. To create a network with a minimum number of arcs and no closed loop such that all the nodes are covered, a minimum spanning tree technique is utilized. Here, we solve the problem using a genetic optimization algorithm and apply the offered approach to a real problem. By comparing the two extracted results from the proposed approach and an exact method, effectiveness of the genetic algorithm for optimization of power distribution network is shown. To demonstrate the validity of the offered model, a case study in Tehran power distribution company in Iran is made.
Mrs. Beheshteh Moghadas Poor, Mrs. Fatemeh Sabouhi, Dr. Ali Bozorgi-Amiri, Dr. Mohammad Saeed Jabalameli,
Volume 10, Issue 1 (7-2019)
Abstract
Nowadays, due to population increase and expansion of the transportation networks, the monitoring of this network, control, and prevention of accidents and crimes are very important. The main tasks of traffic patrols, like other emergency-security facilities, are the monitoring and prevention of crime as well as handling and fining in the case of committing crimes. Traffic patrols should be present in the scene and also in high traffic congestion, to reduce accidents and crimes. This paper presents a bi-objective and stochastic optimization model to design an emergency-security system. This network includes traffic patrol vehicles and manpower in patrol vehicles. The objective of the proposed model is to maximize the number of vehicles passing through patrols and minimize the costs according to different scenarios. To solve the model, the epsilon-constraint method is used which simultaneously determines the location of the patrols, allocation of demand points to patrols, and determining the number of existing manpower in patrols. To evaluate and analyze the proposed model, a numerical example is used.
|
|
