Pub Date : 2018-09-27DOI: 10.1504/IJMOR.2018.094852
M. Hamasha
In this paper, the lower side truncated cumulative normal distribution is approximated by a simple function, the inverse of the function is derived, and random variates are explained how to be generated from the introduced inverse approximation. The introduced approximation is derived from Aludaat and Alodat's model of approximating cumulative normal distribution. The accuracy of the introduced function is investigated in term of maximum absolute error (i.e., 0.003944). This level of accuracy is possibly the best comparing all previous similar models to the best of the author's knowledge.
{"title":"Generate random variates using a newly introduced approximation to cumulative density of lower truncated normal distribution for simulation applications","authors":"M. Hamasha","doi":"10.1504/IJMOR.2018.094852","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094852","url":null,"abstract":"In this paper, the lower side truncated cumulative normal distribution is approximated by a simple function, the inverse of the function is derived, and random variates are explained how to be generated from the introduced inverse approximation. The introduced approximation is derived from Aludaat and Alodat's model of approximating cumulative normal distribution. The accuracy of the introduced function is investigated in term of maximum absolute error (i.e., 0.003944). This level of accuracy is possibly the best comparing all previous similar models to the best of the author's knowledge.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-27DOI: 10.1504/IJMOR.2018.094851
Shiva Zandkarimkhani, M. Nasiri, J. Heydari
Recently, because of the recycling policies and environmental issues, the combination of forward and reverse logistics has attracted lots of attention to itself. The current paper presents a designed open-loop supply chain network to reuse the returned goods. To this aim, a mixed integer linear model is proposed that minimises the total cost. The proposed model determines the location of distribution centres, recycling centres, collection centres, disposal centres and also the quantity of the transferred product between levels. Finally, in order to investigate the effectiveness of the proposed model, it is implemented at one of Iranian Poly Ethylene Terephthalate (PET) product companies.
{"title":"Designing an open-loop supply chain network for recyclable products: a case study","authors":"Shiva Zandkarimkhani, M. Nasiri, J. Heydari","doi":"10.1504/IJMOR.2018.094851","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094851","url":null,"abstract":"Recently, because of the recycling policies and environmental issues, the combination of forward and reverse logistics has attracted lots of attention to itself. The current paper presents a designed open-loop supply chain network to reuse the returned goods. To this aim, a mixed integer linear model is proposed that minimises the total cost. The proposed model determines the location of distribution centres, recycling centres, collection centres, disposal centres and also the quantity of the transferred product between levels. Finally, in order to investigate the effectiveness of the proposed model, it is implemented at one of Iranian Poly Ethylene Terephthalate (PET) product companies.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-27DOI: 10.1504/IJMOR.2018.094854
H. S. Tooranloo, Arezoo Sadat Ayatollah, A. Iranpour
Today, the global market is confronted with short-lifecycle products or highly demanding customers that calls a lot of focus on supply chain. Among the activities of the supply chain, activities of effective purchasing are the most important activity to proper selection of suppliers since of supplier evaluation and selection problem is a multi-criteria decision-making problem that is along with high degree of ambiguity and uncertainty in the real world decision making. Since the information on real world decision-making are often imprecise and expressed verbally therefore the fuzzy sets theory can be effectively used to solve such problems. This paper first provides an overview on the supplier evaluation and selection problem, and then presents a decision making model that integrates interval-valued intuitionistic fuzzy AHP (IVIF-AHP) and interval-valued intuitionistic fuzzy TOPSIS (IVIF-TOPSIS) to solve such problems, and in the end, provides a numerical example to demonstrate the use of the proposed approach.
{"title":"A model for supplier evaluation and selection based on integrated interval-valued intuitionistic fuzzy AHP-TOPSIS approach","authors":"H. S. Tooranloo, Arezoo Sadat Ayatollah, A. Iranpour","doi":"10.1504/IJMOR.2018.094854","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094854","url":null,"abstract":"Today, the global market is confronted with short-lifecycle products or highly demanding customers that calls a lot of focus on supply chain. Among the activities of the supply chain, activities of effective purchasing are the most important activity to proper selection of suppliers since of supplier evaluation and selection problem is a multi-criteria decision-making problem that is along with high degree of ambiguity and uncertainty in the real world decision making. Since the information on real world decision-making are often imprecise and expressed verbally therefore the fuzzy sets theory can be effectively used to solve such problems. This paper first provides an overview on the supplier evaluation and selection problem, and then presents a decision making model that integrates interval-valued intuitionistic fuzzy AHP (IVIF-AHP) and interval-valued intuitionistic fuzzy TOPSIS (IVIF-TOPSIS) to solve such problems, and in the end, provides a numerical example to demonstrate the use of the proposed approach.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129433586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-15DOI: 10.1504/IJMOR.2018.094053
M. Braglia, D. Castellano, D. Song
This paper considers a number of inventory models with backorders-lost sales mixture, stockout costs, and controllable lead time. The lead time is a linear function of the lot size and includes a constant term that is made of several components. These lot-size-independent components are assumed to be controllable. Both single- and double-echelon inventory systems, under periodic or continuous review, are considered. To authors knowledge, these models have never been previously studied in literature. The purpose of this paper is to analyse and optimise these novel inventory models. The optimisation is carried out by means of heuristics that work on an ad hoc approximation of the cost functions. This peculiarity permits to exploit closed-form expressions that make the optimisation procedure simpler and more readily applicable in practice than standard approaches. Finally, numerical experiments investigate the efficiency of the proposed heuristics and the sensitivity of the developed models.
{"title":"Efficient near-optimal procedures for some inventory models with backorders-lost sales mixture and controllable lead time, under continuous or periodic review","authors":"M. Braglia, D. Castellano, D. Song","doi":"10.1504/IJMOR.2018.094053","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094053","url":null,"abstract":"This paper considers a number of inventory models with backorders-lost sales mixture, stockout costs, and controllable lead time. The lead time is a linear function of the lot size and includes a constant term that is made of several components. These lot-size-independent components are assumed to be controllable. Both single- and double-echelon inventory systems, under periodic or continuous review, are considered. To authors knowledge, these models have never been previously studied in literature. The purpose of this paper is to analyse and optimise these novel inventory models. The optimisation is carried out by means of heuristics that work on an ad hoc approximation of the cost functions. This peculiarity permits to exploit closed-form expressions that make the optimisation procedure simpler and more readily applicable in practice than standard approaches. Finally, numerical experiments investigate the efficiency of the proposed heuristics and the sensitivity of the developed models.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-15DOI: 10.1504/IJMOR.2018.094054
Allen H. Tai
It is a common practice in industry that maintenance service is outsourced to external suppliers. In this paper, a model for a continuously degrading system is developed such that an optimal inspection-maintenance strategy can be derived. The model is capable of handling the situation when there is deferment of the maintenance services. Hence, the system manager can decide whether to stop system operation during the waiting time for the maintenance services. The system is subjected to two degradation sources: 1) the degradation due to the operation of the system; 2) the degradation due to the operation environment. An optimal value of the inter-inspection time and an optimal maintenance threshold are then obtained by numerical methods such that the average availability of the system is maximised. Illustrative examples and some special cases are also provided.
{"title":"A model for continuously degrading systems with outsourcing maintenance service","authors":"Allen H. Tai","doi":"10.1504/IJMOR.2018.094054","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094054","url":null,"abstract":"It is a common practice in industry that maintenance service is outsourced to external suppliers. In this paper, a model for a continuously degrading system is developed such that an optimal inspection-maintenance strategy can be derived. The model is capable of handling the situation when there is deferment of the maintenance services. Hence, the system manager can decide whether to stop system operation during the waiting time for the maintenance services. The system is subjected to two degradation sources: 1) the degradation due to the operation of the system; 2) the degradation due to the operation environment. An optimal value of the inter-inspection time and an optimal maintenance threshold are then obtained by numerical methods such that the average availability of the system is maximised. Illustrative examples and some special cases are also provided.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125306245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-15DOI: 10.1504/IJMOR.2018.094058
D. K. Adhwarjee
This paper introduces an algorithm for finding the shortest path which is more powerful method than all the existing methods like Dijkstra's algorithm. Adhwarjee's algorithm is introduced to the readers for finding the shortest path. The author gives few steps to find the shortest path. This method takes less standard time than Dijkstra's algorithm. First, Dijkstra's method is explained in brief, which is readily available in books. We will concentrate on the new method of finding the shortest path. Adhwarjee's algorithm needs no table to compute. Simple addition, subtraction and finding minimum, maximum can be done mentally and posted in the network itself. In the network, the reader can see the minimum distance or time which requires to be found out.
{"title":"Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm","authors":"D. K. Adhwarjee","doi":"10.1504/IJMOR.2018.094058","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094058","url":null,"abstract":"This paper introduces an algorithm for finding the shortest path which is more powerful method than all the existing methods like Dijkstra's algorithm. Adhwarjee's algorithm is introduced to the readers for finding the shortest path. The author gives few steps to find the shortest path. This method takes less standard time than Dijkstra's algorithm. First, Dijkstra's method is explained in brief, which is readily available in books. We will concentrate on the new method of finding the shortest path. Adhwarjee's algorithm needs no table to compute. Simple addition, subtraction and finding minimum, maximum can be done mentally and posted in the network itself. In the network, the reader can see the minimum distance or time which requires to be found out.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130496981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-15DOI: 10.1504/IJMOR.2018.094055
Mohammad Mehdi Tavakoli, S. Sajadi, S. Aghili
One of the substantial things, which has been perceived more than ever by captains of industry in recent years, is the necessity of earning competitive value. As a result, mechanisation and enhancing the level of automation of the process has become one of the most fascinating issues to researchers. In this regard one of the most appealing systems to industries is flexible manufacturing systems which contribute to achievement of higher levels of automation in business environments. Since transportation plays an essential role in flexible production systems, automated guided vehicles (AVGs) have been utilised to carry material in these systems in order to maintain the flexibility, and increase the efficiency of production and distribution throughout the system. In this paper, a mathematical model for scheduling and allocating AVGs in the manufacturing process of a specific project is proposed and in the end, a heuristic algorithm is proposed and used to solve the model problem.
{"title":"Proposing a new mathematical model and a meta-heuristic algorithm for scheduling and allocating automated guided vehicle","authors":"Mohammad Mehdi Tavakoli, S. Sajadi, S. Aghili","doi":"10.1504/IJMOR.2018.094055","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094055","url":null,"abstract":"One of the substantial things, which has been perceived more than ever by captains of industry in recent years, is the necessity of earning competitive value. As a result, mechanisation and enhancing the level of automation of the process has become one of the most fascinating issues to researchers. In this regard one of the most appealing systems to industries is flexible manufacturing systems which contribute to achievement of higher levels of automation in business environments. Since transportation plays an essential role in flexible production systems, automated guided vehicles (AVGs) have been utilised to carry material in these systems in order to maintain the flexibility, and increase the efficiency of production and distribution throughout the system. In this paper, a mathematical model for scheduling and allocating AVGs in the manufacturing process of a specific project is proposed and in the end, a heuristic algorithm is proposed and used to solve the model problem.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125114127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-15DOI: 10.1504/IJMOR.2018.094056
Nesrine Zidani, N. Djellab
The paper deals with an M/M/C/K retrial queue with exponential abandonment at which positive and negative customers arrive according to Poisson processes. This model is of practical interest: it can be used for analysing the performance in call centres and e-mail contact systems. For the model under investigation, we find the ergodicity conditions and also the approximate solution by using finite truncation and value extrapolation methods. We present some numerical results to examine the performance of the value extrapolation method as well as the system performance.
{"title":"On the multiserver retrial queues with negative arrivals","authors":"Nesrine Zidani, N. Djellab","doi":"10.1504/IJMOR.2018.094056","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094056","url":null,"abstract":"The paper deals with an M/M/C/K retrial queue with exponential abandonment at which positive and negative customers arrive according to Poisson processes. This model is of practical interest: it can be used for analysing the performance in call centres and e-mail contact systems. For the model under investigation, we find the ergodicity conditions and also the approximate solution by using finite truncation and value extrapolation methods. We present some numerical results to examine the performance of the value extrapolation method as well as the system performance.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-08-15DOI: 10.1504/IJMOR.2018.094057
D. Barman, Barun Das
A continuous review economic order quantity (EOQ) model (with shortage) is modelled here. The inventory cost parameters are imprecise in nature. The model is developed for Partially Enforced Delay (PEND) and Strictly Enforced Delay (SEND) policies with lead time crashing cost. Here demand of the item is a linear function of selling price and usable lead time. For each policy, a set-up cost reduction technique has been applied to the model. Moreover, a statistical t-test has been used to compare the policies. We also present some numerical examples, sensitivity analysis and their discussions to stabilise the model.
{"title":"An imprecise-inventory model with PEND and SEND policy","authors":"D. Barman, Barun Das","doi":"10.1504/IJMOR.2018.094057","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.094057","url":null,"abstract":"A continuous review economic order quantity (EOQ) model (with shortage) is modelled here. The inventory cost parameters are imprecise in nature. The model is developed for Partially Enforced Delay (PEND) and Strictly Enforced Delay (SEND) policies with lead time crashing cost. Here demand of the item is a linear function of selling price and usable lead time. For each policy, a set-up cost reduction technique has been applied to the model. Moreover, a statistical t-test has been used to compare the policies. We also present some numerical examples, sensitivity analysis and their discussions to stabilise the model.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127802776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-07-06DOI: 10.1504/IJMOR.2018.10013168
S. Asadi, H. Mansouri, M. Zangiabadi
This paper presents a wide-neighbourhood interior-point algorithm for P-horizontal linear complementarity problem. The convergence analysis is shown for the introduced wide neighbourhood of the central path by Ai and Zhang (2005) for monotone linear complementarity problem, and unifies the analysis for its constituent wide neighbourhoods. The Newton search directions are decomposed to the non-negative and non-positive parts, correspond to the parts of the right hand side. The achieved complexity bound is the same as the best obtained bound for the monotone linear complementarity problems, except that it is multiplied by a factor dependent on the handicap of the given problem.
{"title":"An interior-point algorithm for horizontal linear complementarity problems","authors":"S. Asadi, H. Mansouri, M. Zangiabadi","doi":"10.1504/IJMOR.2018.10013168","DOIUrl":"https://doi.org/10.1504/IJMOR.2018.10013168","url":null,"abstract":"This paper presents a wide-neighbourhood interior-point algorithm for P-horizontal linear complementarity problem. The convergence analysis is shown for the introduced wide neighbourhood of the central path by Ai and Zhang (2005) for monotone linear complementarity problem, and unifies the analysis for its constituent wide neighbourhoods. The Newton search directions are decomposed to the non-negative and non-positive parts, correspond to the parts of the right hand side. The achieved complexity bound is the same as the best obtained bound for the monotone linear complementarity problems, except that it is multiplied by a factor dependent on the handicap of the given problem.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：