Pub Date : 2022-01-01DOI: 10.1590/0101-7438.2022.042nspe1.00262123
Jiaqi Yin, Shaomin Wu
{"title":"A COMPARISON OF THE PERFORMANCE OF THE GEOMETRIC PROCESS AND ITS EXTENSIONS","authors":"Jiaqi Yin, Shaomin Wu","doi":"10.1590/0101-7438.2022.042nspe1.00262123","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042nspe1.00262123","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469914","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00255132
Bruno Luís Hönigmann Cereser, A. Oliveira, A. Moretti
{"title":"A NEW STRATEGY TO SOLVE LINEAR INTEGER PROBLEMS WITH SIMPLEX DIRECTIONS","authors":"Bruno Luís Hönigmann Cereser, A. Oliveira, A. Moretti","doi":"10.1590/0101-7438.2022.042.00255132","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00255132","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67468828","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00257730
A. Leoneti, L. Gomes
. MCDM methods have been proposed to select, rank, classify, or describe alternatives based on the process of pairwise comparison. While the typologies of MCDM methods present in the literature usually are focused on their amalgamation phase, this paper proposes a typology for classifying MCDM methods based on the rationality of their pairwise comparison procedures. Accordingly, four discriminants were used to provide support in choosing MCDM methods based on the typology proposed. The proposed typology allows the analyst to identify the type of rationality from MCDM methods that best fits the multicriteria problem.
{"title":"A TYPOLOGY FOR MCDM METHODS BASED ON THE RATIONALITY OF THEIR PAIRWISE COMPARISON PROCEDURES","authors":"A. Leoneti, L. Gomes","doi":"10.1590/0101-7438.2022.042.00257730","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00257730","url":null,"abstract":". MCDM methods have been proposed to select, rank, classify, or describe alternatives based on the process of pairwise comparison. While the typologies of MCDM methods present in the literature usually are focused on their amalgamation phase, this paper proposes a typology for classifying MCDM methods based on the rationality of their pairwise comparison procedures. Accordingly, four discriminants were used to provide support in choosing MCDM methods based on the typology proposed. The proposed typology allows the analyst to identify the type of rationality from MCDM methods that best fits the multicriteria problem.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469186","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042nspe1.00263499
P. A. A. Garcia, T. Neves, C. Jacinto, G. B. Alvarez, V. S. Garcia, G. S. Motta
{"title":"PROPOSAL OF AN OPTIMAL REDUNDANCY AND RELIABILITY ALLOCATION APPROACH FOR DESIGNING COMPLEX SYSTEMS","authors":"P. A. A. Garcia, T. Neves, C. Jacinto, G. B. Alvarez, V. S. Garcia, G. S. Motta","doi":"10.1590/0101-7438.2022.042nspe1.00263499","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042nspe1.00263499","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469604","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00254144
Enrique J. Delahoz-Dominguez, Tomás J. Fontalvo-Herrera, R. Zuluaga-Ortiz
{"title":"PARTIAL LEAST SQUARES - PATH MODELLING FOR EFFICIENCY ASSESSMENT IN THE COLOMBIAN PROFESSIONAL FOOTBALL LEAGUE","authors":"Enrique J. Delahoz-Dominguez, Tomás J. Fontalvo-Herrera, R. Zuluaga-Ortiz","doi":"10.1590/0101-7438.2022.042.00254144","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00254144","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67468723","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00260438
Ivan Ricardo Gartner
{"title":"BINOMIAL REAL OPTIONS MODEL WITH DYNAMIC PROGRAMMING APPLIED TO THE EVALUATION OF RAILWAY INFRASTRUCTURE PROJECTS IN BRAZIL","authors":"Ivan Ricardo Gartner","doi":"10.1590/0101-7438.2022.042.00260438","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00260438","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469253","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00257140
Samuel L. Azorli, Luis A. A. Meira
{"title":"NEW MULTI-OBJECTIVE VRP INSTANCES MODELLING MAIL DELIVERIES FOR RIO CLARO CITY, SÃO PAULO, BRAZIL","authors":"Samuel L. Azorli, Luis A. A. Meira","doi":"10.1590/0101-7438.2022.042.00257140","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00257140","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469364","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00258432
Livia Maria Pierini, K. C. Poldi
. In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize the cost of production associated with the total length of cut objects (waste) and the inventory costs related to objects and items. A mathematical model is presented and heuristically solved by a column generation method. Computational tests were performed using the Weighted Sum method, the ε -Constraint method and a variation of the Benson method. The Pearson correlation coefficient was calculated in order to investigate the trade-off between the conflicting objectives of the problem. The results confirmed a strong negative correlation between the objective functions of the problem. All the applied scalar methods were able to find multiple efficient solutions for the problem in a reasonable computational time; however, the ε -Constraint and the modified Benson methods performed better.
{"title":"A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM","authors":"Livia Maria Pierini, K. C. Poldi","doi":"10.1590/0101-7438.2022.042.00258432","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00258432","url":null,"abstract":". In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize the cost of production associated with the total length of cut objects (waste) and the inventory costs related to objects and items. A mathematical model is presented and heuristically solved by a column generation method. Computational tests were performed using the Weighted Sum method, the ε -Constraint method and a variation of the Benson method. The Pearson correlation coefficient was calculated in order to investigate the trade-off between the conflicting objectives of the problem. The results confirmed a strong negative correlation between the objective functions of the problem. All the applied scalar methods were able to find multiple efficient solutions for the problem in a reasonable computational time; however, the ε -Constraint and the modified Benson methods performed better.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469380","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00261547
T. Elacoste, Catia Maria dos Santos Machado, A. Longaray, Luiz Flavio Autran Monteiro
{"title":"A FUZZY SCALE APPROACH TO THE THOR ALGORITHM","authors":"T. Elacoste, Catia Maria dos Santos Machado, A. Longaray, Luiz Flavio Autran Monteiro","doi":"10.1590/0101-7438.2022.042.00261547","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00261547","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469755","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 : 2022-01-01DOI: 10.1590/0101-7438.2022.042.00262876
Vitor Pimenta dos Reis Arruda, L. Mirisola, N. Y. Soma
. We consider the problem of finding the minimum uncovered area (trim loss) when tiling non-overlapping distinct integer-sided squares in an N × N square container such that the squares are placed with their edges parallel to those of the container. We find such trim losses and associated optimal packings for all container sizes N from 1 to 101, through an independently developed adaptation of Ian Gambini’s enumerative algorithm. The results were published as a new sequence to The On-Line Encyclopedia of Integer Sequences ® . These are the first known results for optimal packings in non-decomposable squares
。我们考虑在N × N方形容器中平铺不重叠的不同整数面正方形时寻找最小未覆盖面积(修剪损失)的问题，使得正方形的边缘与容器的边缘平行。通过独立开发的Ian Gambini的枚举算法，我们发现了所有容器尺寸N从1到101的修剪损失和相关的最佳包装。结果作为一个新序列发表在The online Encyclopedia of Integer Sequences®上。这是已知的第一个在不可分解的正方形中最优填充的结果
{"title":"ALMOST SQUARING THE SQUARE: OPTIMAL PACKINGS FOR NON-DECOMPOSABLE SQUARES","authors":"Vitor Pimenta dos Reis Arruda, L. Mirisola, N. Y. Soma","doi":"10.1590/0101-7438.2022.042.00262876","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00262876","url":null,"abstract":". We consider the problem of finding the minimum uncovered area (trim loss) when tiling non-overlapping distinct integer-sided squares in an N × N square container such that the squares are placed with their edges parallel to those of the container. We find such trim losses and associated optimal packings for all container sizes N from 1 to 101, through an independently developed adaptation of Ian Gambini’s enumerative algorithm. The results were published as a new sequence to The On-Line Encyclopedia of Integer Sequences ® . These are the first known results for optimal packings in non-decomposable squares","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469893","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
扫码关注我们
求助内容：
应助结果提醒方式：