A Mathematical Model to Interdict Illegal Product Flows in the Network under Uncertainty

Please enable javascript in your browser.

Asadi, Fatemeh | 2019

348 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 52172 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Najafi, Mehdi
Abstract:
Given that drug use is rising dramatically, drug-dealing coping forces must deal with this social pest with the right planning and taking into account time and budget constraints. In line with the importance of this issue in preventing the distribution of narcotics, in this thesis a dynamic planning methodology for boycotting the most multi-commodity flow considering the uncertainty in the results of the measures has been considered. Finally, we are looking to arrest the main distributors of drugs on the network and remove them from the drug distribution network. In order to solve this problem, and taking into account the real world constraints, a dual-level model with a minimum-objective objective function is presented. The objective function of the problem is to minimize the maximum expected drug flow across the network. In the formulation of this problem, binary techniques, linear standardization and equilibrium methods have been used with a definite model, and a mixed complex programming model has been proposed. The optimal answer from the above question can help anti-drug policemen to identify strategies and strategies to deal with drug dealers
Keywords:
Uncertainty ; Maximum Flow ; Network Interdiction ; Maximum Flow

No TOC