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

被引:14
|
作者
Aliano Filho, Angelo [1 ]
de Oliveira Florentino, Helenice [2 ]
Pato, Margarida Vaz [3 ,4 ]
Poltroniere, Sonia Cristina [5 ]
da Silva Costa, Joao Fernando [6 ]
机构
[1] Univ Tecnol Fed Parana, Dept Acad Matemat, Apucarana, Brazil
[2] Univ Estadual Paulista, Inst Biociencias Botucatu, Botucatu, SP, Brazil
[3] Univ Lisbon, ISEG, Lisbon, Portugal
[4] Univ Lisbon, CMAFcIO, Lisbon, Portugal
[5] Univ Estadual Paulista, Dept Matemat, Bauru, SP, Brazil
[6] Univ Tecnol Fed Parana, Apucarana, Brazil
基金
巴西圣保罗研究基金会; 瑞典研究理事会;
关键词
Multi-objective optimization; Genetic algorithm; Constructive heuristics and sustainability; SOIL ORGANIC-CARBON; CROP-ROTATION; MANAGEMENT; TILLAGE;
D O I
10.1007/s10479-019-03468-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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
页数:30
相关论文
共 50 条
  • [41] Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem
    Prins, Christian
    Prodhon, Caroline
    Calvo, Roberto Wolfler
    ANNALS OF OPERATIONS RESEARCH, 2006, 147 (01) : 23 - 41
  • [42] AN APPROACH TO SOLVE A FUZZY BI-OBJECTIVE MULTI-INDEX FIXED CHARGE TRANSPORTATION PROBLEM
    Hakim, Maroua
    Zitouni, Rachid
    KYBERNETIKA, 2024, 60 (03) : 271 - 292
  • [43] Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem
    Christian Prins
    Caroline Prodhon
    Roberto Wolfler Calvo
    Annals of Operations Research, 2006, 147 : 23 - 41
  • [45] Two-phases method and Branch and Bound procedures to solve the bi-objective Knapsack problem
    Visee, M
    Teghem, J
    Pirlot, M
    Ulungu, EL
    JOURNAL OF GLOBAL OPTIMIZATION, 1998, 12 (02) : 139 - 155
  • [46] Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem
    Basseur, M
    Lemesre, J
    Dhaenens, C
    Talbi, EG
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 72 - 86
  • [47] Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
    Shang, Xiaoting
    Yang, Kai
    Jia, Bin
    Gao, Ziyou
    Ji, Hao
    APPLIED MATHEMATICAL MODELLING, 2021, 91 : 412 - 437
  • [48] Solving shortest capacitated path problem using a Bi-objective heuristic approach (invited paper)
    Grosan, Crina
    Abraham, Ajith
    AMS 2007: FIRST ASIA INTERNATIONAL CONFERENCE ON MODELLING & SIMULATION ASIA MODELLING SYMPOSIUM, PROCEEDINGS, 2007, : 427 - +
  • [49] The bi-objective Pollution-Routing Problem
    Demir, Emrah
    Bektas, Tolga
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (03) : 464 - 478
  • [50] Metaheuristics for the bi-objective ring star problem
    Liefooghe, Arnaud
    Jourdan, Laetitia
    Basseur, Matthieu
    Talbi, El-Ghazali
    Burke, Edmund K.
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2008, 4972 : 206 - +