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] Bi-objective vibration damping optimization for congested location-pricing problem
    Hajipour, Vahid
    Farahani, Reza Zanjirani
    Fattahi, Parviz
    COMPUTERS & OPERATIONS RESEARCH, 2016, 70 : 87 - 100
  • [22] An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem
    Pauleti Mendes, Luis Henrique
    Usberti, Fabio Luiz
    San Felice, Mario Cesar
    METAHEURISTICS, MIC 2022, 2023, 13838 : 519 - 524
  • [23] A study of the bi-objective next release problem
    Juan J. Durillo
    Yuanyuan Zhang
    Enrique Alba
    Mark Harman
    Antonio J. Nebro
    Empirical Software Engineering, 2011, 16 : 29 - 60
  • [24] The bi-objective stochastic covering tour problem
    Tricoire, Fabien
    Graf, Alexandra
    Gutjahr, Walter J.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1582 - 1592
  • [25] The bi-objective Pollution-Routing Problem
    Demir, Emrah
    Bektas, Tolga
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (03) : 464 - 478
  • [26] A genetic algorithm for a bi-objective capacitated arc routing problem
    Lacomme, P.
    Prins, C.
    Sevaux, M.
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3473 - 3493
  • [27] An evolutionary algorithm for the bi-objective multiple traveling salesman problem
    Labadie, Nacima
    Melechovsky, Jan
    Prins, Christian
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1253 - 1260
  • [28] AN EXACT METHOD FOR SOLVING THE BI-OBJECTIVE MINIMUM DIAMETER-COST SPANNING TREE PROBLEM
    De Sousa, Ernando Gomes
    Santos, Andrea Cynthia
    Aloise, Dario Jose
    RAIRO-OPERATIONS RESEARCH, 2015, 49 (01) : 143 - 160
  • [29] Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTW
    Legrand, Clement
    Cattaruzza, Diego
    Jourdan, Laetitia
    Kessaci, Marie-Eleonore
    METAHEURISTICS, MIC 2024, PT I, 2024, 14753 : 62 - 77