Route Planning for Agricultural Machines with Multiple Depots:Manure Application Case Study
| Autor: | Claus G. Sørensen, Kun Zhou, Mahdi Vahdanjoo |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
0106 biological sciences
Decision support system Mathematical optimization decision support Computer science operations management optimization route planning field efficiency multiple depots simulated annealing nonfixed MD-CVRP problem 01 natural sciences Field (computer science) lcsh:Agriculture Representation (mathematics) Metaheuristic lcsh:S 04 agricultural and veterinary sciences Tree traversal Headland (agriculture) Simulated annealing 040103 agronomy & agriculture 0401 agriculture forestry and fisheries Routing (electronic design automation) Agronomy and Crop Science 010606 plant biology & botany |
| Zdroj: | Vahdanjoo, M, Zhou, K & Grøn Sørensen, C 2020, ' Route Planning for Agricultural Machines with Multiple Depots : Manure Application Case Study ', Agronomy, vol. 10, no. 10, 1608 . https://doi.org/10.3390/agronomy10101608 Agronomy, Vol 10, Iss 1608, p 1608 (2020) Agronomy Volume 10 Issue 10 |
| DOI: | 10.3390/agronomy10101608 |
| Popis: | Capacitated field operations involve input/output material flows where there are capacity constraints in the form of a specific load that a vehicle can carry. As such, a specific normal-sized field cannot be covered in one single operation using only one load, and the vehicle needs to get serviced (i.e., refilling) from out-of-field facilities (depot). Although several algorithms have been developed to solve the routing problem of capacitated operations, these algorithms only considered one depot. The general goal of this paper is to develop a route planning tool for agricultural machines with multiple depots. The tool presented consists of two modules: the first one regards the field geometrical representation in which the field is partitioned into tracks and headland passes the second one regards route optimization that is implemented by the metaheuristic simulated annealing (SA) algorithm. In order to validate the developed tool, a comparison between a well-known route planning approach, namely B-pattern, and the algorithm presented in this study was carried out. The results show that the proposed algorithm outperforms the B-pattern by up to 20.0% in terms of traveled nonworking distance. The applicability of the tool developed was tested in a case study with seven scenarios differing in terms of locations and number of depots. The results of this study illustrated that the location and number of depots significantly affect the total nonworking traversal distance during a field operation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|