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 条
  • [21] A tabu search algorithm to solve a green logistics bi-objective bi-level problem
    Camacho-Vallejo, Jose-Fernando
    Lopez-Vera, Lilian
    Smith, Alice E.
    Gonzalez-Velarde, Jose-Luis
    ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) : 927 - 953
  • [22] A tabu search algorithm to solve a green logistics bi-objective bi-level problem
    José-Fernando Camacho-Vallejo
    Lilian López-Vera
    Alice E. Smith
    José-Luis González-Velarde
    Annals of Operations Research, 2022, 316 : 927 - 953
  • [23] Simulated Annealing-Based Embedded Meta-Heuristic Approach to Solve Bi-objective Robust Stochastic Sustainable Cellular Layout
    Kumar R.
    Singh S.P.
    Global Journal of Flexible Systems Management, 2018, 19 (1) : 69 - 93
  • [24] Bi-objective green ride-sharing problem: Model and exact method
    Yu, Yang
    Wu, Yuting
    Wang, Junwei
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2019, 208 : 472 - 482
  • [25] An exact criterion space search algorithm for a bi-objective blood collection problem
    Esmaeili, Somayeh
    Bashiri, Mahdi
    Amiri, Amirhossein
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 311 (01) : 210 - 232
  • [26] Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
    Legrand, Clement
    Cattaruzza, Diego
    Jourdan, Laetitia
    Kessaci, Marie-Eleonore
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2025, 32 (01) : 117 - 143
  • [27] An Effective Parameter Tuning for a Bi-objective Genetic Algorithm to Solve the Sum Coloring Problem
    Harrabi, Olfa
    Siala, Jouhaina Chaouachi
    SOFT COMPUTING FOR PROBLEM SOLVING, SOCPROS 2017, VOL 1, 2019, 816 : 107 - 119
  • [28] A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
    Ebrahim, R. Mohammad
    Razmi, J.
    ADVANCES IN ENGINEERING SOFTWARE, 2009, 40 (10) : 1056 - 1062
  • [29] A Specific Heuristic Dedicated to a Coverage/Tracking Bi-objective Problem for Wireless Sensor Deployment
    Le Berre, Matthieu
    Rebai, Maher
    Hnaien, Faicel
    Snoussi, Hichem
    WIRELESS PERSONAL COMMUNICATIONS, 2015, 84 (03) : 2187 - 2213
  • [30] Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
    Margarida Vaz Pato
    Margarida Moz
    Journal of Heuristics, 2008, 14 : 359 - 374