|
|
|
 |
Search published articles |
 |
|
Showing 3 results for Heuristic Algorithm
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.
Mr. Mirmohammad Musavi, Dr. Reza Tavakkoli-Moghaddam, Ms. Farnaz Rayat, Volume 8, Issue 1 (4-2017)
Abstract
We present a bi-objective model for a green truck scheduling and routing problem at a cross-docking system. This model determines three key decisions at the cross dock: (1) defining a sequence and schedule of inbound trucks at the receiving door, (2) specifying a sequence and a schedule of outbound trucks at the shipping door, and (3) determining the routes of the outbound truck while serving customers. The first objective function is related to responsiveness of the network that minimizes time window violations and the second objective function minimizes total fuel consumption of trucks in order to consider the environmental factor of the network. Also, a learning effect is considered in loading and unloading process times. To solve the bi-objective model, an archived multi-objective simulated annealing (AMOSA) is used and modified. Finally, a number of test problems are solved and the efficiency of the proposed AMOSA is compared with the e-constraint method.
Mr. Amir Rahimi, Dr. Amir Hossein Azadnia, Dr. Mohammad Molani Aghdam, Dr. Fatemeh Harsej, Volume 12, Issue 1 (6-2021)
Abstract
Health care facility systems are hierarchical as they consist of facilities at different levels such as clinics, health centers, and hospitals. Therefore, finding a proper location for the health care system can be categorized as a hierarchical location problem. Besides, partitioning a given region in a geographical area into different zones is very crucial to make sure the health services are available at their highest possible level for everyone in that region. In this study, an optimization model for the integrated problem of hierarchical location and partitioning under uncertainty in the Iranian healthcare system is proposed. The objective function of this model maximizes the total social utility of districts while workload balance and distance limitation between the zones are considered as the main constraints. Since this study involves NP-hard problems, three metaheuristic algorithms, including Genetic, Salp Swarm Algorithm (SSA), and Grey Wolf Optimizer (GWO) were developed. The numerical results suggest that the Grey Wolf Optimizer (GWO) algorithm indicates a more appropriate level of performance in almost all responses compared to the other algorithms. Therefore, the case study was solved by the Grey Wolf Optimizer (GWO). Based on the results, 10 distrcis with their zones are identified to maximize the overall utility. A sensitivity analysis also performed to show the behavior of the model. It can be stated that the findings of this study can be utilized as a useful management tool in other organizations.
|
|
|
|
|
|