A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods. (December 2021)
- Record Type:
- Journal Article
- Title:
- A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods. (December 2021)
- Main Title:
- A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods
- Authors:
- Mirzaei, Mahdieh
Mirzapour Al-e-hashem, S. Mohammad J.
Akbarpour Shirazi, Mohsen - Abstract:
- Highlights: A stochastic maximum-flow network interdiction problem is extended. Information asymmetry is formulated in the network interdiction problem. The application of the proposed model is investigated in smuggling goods. Two exact decomposition-based algorithms are developed to solve the models. Abstract: We study the interdiction of smuggling network that arranging the activities of the police in order to successfully interdict criminals in smuggling goods. This work contributes to the literature of maximum flow network interdiction problems by addressing asymmetric information, uncertain conditions, multi commodity, and with multiple sources (origins) and sinks (destinations). Information Asymmetry realistically occurs due to incomplete information of interdictor (police) and operator (smuggler) about each other's performance, which is adapted from the real-world condition. We propose two mixed-integer programming models by reformulating a Min–Max bi-level mathematical model. In the first model, the type of interdiction is discrete (zero and one), while in the second model, the interdiction is assumed continuous, meaning that the partial interdiction is possible. The asymmetry type of the smuggler's information towards the police have formulated through a linear function while the asymmetry of the police information to the smuggler is formulated using an uncertain parameter through a two-stage stochastic programming framework. To solve the first model, an innovativeHighlights: A stochastic maximum-flow network interdiction problem is extended. Information asymmetry is formulated in the network interdiction problem. The application of the proposed model is investigated in smuggling goods. Two exact decomposition-based algorithms are developed to solve the models. Abstract: We study the interdiction of smuggling network that arranging the activities of the police in order to successfully interdict criminals in smuggling goods. This work contributes to the literature of maximum flow network interdiction problems by addressing asymmetric information, uncertain conditions, multi commodity, and with multiple sources (origins) and sinks (destinations). Information Asymmetry realistically occurs due to incomplete information of interdictor (police) and operator (smuggler) about each other's performance, which is adapted from the real-world condition. We propose two mixed-integer programming models by reformulating a Min–Max bi-level mathematical model. In the first model, the type of interdiction is discrete (zero and one), while in the second model, the interdiction is assumed continuous, meaning that the partial interdiction is possible. The asymmetry type of the smuggler's information towards the police have formulated through a linear function while the asymmetry of the police information to the smuggler is formulated using an uncertain parameter through a two-stage stochastic programming framework. To solve the first model, an innovative exact hybrid method is proposed combining of a Decomposition Method and Progressive Hedging Algorithm (DM-PHA). An augmented Karush-Kuhn-Tucker (KKT) method is also used to solve the second model. Several sensitivity analyses are then conducted, and the results demonstrate the applicability and effectiveness of the proposed models as well as the solving approach. It is also shown that the proposed models can be used as a suitable approach in uncertain environment and under asymmetric information to determine the optimal interdiction decisions of police to prevent further smuggling. … (more)
- Is Part Of:
- Computers & industrial engineering. Volume 162(2021)
- Journal:
- Computers & industrial engineering
- Issue:
- Volume 162(2021)
- Issue Display:
- Volume 162, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 162
- Issue:
- 2021
- Issue Sort Value:
- 2021-0162-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-12
- Subjects:
- The maximum flow network interdiction -- Two-stage stochastic programing -- Decompsition-PHA algorithm -- Smuggling goods -- Karush-Kuhn-Tucker conditions (KKT)
Engineering -- Data processing -- Periodicals
Industrial engineering -- Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03608352 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cie.2021.107708 ↗
- Languages:
- English
- ISSNs:
- 0360-8352
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.713000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 20090.xml