@article {
author = {Lee, Young Hoon and Rismanchian, Farhood},
title = {Optimizing hospital facility layout planning through process mining of clinical pathways},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {1-9},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.114464.1008},
abstract = {During the recent years, demand for healthcare services has dramatically increased. As the demand for healthcare services increases, so does the necessity of constructing new healthcare buildings and redesigning and renovating existing ones. Increasing demands necessitate the use of optimization techniques to improve the overall service efficiency in healthcare settings. However, high complexity of care processes remains the major challenge to accomplish this goal. This study proposes a method based on process mining results to address the high complexity of care processes and to find the optimal layout of the various medical centers in an emergency department. ProM framework is used to discover clinical pathway patterns and relationship between activities. Sequence clustering plug-in is used to remove infrequent events and to derive the process model in the form of Markov chain. The process mining results served as an input for the next phase which consists of the development of the optimization model. Comparison of the current ED design with the one obtained from the proposed method indicated that a carefully designed layout can significantly decrease the distances that patients must travel.},
keywords = {Healthcare processes,Process mining,optimization,Facility layout planning},
url = {http://aotp.fabad-ihe.ac.ir/article_57299.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_57299_d474f8f017ce791a350cbf8e1b416ff8.pdf}
}
@article {
author = {Khorram, Morteza},
title = {A cost based mathematical formulation for U-type assembly line balancing problem},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {11-21},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.109416.1005},
abstract = {This paper focuses on formulating a typical U-type assembly line balancing problem. A cost based objective function including equipment cost, worker time related cost, and station opening cost is introduced to be minimized in existence of a constant cycle time. Finally, efficiency of the proposed formulation of the introduced problem is studied and tested over some benchmarks.},
keywords = {U-type assembly line balancing problem,Mathematical Modeling,Cost based objective function},
url = {http://aotp.fabad-ihe.ac.ir/article_55450.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_55450_3de2b8585c360e5d77ed9fa4b7b24843.pdf}
}
@article {
author = {Vizári, Béla and Kovács, Gergely},
title = {On the control of a dynamical system defined by a decreasing one-dimensional set-valued function},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {23-33},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.110970.1007},
abstract = {Agricultural production can be described by discrete time as there is harvest in every year only once. The agricultural production is uncertain because of the weather and the ever changing technology. At the same time, the sector prefers stability which is reflected in the small changes in the prices. The uncertainty of the price may be modeled by a set-valued function in a single product market. The independent variable is the price expectation of the producer which is the future value of the price estimated by the producer. It can be assumed that the set-valued function is decreasing because in the case of higher price expectation, greater quantity appears on the market and thus the real market price becomes the lower. The stability of the market may require some control. In this paper the existence of an appropriate control to reach a target interval and to keep the trajectory in the interval is investigated from mathematical point of view. Necessary and sufficient conditions are given for the existence of the viable solution. The “striped structure” of the dynamical system is explored as well.},
keywords = {Set-valued function,Dynamical system,Control,Target interval,Viable solution},
url = {http://aotp.fabad-ihe.ac.ir/article_55631.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_55631_17d79afed67a9f3abb33a4da02809774.pdf}
}
@article {
author = {Rahimian, Mohammad},
title = {Optimal system and approximate solutions of the nonlinear filtration equation},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {35-42},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.115787.1009},
abstract = {In this paper, the problem of determining the most general Lie point approximate symmetries group for the nonlinear filtration equation with a small parameter is analyzed. By applying the basic Lie approximate symmetry method for the nonlinear filtration equation with a small parameter, the classical Lie point approximate symmetry operators are obtained. Also, the algebraic structure of the Lie algebra of approximate symmetries is discussed and an optimal system of one-dimensional subalgebras of the nonlinear filtration equation with a small parameter, symmetry algebra which creates the preliminary classification of group invariant solutions is constructed. Particularly, the Lie invariants as well as similarity reduced equations corresponding to infinitesimal symmetries and group invariant solutions associated to the symmetries are obtained.},
keywords = {Lie group analysis,Approximate symmetry,Optimal system,Invariant solution,Filtration equation},
url = {http://aotp.fabad-ihe.ac.ir/article_57300.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_57300_02707fb4fef3391a9dc75c130f6ce0a9.pdf}
}
@article {
author = {Ghadiri Nejad, Mazyar and Banar, Mahdi},
title = {Emergency response time minimization by incorporating ground and aerial transportation},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {43-57},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.108905.1004},
abstract = {In real life, many events may have severe effects on human being lives. These events can happen casually such as accident, heart attack or another severe disease, and deliberately like fights among people. From the engineering point of view, it does not matter what the reason of happening such events is, but the important thing is to rescue the affected people as much as possible in a short time and based on a scheduling point of view. In this study, we consider a real-life medical emergency service problem for a city with its known hospitals or medical care center locations. A limited number of ground and aerial vehicles, like ambulance and helicopter, are given to be assigned to these sites in which at most one vehicle from each type can be assigned. The aim is minimizing the total travel distances which are a function of the response time to the patients. To solve the problem, a mathematical formulation is proposed, and a metaheuristic solution method based on the genetic algorithm is developed, since the problem belongs to the NP-hard family of problems.},
keywords = {Response time,Aerial transportation,Emergency Service,Genetic algorithm},
url = {http://aotp.fabad-ihe.ac.ir/article_57301.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_57301_fe9e7250d07ff399673d2c609ade1c73.pdf}
}
@article {
author = {Sanei, Masoud and Hassasi, Hamid},
title = {A polynomial-time algorithm to determine BCC efficient frontier without solving a mathematical programming problem},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {59-68},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.106001.1002},
abstract = {In this paper, we restrict our attention to the efficient frontier of the BCC model, where the BCC model is a well-known basic model in Data Envelopment Analysis (DEA). We here assume that each Decision Making Unit (DMU) has one input and one output. In order to obtain BCC efficient frontier, the paper proposes a polynomial-time algorithm of complexity bonded by to produce well-behaved affine functions. The produced functions are then used to determine a point-wise minimum of a finite number of affine functions. It will be shown that by finding this function, we in fact also determine the efficient frontier of the BCC model. The main advantage of this approach is ability to achieve the efficient frontier, without solving a mathematical programming problem. Also, all of the Pareto efficient DMUs, as BCC-efficient DMUs, can be easily obtained using the proposed algorithm. A numerical example is presented to explain the use and effectiveness of the proposed algorithm.},
keywords = {Data Envelopment Analysis,BCC model,Efficient frontier,Point-wise minimum,Pareto efficient DMUs},
url = {http://aotp.fabad-ihe.ac.ir/article_57302.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_57302_5c8dd6ec55093c2a57f7701b57732648.pdf}
}
@article {
author = {Baranifar, Sara},
title = {A credibility-constrained programming for closed-loop supply chain network design problem under uncertainty},
journal = {Annals of Optimization Theory and Practice},
volume = {1},
number = {1},
pages = {69-83},
year = {2018},
publisher = {Firouzabad Institute of Higher Education},
issn = {2588-3666},
eissn = {2588-5995},
doi = {10.22121/aotp.2018.109753.1006},
abstract = {A closed-loop supply chain network (CLSCN) is consisted of both forward and reverse supply chains. In this paper, a CLSCN is including multiple plants, collection centers, demand markets, products and disposal centers. The plants manufacture the new products, then the new products are distributed to the demand market locations and the returned products are collected for sending to the collection centers. Collection centers have important role in recognizing the returned products conditions and the next action of supply chain as follows: inspection and/or separation of the collected products to check whether they are recoverable for sending to remanufacturing plants or unrecoverable ones to be sent to the disposal centers. A mixed-integer linear programming model is proposed to minimize the total cost. Since the uncertain parameters including cost, capacity, demand and the returned products influence the proposed CLSCN, a trapezoidal fuzzy model has been proposed to cope with the vagueness. The expected value is applied to the objective function and the chance constrained programming approach is used to model the uncertain constraint with fuzzy parameters. The numerical examples are coded and solved by GAMZ software. The computational results demonstrate the applicability of the proposed model and solution approach.},
keywords = {Closed-loop supply chain (CLSC),Mixed-integer linear programming (MILP),Possibilistic programming,Fuzzy mathematical programming,Credibility theory},
url = {http://aotp.fabad-ihe.ac.ir/article_57303.html},
eprint = {http://aotp.fabad-ihe.ac.ir/article_57303_66f1311485d82097f0bbd5e42c5720e7.pdf}
}