2016
23
1
1
0
A Class of Multiple Objective Mathematical Programming Problems in a Rough Environment
A Class of Multiple Objective Mathematical Programming Problems in a Rough Environment
2
2
This paper presents a set of multiple objective programming problems in a rough environment. These problems are classified into five classes according to the location of the roughness in the objective functions or the feasible set. We study the class in which all of the objective functions are crisp and the feasible region is a rough set and, in particular, discuss the properties of the completely and efficient (Pareto optimal) solutions of rough multiple objective programming problems. In order to obtain these solutions we need certain theorems which we derive. Finally, we illustrate our results by examples
1
This paper presents a set of multiple objective programming problems in a rough environment. These problems are classified into five classes according to the location of the roughness in the objective functions or the feasible set. We study the class in which all of the objective functions are crisp and the feasible region is a rough set and, in particular, discuss the properties of the completely and efficient (Pareto optimal) solutions of rough multiple objective programming problems. In order to obtain these solutions we need certain theorems which we derive. Finally, we illustrate our results by examples
301
315
A.
Hamzehee
A.
Hamzehee
Department of Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran
Department of Mathematics, Faculty of Mathematics
Iran
hamzehee_ali@yahoo.com
M A..
Yaghoobi
M A..
Yaghoobi
Department of Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran
Department of Mathematics, Faculty of Mathematics
Iran
yaghoobi@mail.uk.ac.ir
M.
Mashinchi
M.
Mashinchi
Department of Statistics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran
Department of Statistics, Faculty of Mathematics
Iran
mashinchi@mail.uk.ac.ir
Rough set
Multiple objective programming
Rough programming
Complete-optimal solutions
Efficient solutions
Bayesian Multiple Change Point Estimation of Poisson Rates in Control Charts
Bayesian Multiple Change Point Estimation of Poisson Rates in Control Charts
2
2
Effectiveness of root cause analysis efforts, following a control chart signal, will be enhanced if there exist more accurate information about the true time of the change in the process. In this study, we consider a Poisson process ex- periencing an unknown multiple number of step changes in the Poisson rate. We formulate the multiple change point scenario using Bayesian hierarchical models. We compute posterior distributions of the change point parameters including number, location and magnitude of changes and also corresponding probabilistic intervals and inferences through Reversible Jump Markov Chain Monte Carlo methods. The performance of the Bayesian estimator is investi- gated over several simulated change point scenarios. Results show that when the proposed Bayesian estimator is used in conjunction with the c-chart, it can provide precise estimates about the underlying change point scenario (number, timing, direction and size of step changes). In comparison with alternatives including Poisson EWMA and CUSUM built-in estimators and a maximum likelihood estimator, our estimator performs satisfactorily over consecutive monotonic and non-monotonic changes. The proposed Bayesian model and computation framework also benefit of probability quantification as well as flexibility which allows us to formulate other process types and change scenarios.
1
Effectiveness of root cause analysis efforts, following a control chart signal, will be enhanced if there exist more accurate information about the true time of the change in the process. In this study, we consider a Poisson process ex- periencing an unknown multiple number of step changes in the Poisson rate. We formulate the multiple change point scenario using Bayesian hierarchical models. We compute posterior distributions of the change point parameters including number, location and magnitude of changes and also corresponding probabilistic intervals and inferences through Reversible Jump Markov Chain Monte Carlo methods. The performance of the Bayesian estimator is investi- gated over several simulated change point scenarios. Results show that when the proposed Bayesian estimator is used in conjunction with the c-chart, it can provide precise estimates about the underlying change point scenario (number, timing, direction and size of step changes). In comparison with alternatives including Poisson EWMA and CUSUM built-in estimators and a maximum likelihood estimator, our estimator performs satisfactorily over consecutive monotonic and non-monotonic changes. The proposed Bayesian model and computation framework also benefit of probability quantification as well as flexibility which allows us to formulate other process types and change scenarios.
316
329
h.
Assareh
H.
Assareh
Epidemiology, Executive Medical Services, Western Sydney Local Health District, Sydney, Australia
Epidemiology, Executive Medical Services,
Iran
hassan.assareh@health.nsw.gov.au
R.
Noorossana
R.
Noorossana
School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
School of Industrial Engineering, Iran University
Iran
rassoul@iust.ac.ir
M.
Mohammadi
M.
Mohammadi
Department of Industrial Engineering, Islamic Azad University-Science and Research Branch, Tehran, Iran
Department of Industrial Engineering, Islamic
Iran
ccvttcco@scientiaunknown.non
K.
Mengersen
K.
Mengersen
Discipline of Mathematical Sciences, Science and Engineering Faculty, Queensland University of Technology, Brisbane, Australia
Discipline of Mathematical Sciences, Science
Iran
Bayesian Hierarchical Model
Multiple Change Point
Control Charts
Reversible Jump Markov Chain Monte Carlo
Poisson Process
Multi-echelon supply chain network modelling and optimization via simulation and metaheuristic algorithms
Multi-echelon supply chain network modelling and optimization via simulation and metaheuristic algorithms
2
2
An important problem in todays industries is the cost issue, due to the high level of competition in the global market. This fact obliges organizations to focus on improvement of their production-distribution routes, in order to nd the best. The Supply Chain Network (SCN) is one of the, so-called, production-distribution models that has many layers and/or echelons. In this paper, a new SCN, which is more compatible with real world problems is presented, and then, two novel hybrid algorithms have been developed to solve the model. Each hybrid algorithm integrates the simulation technique with two metaheuristic algorithms, including the Genetic Algorithm (GA) and the Simulated Annealing Algorithm (SAA), namely, HSIM-META. The output of the simulation model is inserted as the initial population in tuned-parameter metaheuristic algorithms to nd near optimum solutions, which is in fact a new approach in the literature. To analyze the performance of the proposed algorithms, dierent numerical examples are presented. The computational results of the proposed HSIM-META, including hybrid simulation-GA (HSIM-GA) and hybrid simulation-SAA (HSIM-SAA), are compared to the GA and the SAA. Computational results show that the proposed HSIM-META has suitable accuracy and speed for use in real world applications.
1
An important problem in todays industries is the cost issue, due to the high level of competition in the global market. This fact obliges organizations to focus on improvement of their production-distribution routes, in order to nd the best. The Supply Chain Network (SCN) is one of the, so-called, production-distribution models that has many layers and/or echelons. In this paper, a new SCN, which is more compatible with real world problems is presented, and then, two novel hybrid algorithms have been developed to solve the model. Each hybrid algorithm integrates the simulation technique with two metaheuristic algorithms, including the Genetic Algorithm (GA) and the Simulated Annealing Algorithm (SAA), namely, HSIM-META. The output of the simulation model is inserted as the initial population in tuned-parameter metaheuristic algorithms to nd near optimum solutions, which is in fact a new approach in the literature. To analyze the performance of the proposed algorithms, dierent numerical examples are presented. The computational results of the proposed HSIM-META, including hybrid simulation-GA (HSIM-GA) and hybrid simulation-SAA (HSIM-SAA), are compared to the GA and the SAA. Computational results show that the proposed HSIM-META has suitable accuracy and speed for use in real world applications.
330
347
R.
Rooeinfar
R.
Rooeinfar
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.
Faculty of Industrial and Mechanical Engineering,
Iran
P.
Azimi
P.
Azimi
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Faculty of Industrial and Mechanical Engineering,
Iran
p.azimi@yahoo.com
H.
Pourvaziri
H.
Pourvaziri
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Faculty of Industrial and Mechanical Engineering,
Iran
Discrete event simulation
Cross docking terminals
Optimization via Simulation
genetic algorithm
A two-stage stochastic programming model for value-based supply chain network design
A two-stage stochastic programming model for value-based supply chain network design
2
2
Nowadays, Value –based Supply Chain Management (VbSCM) is considered as a resource of competitive advantages, and companies with a long term strategic plan find the VbSCM as an effective factor in sustainability. In this context, supply chain network design has a significant impact on all value drivers (i.e. sales, supply chain costs, fixed assets and working capital). This paper proposes a stochastic mixed integer linear programming model for the value-based supply chain network design in which decisions on physical flow (raw materials and finished products) and financial flow are integrated. The proposed model is designed for a four-echelon, multi-commodity, multi-period supply chain and maximizes the value of the company based on the economic value-added concept by making some strategic and tactical decisions affecting the value drivers. Furthermore, a scenario-based two-stage stochastic programming model is developed with a scenario generation method based on Nataf transformation. Also, a computational analysis is done to illustrate performance of the proposed approach.
1
Nowadays, Value –based Supply Chain Management (VbSCM) is considered as a resource of competitive advantages, and companies with a long term strategic plan find the VbSCM as an effective factor in sustainability. In this context, supply chain network design has a significant impact on all value drivers (i.e. sales, supply chain costs, fixed assets and working capital). This paper proposes a stochastic mixed integer linear programming model for the value-based supply chain network design in which decisions on physical flow (raw materials and finished products) and financial flow are integrated. The proposed model is designed for a four-echelon, multi-commodity, multi-period supply chain and maximizes the value of the company based on the economic value-added concept by making some strategic and tactical decisions affecting the value drivers. Furthermore, a scenario-based two-stage stochastic programming model is developed with a scenario generation method based on Nataf transformation. Also, a computational analysis is done to illustrate performance of the proposed approach.
348
360
H.
Badri
H.
Badri
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran
Department of Industrial Engineering, Amirkabir
Iran
S.M.T.
Fatemi Ghomi
S.M.T.
Fatemi Ghomi
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran
Department of Industrial Engineering, Amirkabir
Iran
fatemi@aut.ac.ir
T.H.
Hejazi
T.H.
Hejazi
Young Researchers and Elite Club, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Young Researchers and Elite Club, Qazvin
Iran
supply chain network design
Value based management
Two-stage stochastic programming
Correlated parameters
A novel grey target decision-making model based on cobweb area and its application for choosing the software development pattern
A novel grey target decision-making model based on cobweb area and its application for choosing the software development pattern
2
2
A grey target decision-making model is an effective method used to look for a relatively optimal decision-making scheme. In this method, whether a scheme is good or bad is determined through comparing the square sums of the differences between the evaluated indices and the optimal indices. However, such “power operation” probably results in amplification or reduction of some extreme index values in decision-making results. In this paper, an improved method based on cobweb area is proposed. Here an index is represented by a line drawn from the bull’s-eye, with equal angles between adjacent lines. Then data points are determined on the lines so that the length of a line segment represents the size of the index value. Each point is then connected in order, and a cobweb-like geometrical figure is obtained. With the proposed figure, each scheme could be evaluated by finding the area of its corresponding cobweb. The proposed model was applied for choosing the preferred software development mode of Chana Group’s Office Automation system, and the new model’sperformance was then compared with that of the traditional grey target decision-making model. The comparison shows the new model is more outstanding than a traditional grey target model.
1
A grey target decision-making model is an effective method used to look for a relatively optimal decision-making scheme. In this method, whether a scheme is good or bad is determined through comparing the square sums of the differences between the evaluated indices and the optimal indices. However, such “power operation” probably results in amplification or reduction of some extreme index values in decision-making results. In this paper, an improved method based on cobweb area is proposed. Here an index is represented by a line drawn from the bull’s-eye, with equal angles between adjacent lines. Then data points are determined on the lines so that the length of a line segment represents the size of the index value. Each point is then connected in order, and a cobweb-like geometrical figure is obtained. With the proposed figure, each scheme could be evaluated by finding the area of its corresponding cobweb. The proposed model was applied for choosing the preferred software development mode of Chana Group’s Office Automation system, and the new model’sperformance was then compared with that of the traditional grey target decision-making model. The comparison shows the new model is more outstanding than a traditional grey target model.
361
373
Bo
Zeng
Bo
Zeng
School of Business Planning, Chongqing Technology and Business University, Chongqing 400067, China
School of Business Planning, Chongqing Technology
Iran
zbljh2@163.com
Chuan
Li
Chuan
Li
Engineering Laboratory for Detection Control, Chongqing Technology and Business University, Chongqing 400067, China
Engineering Laboratory for Detection Control,
Iran
lcctbu@126.com
Si-Feng
Liu
Si-Feng
Liu
School of Management and Economics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
School of Management and Economics, Nanjing
Iran
sfliu@nuaa.edu.cn
Grey target decision-making model
Magnification or reduction effect
Cobweb area
Selection of software development pattern
Population-based metaheuristics for R&D project scheduling problems under activity failure risk
Population-based metaheuristics for R&D project scheduling problems under activity failure risk
2
2
In this paper, we study scheduling of R&D projects in which activities may to be failed due to the technological risks. We consider two introduced problems in the literature referred to as R&D Project Scheduling Problem (RDPSP) and Alternative Technologies Project Scheduling Problem (ATPSP). In the both problems, the goal is the maximization of the expected net present value of activities where activities are precedence related and each of them is accompanied with a cost, a duration and a probability of technical success. In RDPSP, a project payoff is obtained if all activities are succeeded while in ATPSP, if one of activities is implemented successfully, the project payoff is attained. We developed a solution representation for each of these problems and developed two population-based metaheuristics including scatter search algorithm and genetic algorithm as solution approaches. Computational experiments indicate scatter search outperforms genetic algorithm and also available exact solution algorithms.
1
In this paper, we study scheduling of R&D projects in which activities may to be failed due to the technological risks. We consider two introduced problems in the literature referred to as R&D Project Scheduling Problem (RDPSP) and Alternative Technologies Project Scheduling Problem (ATPSP). In the both problems, the goal is the maximization of the expected net present value of activities where activities are precedence related and each of them is accompanied with a cost, a duration and a probability of technical success. In RDPSP, a project payoff is obtained if all activities are succeeded while in ATPSP, if one of activities is implemented successfully, the project payoff is attained. We developed a solution representation for each of these problems and developed two population-based metaheuristics including scatter search algorithm and genetic algorithm as solution approaches. Computational experiments indicate scatter search outperforms genetic algorithm and also available exact solution algorithms.
374
386
Mohammad
Ranjbar
Mohammad
Ranjbar
Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran
Department of Industrial Engineering, Faculty
Iran
m_ranjbar@um.ac.ir
Hamidreza
Validi
Hamidreza
Validi
Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran
Department of Industrial Engineering, Faculty
Iran
hamidreza.validi2@gmail.com
Ramin
Fakhimi
Ramin
Fakhimi
Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran
Department of Industrial Engineering, Faculty
Iran
fakhimi.ramin@gmail.com
Project Scheduling
Risk
scatter search, genetic algorithm
A new approach based on queuing theory for solving the assembly line balancing problem using fuzzy prioritization techniques
A new approach based on queuing theory for solving the assembly line balancing problem using fuzzy prioritization techniques
2
2
Determining the number of operator for manufacturing operations is important in Assembly line balancing.Optimal allocation of manpower increase production efficiency. Thus it increases profits of the companies. Since there is a possibility to assign different numbers of machines to each operator, therefore a variety of scenarios of machine assignment to operators will occur. Our goal in writing this paper is to help managers choose the best possible scenario. In this model, each of the possible scenarios are modeled using the principles of queuing theory and costs and revenues from each of these scenarios is calculated.Since uncertainty is an important part of the manufacturing environments, thus a fuzzy logic model is proposed to consider the uncertainty in problem. Since some input of the model such as service rate and arrival rate are fuzzy, thus profit of the model will be a fuzzy number. Therefore we use fuzzy ranking methods for prioritizing the scenarios.
1
Determining the number of operator for manufacturing operations is important in Assembly line balancing.Optimal allocation of manpower increase production efficiency. Thus it increases profits of the companies. Since there is a possibility to assign different numbers of machines to each operator, therefore a variety of scenarios of machine assignment to operators will occur. Our goal in writing this paper is to help managers choose the best possible scenario. In this model, each of the possible scenarios are modeled using the principles of queuing theory and costs and revenues from each of these scenarios is calculated.Since uncertainty is an important part of the manufacturing environments, thus a fuzzy logic model is proposed to consider the uncertainty in problem. Since some input of the model such as service rate and arrival rate are fuzzy, thus profit of the model will be a fuzzy number. Therefore we use fuzzy ranking methods for prioritizing the scenarios.
387
398
S.
Khalili
S.
Khalili
Industrial Engineering Department, University of Yazd, PO Box 89195-741, Yazd, Iran
Industrial Engineering Department, University
Iran
s.khalili1367@stu.yazd.ac.ir
H.
Mohammadzade
H.
Mohammadzade
Industrial Engineering Department University of Yazd, PO Box 89195-741, Yazd, Iran
Industrial Engineering Department University
Iran
hadi.mohammadzade@stu.yazd.ac.ir
M.S.
Fallahnezhad
M.S.
Fallahnezhad
Industrial Engineering Department, University of Yazd, PO Box 89195-741, Yazd, Iran
Industrial Engineering Department, University
Iran
fallahnezhad@yazd.ac.ir
Assembly line balancing
queuing theory
fuzzy prioritization technique
scenario building