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

Pesquisa Operacional最新文献

筛选
英文 中文
A COMPARISON OF THE PERFORMANCE OF THE GEOMETRIC PROCESS AND ITS EXTENSIONS 几何过程及其扩展性能的比较
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 0
A NEW STRATEGY TO SOLVE LINEAR INTEGER PROBLEMS WITH SIMPLEX DIRECTIONS 一种求解单纯形方向线性整数问题的新策略
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 1
A TYPOLOGY FOR MCDM METHODS BASED ON THE RATIONALITY OF THEIR PAIRWISE COMPARISON PROCEDURES 基于两两比较程序合理性的MCDM方法的类型学
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 10.1590/0101-7438.2022.042.00257730
A. Leoneti, L. Gomes
{"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}
引用次数: 0
PROPOSAL OF AN OPTIMAL REDUNDANCY AND RELIABILITY ALLOCATION APPROACH FOR DESIGNING COMPLEX SYSTEMS 一种复杂系统设计的冗余与可靠性优化分配方法
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 0
PARTIAL LEAST SQUARES - PATH MODELLING FOR EFFICIENCY ASSESSMENT IN THE COLOMBIAN PROFESSIONAL FOOTBALL LEAGUE 哥伦比亚职业足球联赛效率评估的偏最小二乘路径模型
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 0
BINOMIAL REAL OPTIONS MODEL WITH DYNAMIC PROGRAMMING APPLIED TO THE EVALUATION OF RAILWAY INFRASTRUCTURE PROJECTS IN BRAZIL 基于动态规划的二项实物期权模型在巴西铁路基础设施项目评价中的应用
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 0
NEW MULTI-OBJECTIVE VRP INSTANCES MODELLING MAIL DELIVERIES FOR RIO CLARO CITY, SÃO PAULO, BRAZIL 新的多目标VRP实例建模邮件交付里约热内卢克拉罗市，sÃo圣保罗，巴西
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 0
A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM 一个双目标多周期一维切削库存问题
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 10.1590/0101-7438.2022.042.00258432
Livia Maria Pierini, K. C. Poldi
{"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}
引用次数: 0
A FUZZY SCALE APPROACH TO THE THOR ALGORITHM 一种基于模糊尺度的thor算法
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 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}
引用次数: 2
ALMOST SQUARING THE SQUARE: OPTIMAL PACKINGS FOR NON-DECOMPOSABLE SQUARES 几乎平方的正方形:最佳包装的不可分解的正方形
Pesquisa Operacional Pub Date : 2022-01-01 DOI: 10.1590/0101-7438.2022.042.00262876
Vitor Pimenta dos Reis Arruda, L. Mirisola, N. Y. Soma
{"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}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信