One of the main problems with designing a production line is to find the optimal number of buffers between workstations in order to maximizes the throughput. This problem known as buffer allocation problem. Previous work in this problem focus on selecting a single buffer profile that has the maximum throughput. The objective in this paper would be to selecting from a large number of alternatives, the best subset of buffer profiles where its throughput are at its maximum. The ordinal optimization with optimal computing budget allocation approaches will be used to isolating the best subset of buffer profile, where its throughput is maximum, from the set of all alternatives. Numerical results show that the proposed algorithm finds the best subset of the puffer allocation with high probability and small replications numbers of samples.
{"title":"Efficient Approach for Selecting the Best Subset of Buffer Profile","authors":"M. Almomani","doi":"10.12816/0010700","DOIUrl":"https://doi.org/10.12816/0010700","url":null,"abstract":"One of the main problems with designing a production line is to find the optimal number of buffers between workstations in order to maximizes the throughput. This problem known as buffer allocation problem. Previous work in this problem focus on selecting a single buffer profile that has the maximum throughput. The objective in this paper would be to selecting from a large number of alternatives, the best subset of buffer profiles where its throughput are at its maximum. The ordinal optimization with optimal computing budget allocation approaches will be used to isolating the best subset of buffer profile, where its throughput is maximum, from the set of all alternatives. Numerical results show that the proposed algorithm finds the best subset of the puffer allocation with high probability and small replications numbers of samples.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131965842","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}
In the open vehicle routing problem (OVRP), the target would be to reduce the amount of vehicles after reducing the whole distance (or time) travelled. Every route begins at the depot and comes to an end at a customer, going to many customers, every once, en route, without returning to the depot. The demand of every customer has to be completely fullled by a single vehicle. The total demand serviced by each vehicle has to not go over vehicle capacity. A highly eective tabu search for open vehicle routing called Three Strategies Tabu Search (TSTS) heuristic for this problem is suggested. The TSTS depends on three strategies MOVE, EXCHANGE and SWAP. Computational results on fourteen standard benchmark problem instances demonstrate that the suggested TSTS is comparable in terms of solution quality for the best performing published heuristics.
{"title":"Applying Tabu Search in Finding an Efficient Solution for the OVRP","authors":"A. Hedar, M. Abdallah","doi":"10.12816/0010703","DOIUrl":"https://doi.org/10.12816/0010703","url":null,"abstract":"In the open vehicle routing problem (OVRP), the target would be to reduce the amount of vehicles after reducing the whole distance (or time) travelled. Every route begins at the depot and comes to an end at a customer, going to many customers, every once, en route, without returning to the depot. The demand of every customer has to be completely fullled by a single vehicle. The total demand serviced by each vehicle has to not go over vehicle capacity. A highly eective tabu search for open vehicle routing called Three Strategies Tabu Search (TSTS) heuristic for this problem is suggested. The TSTS depends on three strategies MOVE, EXCHANGE and SWAP. Computational results on fourteen standard benchmark problem instances demonstrate that the suggested TSTS is comparable in terms of solution quality for the best performing published heuristics.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133827542","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}
In the paper we prove some growth properties related to the maximum terms and maximum moduli of composite entire functions using generalised L � order and generalised L � -type as compared to the growths of their corresponding
本文用广义L阶和广义L型证明了复合完整函数的最大项和最大模的一些增长性质，并与之相比较
{"title":"Maximum terms, maximum moduli related and slowly changing functions based growth properties of composite entire functions","authors":"S. Datta, T. Biswas, Azizul Hoque","doi":"10.12816/0007249","DOIUrl":"https://doi.org/10.12816/0007249","url":null,"abstract":"In the paper we prove some growth properties related to the maximum terms and maximum moduli of composite entire functions using generalised L � order and generalised L � -type as compared to the growths of their corresponding","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121839631","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}
In this paper, we introduce weak non-Archimedean intuitionistic fuzzy metric space and study some properties of the topology induced by a weak non-Archimedean intuitionistic fuzzy metric and also we prove a common xed theorem for generalized -contractive mappings.
{"title":"A common xed point theorem in weak non-Archimedean intuitionistic fuzzy metric spaces","authors":"F. S. Erduran, C. Yildiz, S. Kutukcu","doi":"10.12816/0007248","DOIUrl":"https://doi.org/10.12816/0007248","url":null,"abstract":"In this paper, we introduce weak non-Archimedean intuitionistic fuzzy metric space and study some properties of the topology induced by a weak non-Archimedean intuitionistic fuzzy metric and also we prove a common xed theorem for generalized -contractive mappings.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122295266","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}
{"title":"Certain Differential Sandwich Theorem Using an Extended Generalized SăLăGean Operator and Extended Ruscheweyh Operator","authors":"Andrei Loriana","doi":"10.12816/0007251","DOIUrl":"https://doi.org/10.12816/0007251","url":null,"abstract":"","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124218310","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}
Let H be a complex Hilbert space and B(H) the algebra of all bounded linear operators on H. In this paper, we study the class of pairs of operators A;B 2 B(H) that have the following property, ATB = T implies B TA = T for all T 2 C1(H) (trace class operators). The main result is the equivalence between this character and the fact that the ultra-weak closure of the range of the elementary operator A;B dened on B(H) by A;B(X) = AXB X is equivalent to the generalized quasiadjoint operators. Some new C -algebras generated by a pair of operators A;B2 B(H) are also presented.
{"title":"ELEMENTARY OPERATORS AND NEW C -ALGEBRAS","authors":"S. Mécheri, Abdelatif Toulabia","doi":"10.12816/0007250","DOIUrl":"https://doi.org/10.12816/0007250","url":null,"abstract":"Let H be a complex Hilbert space and B(H) the algebra of all bounded linear operators on H. In this paper, we study the class of pairs of operators A;B 2 B(H) that have the following property, ATB = T implies B TA = T for all T 2 C1(H) (trace class operators). The main result is the equivalence between this character and the fact that the ultra-weak closure of the range of the elementary operator A;B dened on B(H) by A;B(X) = AXB X is equivalent to the generalized quasiadjoint operators. Some new C -algebras generated by a pair of operators A;B2 B(H) are also presented.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115745556","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}
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.
{"title":"An Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection","authors":"K. Borna, Morteza Asadi","doi":"10.12816/0007252","DOIUrl":"https://doi.org/10.12816/0007252","url":null,"abstract":"Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585686","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}
Spatial data warehouses (SDW) are used for executing analytical multidimensional queries along with spatial analysis. With recent boom in technology, access and integration of multiple, distributed, heterogeneous and autonomous information sources storing spatial or non-spatial data has become the need. For this purpose, we have proposed a simple star schema to store spatial and non-spatial information in data warehouse. We have also given a framework of activities for collecting data from information sources and organizing it in a geo-spatial data store for querying data and visualizing results. The paper has also discussed the most basic requirements for handling spatial data that will help to develop a user-centric spatial data warehouse.
{"title":"Requirements engineering for a user centric spatial data warehouse","authors":"Vinay Kumar, R. Thareja","doi":"10.12816/0007253","DOIUrl":"https://doi.org/10.12816/0007253","url":null,"abstract":"Spatial data warehouses (SDW) are used for executing analytical multidimensional queries along with spatial analysis. With recent boom in technology, access and integration of multiple, distributed, heterogeneous and autonomous information sources storing spatial or non-spatial data has become the need. For this purpose, we have proposed a simple star schema to store spatial and non-spatial information in data warehouse. We have also given a framework of activities for collecting data from information sources and organizing it in a geo-spatial data store for querying data and visualizing results. The paper has also discussed the most basic requirements for handling spatial data that will help to develop a user-centric spatial data warehouse.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125706671","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}
M. Almomani, Rosmanjawati Binti Abdul Rahman, Adam Baharum, S. Alwadi, Faisal Ababneh
AbstractSelection approaches are used to identify the best systemfrom a nite set of alternative systems. If it involves a smallnumber of alternatives, then Ranking and Selection is the rightprocedures to be used in order to select the best system. Nev-ertheless, for a case of a large number of alternatives we needto change our concern from nding the best system to nd-ing a good system with high probability by using the OrdinalOptimization procedure. Almomani and Abdul Rahman [1] hasproposed a new selection approach to select a good system whenthe number of alternatives is very large. In this paper, westudy the eciency of Almomani and Abdul Rahman [1] se-lection approach base on some parameters such as the initialsample size, increment in simulation samples, total budget,and the elapsed (execution) time. In doing so, we apply theirapproach on the M=M=1 queuing systems, in an attempt to de-termine the adequate choices on these parameters in order toget the best performance for the selection approach.
{"title":"The Effect of Simulation Parameters on the Selection Approach","authors":"M. Almomani, Rosmanjawati Binti Abdul Rahman, Adam Baharum, S. Alwadi, Faisal Ababneh","doi":"10.12816/0006196","DOIUrl":"https://doi.org/10.12816/0006196","url":null,"abstract":"AbstractSelection approaches are used to identify the best systemfrom a nite set of alternative systems. If it involves a smallnumber of alternatives, then Ranking and Selection is the rightprocedures to be used in order to select the best system. Nev-ertheless, for a case of a large number of alternatives we needto change our concern from nding the best system to nd-ing a good system with high probability by using the OrdinalOptimization procedure. Almomani and Abdul Rahman [1] hasproposed a new selection approach to select a good system whenthe number of alternatives is very large. In this paper, westudy the e\u000eciency of Almomani and Abdul Rahman [1] se-lection approach base on some parameters such as the initialsample size, increment in simulation samples, total budget,and the elapsed (execution) time. In doing so, we apply theirapproach on the M=M=1 queuing systems, in an attempt to de-termine the adequate choices on these parameters in order toget the best performance for the selection approach.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121135207","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}
In this paper, software implementation and analysis of a fuzzy modeling technique, which automatically generates the membership functions and fuzzy rules using SMRGT (Simple Membership Functions and Fuzzy Rules Generation Technique), and an application of this product is presented. SMRGT method, introduced by Z. Fuat TOPRAK [10], is a technique used to determine the key values and to generate the rule base of the system. It was introduced in a research article which aimed at fuzzy-modeling of the flow discharge in open canals. In this study, SFM (SMRGT Fuzzy Modeler), a software implementation of automated fuzzy rules generation that incorporates Toprak’s methodology, is provided and a few amendments which were previously used in data mining techniques are introduced. Also a brief analysis and critics of the SMRGT method is provided.
{"title":"Automated Fuzzy Model Generation and an Analysis of the Proposed Method","authors":"Cengiz Coşkun","doi":"10.12816/0006199","DOIUrl":"https://doi.org/10.12816/0006199","url":null,"abstract":"In this paper, software implementation and analysis of a fuzzy modeling technique, which automatically generates the membership functions and fuzzy rules using SMRGT (Simple Membership Functions and Fuzzy Rules Generation Technique), and an application of this product is presented. SMRGT method, introduced by Z. Fuat TOPRAK [10], is a technique used to determine the key values and to generate the rule base of the system. It was introduced in a research article which aimed at fuzzy-modeling of the flow discharge in open canals. In this study, SFM (SMRGT Fuzzy Modeler), a software implementation of automated fuzzy rules generation that incorporates Toprak’s methodology, is provided and a few amendments which were previously used in data mining techniques are introduced. Also a brief analysis and critics of the SMRGT method is provided.","PeriodicalId":210748,"journal":{"name":"International Journal of Open Problems in Computer Science and Mathematics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122397939","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
扫码关注我们
求助内容：
应助结果提醒方式：