# American Institute of Mathematical Sciences

• Previous Article
Joint emission reduction dynamic optimization and coordination in the supply chain considering fairness concern and reference low-carbon effect
• JIMO Home
• This Issue
• Next Article
Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
doi: 10.3934/jimo.2021128
Online First

Online First articles are published articles within a journal that have not yet been assigned to a formal issue. This means they do not yet have a volume number, issue number, or page numbers assigned to them, however, they can still be found and cited using their DOI (Digital Object Identifier). Online First publication benefits the research community by making new scientific discoveries known as quickly as possible.

Readers can access Online First articles via the “Online First” tab for the selected journal.

## Median location problem with two probabilistic line barriers: Extending the Hook and Jeeves algorithm

 1 Faculty of Engineering, University of Garmsar, Garmsar, Iran 2 Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

* Corresponding author: Saber Shiripour

Received  October 2020 Revised  April 2021 Early access August 2021

We consider a median location problem in the presence of two probabilistic line barriers on the plane under rectilinear distance. It is assumed that the two line barriers move on their corresponding horizontal routes uniformly. We first investigate different scenarios for the position of the line barriers on the plane and their corresponding routes, and then define the visibility and invisibility conditions along with their corresponding expected barrier distance functions. The proposed problem is formulated as a mixed-integer nonlinear programming model. Our aim is to locate a new facility on the plane so that the total weighted expected rectilinear barrier distance is minimized. We present efficient lower and upper bounds using the forbidden location problem for the proposed problem. To solve the proposed model, the Hooke and Jeeves algorithm (HJA) is extended. We investigate various sample problems to test the performance of the proposed algorithm and appropriateness of the bounds. Also, an empirical study in Kingston-upon-Thames, England, is conducted to illustrate the behavior and applicability of the proposed model.

Citation: Saber Shiripour, Nezam Mahdavi-Amiri. Median location problem with two probabilistic line barriers: Extending the Hook and Jeeves algorithm. Journal of Industrial & Management Optimization, doi: 10.3934/jimo.2021128
##### References:

show all references

##### References:
Two probabilistic line barriers on the plane.
Visibility and effectiveness conditions.
Examples for $(x_{s1},x_{s2})\in \psi _1$.
Examples for $(x_{s1},x_{s2})\in \psi _2$.
Examples for $(x_{s1},x_{s2})\in \psi _3$.
An example for $(x_{s1},x_{s2})\in \psi _4$.
An example for $(x_{s1},x_{s2})\in \psi _5$.
Presentation of the location problems of type $1/\mathbb{R}^2/\mathcal{B} = 2ProbL/d_1/\sum$ and $1/\mathbb{R}^2/\mathcal{R}:\mathcal{B} = 2ProbL/d_1/\sum$.
General steps of the proposed algorithm.
Gaps in terms of sample problems.
Solution times in terms of sample problems.
Representation of the empirical study and the obtained results.
Impact of lengths of the trains.
Literature review of facility location problems with probabilistic barriers
Invisible regions and their corresponding distance functions for $i\in \mathcal{I}_2$
Results for small and medium problems
Results for large problems
The Cartesian coordinates of the barrier routes
 [1] Qiang Long, Changzhi Wu. A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization. Journal of Industrial & Management Optimization, 2014, 10 (4) : 1279-1296. doi: 10.3934/jimo.2014.10.1279 [2] Shahede Omidi, Jafar Fathali. Inverse single facility location problem on a tree with balancing on the distance of server to clients. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2021017 [3] Gaidi Li, Zhen Wang, Dachuan Xu. An approximation algorithm for the $k$-level facility location problem with submodular penalties. Journal of Industrial & Management Optimization, 2012, 8 (3) : 521-529. doi: 10.3934/jimo.2012.8.521 [4] Yujuan Li, Guizhen Zhu. On the error distance of extended Reed-Solomon codes. Advances in Mathematics of Communications, 2016, 10 (2) : 413-427. doi: 10.3934/amc.2016015 [5] Samuel R. Kaplan, Ernesto A. Lacomba, Jaume Llibre. Symbolic dynamics of the elliptic rectilinear restricted 3--body problem. Discrete & Continuous Dynamical Systems - S, 2008, 1 (4) : 541-555. doi: 10.3934/dcdss.2008.1.541 [6] Kien Trung Nguyen, Vo Nguyen Minh Hieu, Van Huy Pham. Inverse group 1-median problem on trees. Journal of Industrial & Management Optimization, 2021, 17 (1) : 221-232. doi: 10.3934/jimo.2019108 [7] Jean-Paul Arnaout, Georges Arnaout, John El Khoury. Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1215-1225. doi: 10.3934/jimo.2016.12.1215 [8] Yishui Wang, Dongmei Zhang, Peng Zhang, Yong Zhang. Local search algorithm for the squared metric $k$-facility location problem with linear penalties. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2013-2030. doi: 10.3934/jimo.2020056 [9] Andrey Itkin, Dmitry Muravey. Semi-analytic pricing of double barrier options with time-dependent barriers and rebates at hit. Frontiers of Mathematical Finance, , () : -. doi: 10.3934/fmf.2021002 [10] Elena Beretta, Markus Grasmair, Monika Muszkieta, Otmar Scherzer. A variational algorithm for the detection of line segments. Inverse Problems & Imaging, 2014, 8 (2) : 389-408. doi: 10.3934/ipi.2014.8.389 [11] Petteri Piiroinen, Martin Simon. Probabilistic interpretation of the Calderón problem. Inverse Problems & Imaging, 2017, 11 (3) : 553-575. doi: 10.3934/ipi.2017026 [12] Huajun Tang, T. C. Edwin Cheng, Chi To Ng. A note on the subtree ordered median problem in networks based on nestedness property. Journal of Industrial & Management Optimization, 2012, 8 (1) : 41-49. doi: 10.3934/jimo.2012.8.41 [13] Weihua Liu, Andrew Klapper. AFSRs synthesis with the extended Euclidean rational approximation algorithm. Advances in Mathematics of Communications, 2017, 11 (1) : 139-150. doi: 10.3934/amc.2017008 [14] Ruiqi Yang, Dachuan Xu, Yicheng Xu, Dongmei Zhang. An adaptive probabilistic algorithm for online k-center clustering. Journal of Industrial & Management Optimization, 2019, 15 (2) : 565-576. doi: 10.3934/jimo.2018057 [15] Ashkan Ayough, Farbod Farhadi, Mostafa Zandieh, Parisa Rastkhadiv. Genetic algorithm for obstacle location-allocation problems with customer priorities. Journal of Industrial & Management Optimization, 2021, 17 (4) : 1753-1769. doi: 10.3934/jimo.2020044 [16] Xin Yang Lu. Regularity of densities in relaxed and penalized average distance problem. Networks & Heterogeneous Media, 2015, 10 (4) : 837-855. doi: 10.3934/nhm.2015.10.837 [17] Anh Son Ta, Le Thi Hoai An, Djamel Khadraoui, Pham Dinh Tao. Solving Partitioning-Hub Location-Routing Problem using DCA. Journal of Industrial & Management Optimization, 2012, 8 (1) : 87-102. doi: 10.3934/jimo.2012.8.87 [18] Gbeminiyi John Oyewole, Olufemi Adetunji. Solving the facility location and fixed charge solid transportation problem. Journal of Industrial & Management Optimization, 2021, 17 (4) : 1557-1575. doi: 10.3934/jimo.2020034 [19] Xuefeng Wang. The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1147-1166. doi: 10.3934/dcdss.2019079 [20] Feliz Minhós, T. Gyulov, A. I. Santos. Existence and location result for a fourth order boundary value problem. Conference Publications, 2005, 2005 (Special) : 662-671. doi: 10.3934/proc.2005.2005.662

2020 Impact Factor: 1.801

## Tools

Article outline

Figures and Tables