发布求助
文献互助 智能选刊 最新文献

Int. J. Math. Oper. Res.最新文献

筛选
英文 中文
Selection of materials by multi-criteria methods applied to the side of a self-supporting structure for light vehicles 应用多标准方法选择轻型车辆自支撑结构侧面的材料
Int. J. Math. Oper. Res. Pub Date : 2020-03-09 DOI: 10.1504/ijmor.2020.105844
R. Loor, Javier Martinez Gomez, J. Rocha-Hoyos, Edilberto Antonio Llanes Cedeño
{"title":"Selection of materials by multi-criteria methods applied to the side of a self-supporting structure for light vehicles","authors":"R. Loor, Javier Martinez Gomez, J. Rocha-Hoyos, Edilberto Antonio Llanes Cedeño","doi":"10.1504/ijmor.2020.105844","DOIUrl":"https://doi.org/10.1504/ijmor.2020.105844","url":null,"abstract":"The selection of materials is an important stage in the design and development of products, but considering the enormous amount of materials available on the market that have different properties and characteristics, defining suitable and ideal alternatives is a difficult task. Within the automotive area there is a tendency to develop vehicles with greater efficiency and capacity, keeping aside the economic implications without underestimating the functionality of the materials. The use of multi-criteria methods (MCDM) allows the establishment of a reliable selection methodology, due to the interaction between each of the criteria with statistical methods that converge in a single solution. The methodology used in this study was based on the application of MCDM methods, and the comparison between them to determine a convergence in the alternatives of greater potential for the structural section of vehicles. Four methods were evaluated: TOPSIS, COPRAS, VIKOR, PROMETHEE II, obtaining that for all the methods the best material corresponds to the Martensitic Steel YS1200, being this the most appropriate one when fulfilling structural requirements, as well as providing a reduction of weight and price.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116882222","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}
引用次数: 1
Trapezoidal intuitionistic fuzzy number with some arithmetic operations and its application on reliability evaluation 梯形直觉模糊数及其在可靠性评价中的应用
Int. J. Math. Oper. Res. Pub Date : 2020-02-01 DOI: 10.1504/IJMOR.2013.050512
A. K. Shaw, T. Roy
{"title":"Trapezoidal intuitionistic fuzzy number with some arithmetic operations and its application on reliability evaluation","authors":"A. K. Shaw, T. Roy","doi":"10.1504/IJMOR.2013.050512","DOIUrl":"https://doi.org/10.1504/IJMOR.2013.050512","url":null,"abstract":"In fuzzy mathematics fuzzy system reliability can be analysed by fuzzy sets. We can use various types of fuzzy sets for that analyzing the fuzzy system reliability but here we specially used intuitionistic fuzzy set theory. At first, TrIFNs and their arithmetic operations are introduced.\u0000 Expressions for computing the fuzzy reliability of a series system, parallel system, series-parallel and parallel-series system following TrIFNs have been described. Here an imprecise failure to start of a truck is taken. To compute the imprecise failure of the above said system, failure of\u0000 each component of the systems is represented by Trapezoidal Intuitionistic Fuzzy Number. This process can be utilise to measure the failure is various aspects like portfolio in stock market etc. The numerical expression also calculated and presented in this paper for the failure to start of\u0000 a truck using TrIFN.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115426465","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}
引用次数: 34
Numerical methods for first order uncertain stochastic differential equations 一阶不确定随机微分方程的数值方法
Int. J. Math. Oper. Res. Pub Date : 2019-12-20 DOI: 10.1504/IJMOR.2019.10016984
J. Chirima, Eriyoti Chikodza, S. D. Hove-Musekwa
{"title":"Numerical methods for first order uncertain stochastic differential equations","authors":"J. Chirima, Eriyoti Chikodza, S. D. Hove-Musekwa","doi":"10.1504/IJMOR.2019.10016984","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10016984","url":null,"abstract":"Uncertain stochastic calculus is a relatively new sub discipline of mathematics. This branch of mathematical sciences seeks to develop models that capture aleatory and epistemic features of generic uncertainty in dynamical systems. The growth of uncertain stochastic theory has given birth to a novel class of differential equations called uncertain stochastic differential equations (USDEs). Exact and analytic solutions to this family of differential equations are not always available. In such cases, numerical analysis provides a gateway to approximate solutions. This paper examines a Runge-Kutta method for solving USDEs. Before examining and applying the Runge-Kutta method, the paper states and proves the existence and uniqueness theorem. The Runge-Kutta method is then applied to solve an American call option pricing problem. This numerical algorithm proves to be effective and efficient because it produces almost the same results as compared to Chen's analytic formula and the classical Black-Scholes model.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134244490","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}
引用次数: 3
Multi-release software reliability growth assessment: an approach incorporating fault reduction factor and imperfect debugging 多版本软件可靠性增长评估:一种结合故障减少因子和不完全调试的方法
Int. J. Math. Oper. Res. Pub Date : 2019-09-20 DOI: 10.1504/IJMOR.2019.10016194
A. Aggarwal, N. Gandhi, Vibha Verma, Abhishek Tandon
{"title":"Multi-release software reliability growth assessment: an approach incorporating fault reduction factor and imperfect debugging","authors":"A. Aggarwal, N. Gandhi, Vibha Verma, Abhishek Tandon","doi":"10.1504/IJMOR.2019.10016194","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10016194","url":null,"abstract":"In the last few decades, a plenty of software reliability growth models with diverse parameters have been formulated and proposed to assess software trustworthiness. Fault reduction factor (FRF) is one such significant factor which has been incorporated in numerous reliability modelling researches in past and results have proved its importance on reliability growth phenomenon. To keep pace with rising demands of the market, software development firms keep upgrading their products in terms of new features and by providing rectification of previously reported defects. In this paper, an SRGM based on NHPP integrating imperfect debugging and time-variable FRF is proposed for multi-release software systems. The model is then tested on the failure datasets of multiple releases of Tandem Computers and Firefox OSS. The experimental results for each release are compared with their corresponding perfect debugging model. Results illustrate that the proposed model fits the failure data well, outperforming perfect debugging model.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123661517","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}
引用次数: 18
Solid transportation problem under fully fuzzy environment 全模糊环境下的固体运输问题
Int. J. Math. Oper. Res. Pub Date : 2019-09-20 DOI: 10.1504/ijmor.2019.10024149
A. Baidya, U. Bera
{"title":"Solid transportation problem under fully fuzzy environment","authors":"A. Baidya, U. Bera","doi":"10.1504/ijmor.2019.10024149","DOIUrl":"https://doi.org/10.1504/ijmor.2019.10024149","url":null,"abstract":"Transportation policy seeks to improve agency freight and cargo management and enhance sustainable, efficient and effective transportation operations. In this paper, the profit maximisation solid transportation problem under fully fuzzy environment is formulated. In this model formulation the transportation parameters and decision variables both are considered as fuzzy in nature. Also, an additional new constraint on the complete budget at each destination is imposed. Five new approaches are proposed to defuzzify the fully fuzzy model. The nearest interval approximation is used to convert the fully fuzzy model into its equivalent interval form. The interactive fuzzy satisfying technique and different interval approaches are used to determine the crisp equivalent of the objective function and constraints of the proposed model. The reduced deterministic model was solved using generalised reduced gradient techniques (GRG technique). A numerical example is provided to illustrate the model and methodology and finally, the obtained results are compared.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114520610","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}
引用次数: 2
A boundary-point LP solution method and its application to dense linear programs 边界点LP解法及其在密集线性规划中的应用
Int. J. Math. Oper. Res. Pub Date : 2019-08-09 DOI: 10.1504/IJMOR.2019.10023112
Chanaka Edirisinghe, W. Ziemba
{"title":"A boundary-point LP solution method and its application to dense linear programs","authors":"Chanaka Edirisinghe, W. Ziemba","doi":"10.1504/IJMOR.2019.10023112","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10023112","url":null,"abstract":"This paper presents a linear programming solution method that generates a sequence of boundary-points belonging to faces of the feasible polyhedron. The method is based on a steepest descent search by iteratively optimising over a two-dimensional cross section of the polyhedron. It differs from extreme point algorithms such as the simplex method in that optimality is detected by identifying an optimal face of the polyhedron which is not necessarily an extreme point. It also differs from the polynomial-time methods such as the ellipsoid algorithm or projective scaling method that avoids the boundary of the feasible polyhedron. Limited computational analysis with an experimental code of the method, EZLP, indicates that our method performs quite well in total solution time when the number of variables and the density of the constraint matrix increase.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004038","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}
引用次数: 0
Using a multi-criteria decision making approach to select the optimal freeway rout (case study: Isfahan-Shiraz Freeway) 采用多准则决策方法选择最优高速公路路线(以伊斯法罕-设拉子高速公路为例)
Int. J. Math. Oper. Res. Pub Date : 2019-08-09 DOI: 10.1504/IJMOR.2019.10023116
A. Vanaki, Jalil Heidary Dahooie, Navid Mohammadi
{"title":"Using a multi-criteria decision making approach to select the optimal freeway rout (case study: Isfahan-Shiraz Freeway)","authors":"A. Vanaki, Jalil Heidary Dahooie, Navid Mohammadi","doi":"10.1504/IJMOR.2019.10023116","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10023116","url":null,"abstract":"Road construction problems are one of the important factors in countries. The effects of multiple parameters on the decision making process to determine the optimal route have made this choice a specialised issue for decision-makers. In this regard, this paper aims to select the optimal route for Isfahan-Shiraz freeway using MADM approaches. For this purpose, in order to weight and select the optimal route, the extended dynamic fuzzy GRA method is used. The results show that road longevity, views of the NGOs, route integrity and ease of tracking are identified as the highest-weighted criteria in the prioritisation of the route variant. To evaluate the validity of the results of the GRA method, the problem is examined by using the, COPRAS-IVIF, ARAS-IVTF, WASPAS-IVIF, TOPSIS-IVIF and MULTIMOORA-IVIF methods. In addition, route 3 that takes priority over others is also chosen, in practice, as the main basis for the work.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087991","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}
引用次数: 1
MAP/PH(1), PH(2)/2 finite retrial inventory system with service facility, multiple vacations for servers MAP/PH(1)， PH(2)/2有限再审库存系统，具有服务设施，服务器可多次休假
Int. J. Math. Oper. Res. Pub Date : 2019-08-09 DOI: 10.1504/IJMOR.2019.10023110
C. Suganya, B. Sivakumar
{"title":"MAP/PH(1), PH(2)/2 finite retrial inventory system with service facility, multiple vacations for servers","authors":"C. Suganya, B. Sivakumar","doi":"10.1504/IJMOR.2019.10023110","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10023110","url":null,"abstract":"In this paper, we consider a retrial (s, S) inventory system with multiple server vacations for two heterogeneous servers. We have assumed that the customers arrive according to a Markovian arrival process and two parallel servers who provide heterogeneous phase type services to customers. The lead times for the orders are assumed to have independent and identical exponential distributions. The vacation times of both servers are assumed to be independent and identically distributed exponential random variables. The arriving customer who finds both servers are busy or both servers are on vacation, joins an orbit of finite size. These orbiting customers retry for their demand after a random time, which is assumed to be exponential distribution. Some important performance measures are obtained and the optimality of an expected total cost rate is shown through numerical illustration.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133266093","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}
引用次数: 9
A new ranking technique on heptagonal fuzzy numbers to solve fuzzy transportation problem 求解模糊运输问题的一种新的七方模糊数排序技术
Int. J. Math. Oper. Res. Pub Date : 2019-08-09 DOI: 10.1504/IJMOR.2019.10023114
P. Malini
{"title":"A new ranking technique on heptagonal fuzzy numbers to solve fuzzy transportation problem","authors":"P. Malini","doi":"10.1504/IJMOR.2019.10023114","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10023114","url":null,"abstract":"In this work, a general fuzzy transportation problem model is discussed and proposed a new ranking procedure to the heptagonal fuzzy numbers using which convert any fuzzy valued transportation problem to a crisp valued transportation problem which then could be solved using the MODI method. The proposed method serves as an efficient method in ranking heptagonal fuzzy numbers which is illustrated through a numerical example. The purpose of this paper is to give a new ranking index to rank fuzzy numbers effectively. Fuzzy numbers cannot be easily ordered as ordinary real numbers. Several proposals have addressed this problem, each with some drawbacks and limitations. This paper renounces to the idea of finding a universal ordering method for fuzzy numbers.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615802","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}
引用次数: 4
A new approach for solving fully fuzzy linear programming problem 求解全模糊线性规划问题的一种新方法
Int. J. Math. Oper. Res. Pub Date : 2019-08-09 DOI: 10.1504/IJMOR.2019.10023109
S. Das, T. Mandal, D. Behera
{"title":"A new approach for solving fully fuzzy linear programming problem","authors":"S. Das, T. Mandal, D. Behera","doi":"10.1504/IJMOR.2019.10023109","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10023109","url":null,"abstract":"This paper presents the limitations of citeku for solving a fully fuzzy linear programming (FFLP) problem. And accordingly to overcome these limitations a new method has been proposed by using the ranking function. We have considered a FFLP problem with mixed constraints where decision variables are represented by non-negative fuzzy numbers. Triangular convex normalised fuzzy sets are considered for the analysis. To illustrate the applicability and efficiency of the proposed method various numerical examples have been solved and obtained results are discussed.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132756302","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}
引用次数: 9
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信