Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/32694
Назив: | Multi-Objective Metaheuristic Solution Approach for the Crop Plant Scheduling Problem | Аутори: | Lalić, Maksim Obrenović, Nikola Atac, S. Bortolomiol, S. Marko, Oskar Brdar, Sanja Crnojević, Vladimir Luković, Ivan |
Датум издавања: | нов-2023 | Конференција: | Proceedings of META'2023, 9th International Conference on Metaheuristics and Nature Inspired Computing, Marrakech, Morocco, November 01-04 | Сажетак: | Accurate and optimized harvest schedules should improve the subsequent harvest performance. In this work, we formulate a bi-objective optimization model used to improve harvest effectiveness, measured by the amount of unnecessarily produced waste, and its efficiency, measured by the time required for harvest completion. The proposed model considers a farm field divided into management units that are treated and harvested independently and assume storage and processing limits that dictate the pace of the optimal harvest. The optimization problem is solved using 2 distinctive metaheuristic techniques. We examined adaptive large neighborhood search (ALNS) as a model-driven single-solution-based metaheuristic and non-dominated sorting genetic algorithm II (NSGA-II) as a data-driven population-based approach. Optimization techniques were tested on 20 synthesized test cases. All obtained results emphasize the significant and consistent dominance of the ALNS over the NSGA-II. | URI: | https://open.uns.ac.rs/handle/123456789/32694 |
Налази се у колекцијама: | IBS Publikacije/Publications |
Датотеке у овој ставци:
Датотека | Величина | Формат | |
---|---|---|---|
M33-2023-Multi-Objective Metaheuristic Solution Approach for the.pdf | 226.44 kB | Adobe PDF | Погледајте |
Преглед/и станица
20
проверено 03.05.2024.
Преузимање/а
3
проверено 03.05.2024.
Google ScholarTM
Проверите
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.