A multi-objective genetic algorithm based approach for location of grain silos in Paraná State of Brazil

Neto, Pedro José Steiner; Datta, Dilip; Steiner, María Teresinha Arns; Canciglieri, Osíris; Figueira, José Rui; Detro, Silvana Pereira; Scarpin, Cassius Tadeu

doi:10.1016/j.cie.2017.07.019

Cited by 11 publications

(5 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For a more realistic simulation, the subsets are classified into three categories by mileage: short-, medium-, or longdistance clients (S, M, and L, respectively), corresponding to three application scenarios: community, country, and metropolis. We compare our algorithms with the Genetic Algorithm and Simulated Annealing, which have been verified examined in many studies [31][32][33][34][35][36] for location decisions to and are considered to be state-of-the-art approaches. Additionally, an online application called the Geographic Midpoint Calculator is seen as another rival competitive method because it can process OMP queries with the three datasets.…”

Section: Methodsmentioning

confidence: 99%

Advanced algorithms for optimal meeting points in road networks

Liu

Zhang

2022

IET Intelligent Trans Sys

View full text Add to dashboard Cite

An optimal meeting point query is used to determine a location in a spatial region to build a new facility that minimizes the sum of the (weighted) road distances from all clients. This problem has been studied in previous work with the assumption that all clients and facilities reside in Euclidean space or along road networks. However, due to the limitations of geographic information system technologies, it is difficult to return an exact geographic location to answer the optimal meeting point query based on a set of arbitrary coordinates. This issue results in various problems, such as positioning and measurement errors, in practical use. In this paper, it is aimed to identify the optimal meeting point in road networks for clients and facilities residing in non-Euclidean spaces. Two efficient heuristic solutions are proposed based on approximate and adaptive query processing techniques by using randomized adaptive search and random direction search methods, respectively, to rapidly converge to the global optimum in the geographic coordinate system. Extensive experiments based on real datasets demonstrate that our proposed method achieves a 32.11% improvement over the state-of-the-art approach.

show abstract

Section: Methodsmentioning

confidence: 99%

Advanced algorithms for optimal meeting points in road networks

Liu

Zhang

2022

IET Intelligent Trans Sys

View full text Add to dashboard Cite

show abstract

“…Embora a Programação Linear Inteira Mista (PLIM) seja a abordagem mais adequada para lidar com esses problemas, ela tem se mostrado inadequada a problemas reais de grande porte. Desta forma, diferentes procedimentos metaheurísticos têm sido desenvolvidos para o problema de particionamento territorial (Steiner Neto et al, 2017). Algumas dessas abordagens relatadas na literatura especializada, no decorrer desta última década, estão apresentadas a seguir, em ordem cronológica.…”

Section: Trabalhos Correlatosunclassified

Otimização No Particionamento Territorial Visando a Implantação De Projeto De Manutenção Predial Comum: Um Estudo De Caso Junto a Um Órgão Público

Steiner¹,

Franco²,

Nara³

et al. 2023

Rev. Foco

View full text Add to dashboard Cite

Todos os contratos da administração pública devem ter seu desempenho avaliado, com o objetivo de serem aplicadas abordagens de natureza ágil para a melhoria da performance do contrato, respeitados os limites estabelecidos pelas leis e afins. O objetivo do presente artigo é a aplicação de uma abordagem ágil para a melhoria da performance de um contrato de atendimento de manutenção predial comum junto ao Tribunal da Justiça do Paraná (TJPR), que possui uma área total construída de 544.283,79 m² em 224 edificações distribuídas por 161 Comarcas, por meio da otimização do particionamento territorial do Estado do Paraná. Visando particionar o estado em 14 regionais, foi aplicado o Modelo Matemático de Programação Linear Inteira Binária (PLIB) voltado ao Problema de Localização de Facilidades (PLF) a dois cenários. Os resultados mostram que o melhor cenário em termos de minimização das distâncias percorridas pelas equipes de manutenção, a partir de suas sedes até os locais de manutenção, é o Cenário 1 (onde foram mantidas as localizações dos 14 escritórios de manutenção, mas as configurações de suas áreas de atuação foram otimizadas). Neste cenário, a distância total percorrida será de 10.467 km diariamente (ao invés dos 11.150 km atuais), alcançando uma economia de cerca de 6% em relação à solução adotada atualmente. Com esta solução, além da distância, estariam sendo minimizados os custos diretos e indiretos afetos ao deslocamento das equipes de trabalho, além do tempo dispendido nas respectivas viagens.

show abstract

“…MOO addresses the process of simultaneously optimizing two or more conflicting objectives subject to restrictions (Kumar et al, 2016;Steiner Neto et al, 2017). Its mathematical representation is presented using the objective function in Eq.…”

Section: Multi-objective Optimizationmentioning

confidence: 99%

“…The Green Vehicle Routing Problem (GVRP) directs routing activities through a perspective with environmental considerations (Toro et al, 2017a;Soleimani et al, 2018). Thus, a Multi-objective approach aids this process of complex decision-making in order to meet the objectives to be achieved (Ramos et al, 2014;Steiner et al, 2015;Steiner Neto et al, 2017).…”

Section: Introductionmentioning

confidence: 99%

Multi-objective optimization for the green vehicle routing problem: A systematic literature review and future directions

2020

View full text Add to dashboard Cite

This article aims to present research conducted on the literature regarding multi-objective optimization for routing problems with environmental considerations, referred to here as Multi-objective Optimization for the Green Vehicle Routing Problem (MOOGVRP). A Brazilian database, CAPES (Coordination for the Improvement of Higher Education Personnel), was used to collect articles of general application, case studies and reviews in English starting from, since 2012. The terms "green vehicle routing problem" (GVRP), "pollution routing problem" (PRP), "vehicle routing problem in reverse logistics" (VRPRL) and "multi-objective" were used in the research protocol. Consequently, this study obtained 1,744 research results that, following the application of the filtering criterion, resulted in a sample of 76 articles from 38 journals, for which a bibliometric data (bibliometric review) survey was conducted. The originality of this article lies in how the research is presented, highlighting the results and details obtained through the survey, which may be considered of great academic importance in the sense of guiding the trends for future research.

show abstract

A multi-objective genetic algorithm based approach for location of grain silos in Paraná State of Brazil

Cited by 11 publications

References 34 publications

Advanced algorithms for optimal meeting points in road networks

Advanced algorithms for optimal meeting points in road networks

Otimização No Particionamento Territorial Visando a Implantação De Projeto De Manutenção Predial Comum: Um Estudo De Caso Junto a Um Órgão Público

Multi-objective optimization for the green vehicle routing problem: A systematic literature review and future directions

Contact Info

Product

Resources

About