Pub Date : 2023-03-13DOI: 10.1590/0101-7438.2023.043.00267882
Allan Jonathan da Silva, J. Baczynski, J. Vicente
. The COS method was introduced in Fang & Oosterlee (2008) and then was applied to pricing a variety of stock options for continuous random variables. This paper adapts the Fourier-cosine series (COS) method to recover discrete probability mass functions. We approximate mixture and compound probability distributions with cosine series. Enormous precision and computational speed are the qualities of the function estimates here obtained. We also develop the pricing framework to trade derivatives subject to discrete random variables. We apply the method to calculate, for the first time, the price of an interest rate derivative of recent vintage introduced in the Brazilian financial market. Parameter calibration confirms the quality of the model.
{"title":"RECOVERING PROBABILITY FUNCTIONS WITH FOURIER SERIES","authors":"Allan Jonathan da Silva, J. Baczynski, J. Vicente","doi":"10.1590/0101-7438.2023.043.00267882","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00267882","url":null,"abstract":". The COS method was introduced in Fang & Oosterlee (2008) and then was applied to pricing a variety of stock options for continuous random variables. This paper adapts the Fourier-cosine series (COS) method to recover discrete probability mass functions. We approximate mixture and compound probability distributions with cosine series. Enormous precision and computational speed are the qualities of the function estimates here obtained. We also develop the pricing framework to trade derivatives subject to discrete random variables. We apply the method to calculate, for the first time, the price of an interest rate derivative of recent vintage introduced in the Brazilian financial market. Parameter calibration confirms the quality of the model.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470550","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 : 2023-03-13DOI: 10.1590/0101-7438.2023.043.00263680
Marianna Cruz Campos Pontarolo, Luciano Azevedo de Souza, Guilherme Regal de Castro, Danny Aronson, N. C. R. Bergiante
. This paper aims to support decision-making for the return of classes to determine actions to reduce the problems arising from the pandemic through a multi-methodological approach using Value-focused thinking (VFT) and Rich Picture (RP). The case study includes a Brazilian small university, in a region with social and economic vulnerability. Six stakeholders representing the students, the municipality community and the university were interviewed from which the hierarchy of fundamental objectives and an objectives’ network unfolded in education, health, and community were created. Even though health concerns were shared by all stakeholders, these networks revealed a variety of perspectives not typically discussed in large universities, such as access to information and communication technologies; awareness of biosafety measures; and real estate vacancy. These findings indicate that future research should address the specific needs of small universities in vulnerable cities, particularly those in developing and underdeveloped countries, where universities’ presence fosters the economy.
{"title":"UNIVERSITIES IN SMALL BRAZILIAN CITIES: ANALYSIS OF THE IMPACT OF COVID 19 USING VALUE-FOCUSED THINKING","authors":"Marianna Cruz Campos Pontarolo, Luciano Azevedo de Souza, Guilherme Regal de Castro, Danny Aronson, N. C. R. Bergiante","doi":"10.1590/0101-7438.2023.043.00263680","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00263680","url":null,"abstract":". This paper aims to support decision-making for the return of classes to determine actions to reduce the problems arising from the pandemic through a multi-methodological approach using Value-focused thinking (VFT) and Rich Picture (RP). The case study includes a Brazilian small university, in a region with social and economic vulnerability. Six stakeholders representing the students, the municipality community and the university were interviewed from which the hierarchy of fundamental objectives and an objectives’ network unfolded in education, health, and community were created. Even though health concerns were shared by all stakeholders, these networks revealed a variety of perspectives not typically discussed in large universities, such as access to information and communication technologies; awareness of biosafety measures; and real estate vacancy. These findings indicate that future research should address the specific needs of small universities in vulnerable cities, particularly those in developing and underdeveloped countries, where universities’ presence fosters the economy.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67469831","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 : 2023-03-13DOI: 10.1590/0101-7438.2023.043.00269080
Juan Parra Galvez, D. Borenstein
. This work considers the strategic Supply Chain Network Design (SCND) problem, which is to define the number and location of facilities, and the flow of products among them to fulfilling a long-term deterministic demand. A two-phase heuristic approach was specially developed to solve large scale problems in reasonable time, extending a previous algorithm introduced in Farias et al. (2017). In the construction phase, a multi-start approach was developed to generate diversified initial solutions from each new iteration of a layered-based rounding heuristic. In the second phase, a local search heuristic improves the solution provided by the rounding method. The solution method is evaluated using randomly generated instances, and a evaluated strategic of marketing in a real case study applied to a company to redesigning the supply chain to two lines of products.The obtained results evidence the effectiveness and flexibility of the developed approach for handling very large instances.
{"title":"LARGE SCALE SUPPLY CHAIN NETWORK DESIGN: AN EFFECTIVE HEURISTIC APPROACH","authors":"Juan Parra Galvez, D. Borenstein","doi":"10.1590/0101-7438.2023.043.00269080","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00269080","url":null,"abstract":". This work considers the strategic Supply Chain Network Design (SCND) problem, which is to define the number and location of facilities, and the flow of products among them to fulfilling a long-term deterministic demand. A two-phase heuristic approach was specially developed to solve large scale problems in reasonable time, extending a previous algorithm introduced in Farias et al. (2017). In the construction phase, a multi-start approach was developed to generate diversified initial solutions from each new iteration of a layered-based rounding heuristic. In the second phase, a local search heuristic improves the solution provided by the rounding method. The solution method is evaluated using randomly generated instances, and a evaluated strategic of marketing in a real case study applied to a company to redesigning the supply chain to two lines of products.The obtained results evidence the effectiveness and flexibility of the developed approach for handling very large instances.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470196","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 : 2023-03-13DOI: 10.1590/0101-7438.2023.043.00266962
Massika Ikhlef, Méziane Aïder
. In this paper, we propose a multi-objective evolutionary metaheuristic approach based on the Pareto Ant Colony Optimization (P-ACO) metaheuristic and the non-dominated genetic sorting algorithms (NSGA II and NSGA III) to solve a bi-objective portfolio optimization problem. P-ACO is used to select the best assets composing the efficient portfolio. Then, NSGA II and NSGA III are separately used to find the proportional weights of the budget allocated to the selected portfolio. The results we obtained by these two algorithms were compared to designate the best performing algorithm. Finally, we performed another comparison between our results and those of an exact method used for the same problem. The numerical experiments performed on a set of instances from the literature revealed that the combination of the ant colony optimization metaheuristic and the NSGA III genetic algorithm that we proposed most often gave much better results than both the combination of the ant colony optimization metaheuristic and NSGA II on the one hand and the iterative approach on the other hand.
{"title":"MULTIOBJECTIVE EVOLUTIONARY METAHEURISTIC APPROACH TO THE CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM","authors":"Massika Ikhlef, Méziane Aïder","doi":"10.1590/0101-7438.2023.043.00266962","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00266962","url":null,"abstract":". In this paper, we propose a multi-objective evolutionary metaheuristic approach based on the Pareto Ant Colony Optimization (P-ACO) metaheuristic and the non-dominated genetic sorting algorithms (NSGA II and NSGA III) to solve a bi-objective portfolio optimization problem. P-ACO is used to select the best assets composing the efficient portfolio. Then, NSGA II and NSGA III are separately used to find the proportional weights of the budget allocated to the selected portfolio. The results we obtained by these two algorithms were compared to designate the best performing algorithm. Finally, we performed another comparison between our results and those of an exact method used for the same problem. The numerical experiments performed on a set of instances from the literature revealed that the combination of the ant colony optimization metaheuristic and the NSGA III genetic algorithm that we proposed most often gave much better results than both the combination of the ant colony optimization metaheuristic and NSGA II on the one hand and the iterative approach on the other hand.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470057","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 : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00275212
Larissa Tebaldi Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Franklina Maria Bragion Toledo
Irregular strip packing problems are present in a wide variety of industrial sectors, such as the garment, footwear, furniture and metal industry. The goal is to find a layout in which an object will be cut into small pieces with minimum raw-material waste. Once a layout is obtained, it is necessary to determine the path that the cutting tool has to follow to cut the pieces from the layout. In the latter, the goal is to minimize the cutting distance (or time). Although industries frequently use this solution sequence, the trade-off between the packing and the cutting path problems can significantly impact the production cost and productivity. A layout with minimum raw-material waste, obtained through the packing problem resolution, can imply a longer cutting path compared to another layout with more material waste but a shorter cutting path, obtained through an integrated strategy. Layouts with shorter cutting path are worthy of consideration because they may improve the cutting process productivity. In this paper, both problems are solved together using a biobjective matheuristic based on the Biased Random-Key Genetic Algorithm. Our approach uses this algorithm to select a subset of the no-fit polygons edges to feed the mathematical model, which will compute the layout waste and cutting path length. Solving both strip packing and cutting path problems simultaneously allows the decision-maker to analyze the compromise between the material waste and the cutting path distance. As expected, the computational results showed the trade-off’s relevance between these problems and presented a set of solutions for each instance solved.
{"title":"A BIOBJECTIVE MATHEURISTIC FOR THE INTEGRATED SOLUTION OF THE IRREGULAR STRIP PACKING AND THE CUTTING PATH DETERMINATION PROBLEMS","authors":"Larissa Tebaldi Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Franklina Maria Bragion Toledo","doi":"10.1590/0101-7438.2023.043.00275212","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00275212","url":null,"abstract":"Irregular strip packing problems are present in a wide variety of industrial sectors, such as the garment, footwear, furniture and metal industry. The goal is to find a layout in which an object will be cut into small pieces with minimum raw-material waste. Once a layout is obtained, it is necessary to determine the path that the cutting tool has to follow to cut the pieces from the layout. In the latter, the goal is to minimize the cutting distance (or time). Although industries frequently use this solution sequence, the trade-off between the packing and the cutting path problems can significantly impact the production cost and productivity. A layout with minimum raw-material waste, obtained through the packing problem resolution, can imply a longer cutting path compared to another layout with more material waste but a shorter cutting path, obtained through an integrated strategy. Layouts with shorter cutting path are worthy of consideration because they may improve the cutting process productivity. In this paper, both problems are solved together using a biobjective matheuristic based on the Biased Random-Key Genetic Algorithm. Our approach uses this algorithm to select a subset of the no-fit polygons edges to feed the mathematical model, which will compute the layout waste and cutting path length. Solving both strip packing and cutting path problems simultaneously allows the decision-maker to analyze the compromise between the material waste and the cutting path distance. As expected, the computational results showed the trade-off’s relevance between these problems and presented a set of solutions for each instance solved.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135658943","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 : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00262789
Almir Garnier Santos, L. Pessôa, C. Mota, E. A. Frej
{"title":"A FITRADEOFF-BASED APPROACH FOR STRATEGIC DECISIONS ON MILITARY BUDGET","authors":"Almir Garnier Santos, L. Pessôa, C. Mota, E. A. Frej","doi":"10.1590/0101-7438.2023.043spe1.00262789","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00262789","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470512","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 : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00270580
Adiel Teixeira de Almeida, E. A. Frej, A. P. C. S. Costa
{"title":"SPECIAL ISSUE ON BUILDING MULTICRITERIA DECISION MODELS WITH FITRADEOFF","authors":"Adiel Teixeira de Almeida, E. A. Frej, A. P. C. S. Costa","doi":"10.1590/0101-7438.2023.043spe1.00270580","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00270580","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470774","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 : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00272982
Vishal Gupta, Pooja Dhawan, Jonty Jindal, Manu Verma
In the present article, some fixed point theorems are investigated for two pairs of weakly compatible maps through (Ω, ∆)-type weak contractive maps in the framework of fuzzy metric spaces. The results studied in this workpiece are generalizations of some recent results existing in literature. Also, some illustrative examples are presented in last section to check the authenticity of our results.
{"title":"SOME NOVEL FIXED POINT RESULTS FOR (Ω, ∆)-WEAK CONTRACTION CONDITION IN COMPLETE FUZZY METRIC SPACES","authors":"Vishal Gupta, Pooja Dhawan, Jonty Jindal, Manu Verma","doi":"10.1590/0101-7438.2023.043.00272982","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00272982","url":null,"abstract":"In the present article, some fixed point theorems are investigated for two pairs of weakly compatible maps through (Ω, ∆)-type weak contractive maps in the framework of fuzzy metric spaces. The results studied in this workpiece are generalizations of some recent results existing in literature. Also, some illustrative examples are presented in last section to check the authenticity of our results.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136202392","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
扫码关注我们
求助内容：
应助结果提醒方式：