Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation

被引:0
|
作者
Angelo Aliano Filho
Helenice de Oliveira Florentino
Margarida Vaz Pato
Sônia Cristina Poltroniere
João Fernando da Silva Costa
机构
[1] Universidade Tecnológica Federal do Paraná,Departamento Academico de Matemática
[2] Universidade Estadual Paulista,Instituto de Biociências de Botucatu
[3] Universidade de Lisboa,ISEG and CMAFcIO
[4] Universidade Estadual Paulista,Departamento de Matemática
[5] Universidade Tecnológica Federal of Paraná,undefined
来源
关键词
Multi-objective optimization; Genetic algorithm; Constructive heuristics and sustainability;
D O I
暂无
中图分类号
学科分类号
摘要
This work proposes a binary nonlinear bi-objective optimization model for the problem of planning the sustainable cultivation of crops. The solution to the problem is a planting schedule for crops to be cultivated in predefined plots, in order to minimize the possibility of pest proliferation and maximize the profit of this process. Biological constraints were also considered. Exact methods, based on the nonlinear model and on a linearization of that model were proposed to generate Pareto optimal solutions for the problem of sustainable cultivation, along with a metaheuristic approach for the problem based on a genetic algorithm and on constructive heuristics. The methods were tested using semi-randomly generated instances to simulate real situations. According to the experimental results, the exact methodologies performed favorably for small and medium size instances. The heuristic method was able to potentially determine Pareto optimal solutions of good quality, in a reduced computational time, even for high dimension instances. Therefore, the mathematical models and the methods proposed may support a powerful methodology for this complex decision-making problem.
引用
收藏
页码:347 / 376
页数:29
相关论文
共 50 条
  • [1] Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
    Aliano Filho, Angelo
    de Oliveira Florentino, Helenice
    Pato, Margarida Vaz
    Poltroniere, Sonia Cristina
    da Silva Costa, Joao Fernando
    ANNALS OF OPERATIONS RESEARCH, 2022, 314 (02) : 347 - 376
  • [2] An exact method to solve a Bi-objective Resource Constraint Project Scheduling Problem
    Wan, Xixi
    Dugardin, Frederic
    Yalaoui, Farouk
    IFAC PAPERSONLINE, 2016, 49 (12): : 1038 - 1043
  • [3] An exact algorithm for the bi-objective timing problem
    Jacquin, Sophie
    Dufosse, Fanny
    Jourdan, Laetitia
    OPTIMIZATION LETTERS, 2018, 12 (04) : 903 - 914
  • [4] An exact algorithm for the bi-objective timing problem
    Sophie Jacquin
    Fanny Dufossé
    Laetitia Jourdan
    Optimization Letters, 2018, 12 : 903 - 914
  • [5] A heuristic framework for the bi-objective enhanced index tracking problem
    Filippi, C.
    Guastaroba, G.
    Speranza, M. G.
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 65 : 122 - 137
  • [6] A Sustainable Bi-objective Approach for the Minimum Latency Problem
    Arellano-Arriaga, Nancy A.
    Alvarez-Socarras, Ada M.
    Martinez-Salazar, Iris A.
    SMART CITIES, 2017, 10268 : 11 - 19
  • [7] An exact parallel method for a bi-objective permutation flowshop problem
    Lemesre, J.
    Dhaenens, C.
    Talbi, E. G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) : 1641 - 1655
  • [8] A comparison among optimization software to solve bi-objective sectorization problem
    Teymourifar, Aydin
    HELIYON, 2023, 9 (08)
  • [9] Efficient anytime algorithms to solve the bi-objective Next Release Problem
    Angel Dominguez-Rios, Miguel
    Chicano, Francisco
    Alba, Enrique
    del Aguila, Isabel
    del Sagrado, Jose
    JOURNAL OF SYSTEMS AND SOFTWARE, 2019, 156 : 217 - 231