Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00269174
Jose Rodriguez-Melquiades, Lourdes Ramirez Cerna
Research related to vehicle routing and its applications reveals the interest in supporting the authorities in solving society’s problems. In this way, a bi-objective model of mixed integer linear programming and metaheuristics based on genetic algorithm and local search, applied to reverse logistics by green open vehicle routing, is presented. The process consists of collecting solid urban waste at collection points, contributing to urban sustainability through the route plan determined by the proposal, optimizing distances and costs as well; it also measures the fuel consumption of the vehicles from their departure from the depot to the last collection point, as well as the CO2 emissions during routing. The proposals, implemented in GLPK and Python, obtain results in various scenarios. The model generates solutions quickly in scenarios between 5 and 25 collection points. For larger scenarios it does not find solutions within the time limit of 7200 seconds. The metaheuristics have greater potential as for 31 collection points, the processing time was 2.3 seconds which is a good indication for larger scenarios. Three Sectors of Trujillo city are tested to evaluate our proposal.
{"title":"REVERSE LOGISTICS BASED ON GREEN OPEN VEHICLE ROUTING FOR WASTE COLLECTION IN THE URBAN CONTEXT","authors":"Jose Rodriguez-Melquiades, Lourdes Ramirez Cerna","doi":"10.1590/0101-7438.2023.043.00269174","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00269174","url":null,"abstract":"Research related to vehicle routing and its applications reveals the interest in supporting the authorities in solving society’s problems. In this way, a bi-objective model of mixed integer linear programming and metaheuristics based on genetic algorithm and local search, applied to reverse logistics by green open vehicle routing, is presented. The process consists of collecting solid urban waste at collection points, contributing to urban sustainability through the route plan determined by the proposal, optimizing distances and costs as well; it also measures the fuel consumption of the vehicles from their departure from the depot to the last collection point, as well as the CO2 emissions during routing. The proposals, implemented in GLPK and Python, obtain results in various scenarios. The model generates solutions quickly in scenarios between 5 and 25 collection points. For larger scenarios it does not find solutions within the time limit of 7200 seconds. The metaheuristics have greater potential as for 31 collection points, the processing time was 2.3 seconds which is a good indication for larger scenarios. Three Sectors of Trujillo city are tested to evaluate our proposal.","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":"136202232","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.00258055
B. Torres, Juliana de Castro Reis, J. C. S. D. Mello
. We propose two-dimensional representations for the efficient frontier for two different Network DEA (NDEA) models. Both representations follow a previous study that developed a generalization of the two-dimensional representation method for the classic DEA using a new form of linearization. The graphical representation of the efficient frontier allows managers and decision-makers unfamiliar with linear programming and DEA to understand the results obtained simply and clearly. In this study, we can obtain graphs that provide information about the efficiencies of each DMU. Furthermore, for the NDEA with an efficiency decomposition approach, it is possible to obtain a graph to evaluate the technical efficiency for each stage, as well as for the overall efficiency. The NDEA model based on efficiency composition only produces one graph. However, this unique representation shows the stage-level and the overall process level information within the same graph.
{"title":"TWO-DIMENSIONAL REPRESENTATION FOR TWO-STAGE NETWORK DEA MODELS","authors":"B. Torres, Juliana de Castro Reis, J. C. S. D. Mello","doi":"10.1590/0101-7438.2022.042.00258055","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00258055","url":null,"abstract":". We propose two-dimensional representations for the efficient frontier for two different Network DEA (NDEA) models. Both representations follow a previous study that developed a generalization of the two-dimensional representation method for the classic DEA using a new form of linearization. The graphical representation of the efficient frontier allows managers and decision-makers unfamiliar with linear programming and DEA to understand the results obtained simply and clearly. In this study, we can obtain graphs that provide information about the efficiencies of each DMU. Furthermore, for the NDEA with an efficiency decomposition approach, it is possible to obtain a graph to evaluate the technical efficiency for each stage, as well as for the overall efficiency. The NDEA model based on efficiency composition only produces one graph. However, this unique representation shows the stage-level and the overall process level information within the same graph.","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":"67469339","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.00246977
Carlos Andrés Oñate Ochoa, Daniel Verdugo Insua, J. C. Leyva López, Jesús Jaime Solano Noriega
{"title":"RANKING OF A SET OF ACCOUNTS RECEIVABLE STRATEGIES IN A MEXICAN REGIONAL COMPANY BASED ON A MULTICRITERIA APPROACH","authors":"Carlos Andrés Oñate Ochoa, Daniel Verdugo Insua, J. C. Leyva López, Jesús Jaime Solano Noriega","doi":"10.1590/0101-7438.2022.042.00246977","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00246977","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":"67469080","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.00261044
Evelyn Michelle Henrique Braga, Luiz Leduíno de Salles Neto
. One of the strategies used to optimize production processes is to define the best layout. For this, the relative positioning of the various equipment, areas, or functional activities inside the company is studied. Proper arrangement of facilities will result in shorter process times and higher productivity. In general, the objective function of the facility layout problem (FLP) is to reduce the total material handling cost. Although over six decades have been passed since the first work on FLP modeling was published, research on many aspects of this problem is still in an early stage and needs to be further explored, which motivated this study. In this paper, the unequal area of rectangular blocks with fixed dimensions and input/output points are considered for FLPs. Four new mixed-integer programming (MIP) models based on previous research formulations are developed. Then, a mathematical optimization approach based on the linearization of the models is applied. An algorithm that solves the linearized MIP model by CPLEX setting a time limit for the solution obtained excellent results for different test problems when compared to those reported in the literature.
{"title":"A MATHEMATICAL OPTIMIZATION APPROACH BASED ON LINEARIZED MIP MODELS FOR SOLVING FACILITY LAYOUT PROBLEMS","authors":"Evelyn Michelle Henrique Braga, Luiz Leduíno de Salles Neto","doi":"10.1590/0101-7438.2022.042.00261044","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00261044","url":null,"abstract":". One of the strategies used to optimize production processes is to define the best layout. For this, the relative positioning of the various equipment, areas, or functional activities inside the company is studied. Proper arrangement of facilities will result in shorter process times and higher productivity. In general, the objective function of the facility layout problem (FLP) is to reduce the total material handling cost. Although over six decades have been passed since the first work on FLP modeling was published, research on many aspects of this problem is still in an early stage and needs to be further explored, which motivated this study. In this paper, the unequal area of rectangular blocks with fixed dimensions and input/output points are considered for FLPs. Four new mixed-integer programming (MIP) models based on previous research formulations are developed. Then, a mathematical optimization approach based on the linearization of the models is applied. An algorithm that solves the linearized MIP model by CPLEX setting a time limit for the solution obtained excellent results for different test problems when compared to those reported in the literature.","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":"67469697","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.00264770
Roy Assaf, P. Do, Phillip Scarf
{"title":"A DIAGNOSTICS AND PROGNOSTICS FRAMEWORK FOR MULTI-COMPONENT SYSTEMS WITH WEAR INTERACTIONS: APPLICATION TO A GEARBOX-PLATFORM","authors":"Roy Assaf, P. Do, Phillip Scarf","doi":"10.1590/0101-7438.2022.042nspe1.00264770","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042nspe1.00264770","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":"67469778","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.00261709
Bruno Luís Hönigmann Cereser, A. Oliveira, A. Moretti
. In this paper, we present the integration of two problems related to the operations in a port terminal: the Berth Allocation Problem (BAP) integrated with the Machine Assignment Problem. We present a mixed-integer linear programming (MILP) formulation, capable of assigning and scheduling incoming vessels to berthing positions and the assignment of machines for handling the vessels. The machines can be quay cranes, mobile cranes, straddle carriers, forklifts, trucks, and any other machine. The problem aims to minimize the waiting time plus the handling time of the vessels. To solve the problem, we developed a heuristic algorithm, capable of solving a problem instance in seconds. To compare the results, we generate several instance problems based on real data and solve them with our MILP formulation implemented in a solver, our heuristic, and a First In First Out (FIFO) algorithm. The solver was able to find solutions only in small-scale instances, and the heuristic was able to find good solutions for all instances.
{"title":"A MATHEMATICAL MODEL AND SOLUTION METHOD FOR THE BERTH ALLOCATION PROBLEM WITH VARIABLE HANDLING TIME AND CONTINUOUS TIME HORIZON","authors":"Bruno Luís Hönigmann Cereser, A. Oliveira, A. Moretti","doi":"10.1590/0101-7438.2022.042.00261709","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00261709","url":null,"abstract":". In this paper, we present the integration of two problems related to the operations in a port terminal: the Berth Allocation Problem (BAP) integrated with the Machine Assignment Problem. We present a mixed-integer linear programming (MILP) formulation, capable of assigning and scheduling incoming vessels to berthing positions and the assignment of machines for handling the vessels. The machines can be quay cranes, mobile cranes, straddle carriers, forklifts, trucks, and any other machine. The problem aims to minimize the waiting time plus the handling time of the vessels. To solve the problem, we developed a heuristic algorithm, capable of solving a problem instance in seconds. To compare the results, we generate several instance problems based on real data and solve them with our MILP formulation implemented in a solver, our heuristic, and a First In First Out (FIFO) algorithm. The solver was able to find solutions only in small-scale instances, and the heuristic was able to find good solutions for all instances.","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":"67469814","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.00243504
K. L. P. Oliveira, B. B. Andrade, Geraldo da Silva e Souza, B. S. Castro
{"title":"ENDOGENEITY IN STOCHASTIC PRODUCTION FRONTIER WITH ONE AND TWO-STEP MODELS: AN APPLICATION WITH MUNICIPAL DATA FROM THE BRAZILIAN AGRICULTURAL CENSUS","authors":"K. L. P. Oliveira, B. B. Andrade, Geraldo da Silva e Souza, B. S. Castro","doi":"10.1590/0101-7438.2022.042.00243504","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042.00243504","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":"67469066","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.00263588
Joyce Araújo, R. Lopes, P. Scarf
{"title":"AGE-BASED REPLACEMENT WITH IMPERFECT REPAIR AND RISK AS LOW AS REASONABLY PRACTICABLE","authors":"Joyce Araújo, R. Lopes, P. Scarf","doi":"10.1590/0101-7438.2022.042nspe1.00263588","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042nspe1.00263588","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":"67469714","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.00268218
C. Cavalcante, P. Scarf, P. Do, Shaomin Wu
{"title":"SPECIAL ISSUE ON RELIABILITY, RISK AND MAINTENANCE","authors":"C. Cavalcante, P. Scarf, P. Do, Shaomin Wu","doi":"10.1590/0101-7438.2022.042nspe1.00268218","DOIUrl":"https://doi.org/10.1590/0101-7438.2022.042nspe1.00268218","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":"67469782","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
扫码关注我们
求助内容：
应助结果提醒方式：