Volume 18, Issue 1 (3-2021)
jor 2021, 18(1): 1-19 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Khanduzi R, Maleki H R. Modeling a Multi-Objective Defensive Location Problem with Manufacturing Cost and Capacity and Solving by an Efficient Cuckoo Search Algorithm. jor 2021; 18 (1) :1-19
URL: http://jamlu.liau.ac.ir/article-1-1627-en.html
URL: http://jamlu.liau.ac.ir/article-1-1627-en.html
Department of Mathematics and Statistics, Gonbad Kavous University, Golestan, Gonbad Kavous, Iran , khanduzi@gonbad.ac.ir
Abstract: (2393 Views)
This paper seeks to present a new multi-objective defensive location problem (MDLP) with the manufacturing cost and considering different capacities for facilities in a network. In the novel MDLP, to prevent the attacker from reaching strategic sites (cores), the defender locates various facilities in the vertices of the network. In this regard, a mixed integer programming is formulated to find the Stackelberg solutions that defender and attacker are the upper and lower-level decision makers, respectively. In this study, the goal of defensive strategy is to maximize the distance between the cores and the attacker, which aims at reaching the closest possible vertices to the cores. On the other hand, since the problem is an NP-hard problem, to find a satisfactory solution, an interactive fuzzy method based on the cuckoo search algorithm has been introduced. The application of the method is illustrated solving two random instances of MDLP.
Keywords: Defensive Location Problem, Stackelberg Equilibrium, Mixed Integer Programming, Cuckoo Search Algorithm.
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
