An Arable Field for Benchmarking of Metaheuristic Algorithms for Capacitated Coverage Path Planning Problems

This study specifies an agricultural field (Latitude = 56°30′0.8″ N, Longitude = 9°35′27.88″ E) and provides the absolute optimal route for covering that field. The calculated absolute optimal solution for this field can be used as the basis for benchmarking of metaheuristic algorithms used for finding the most efficient route in the field. The problem of finding the most efficient route that covers a field can be formulated as a Traveling Salesman Problem (TSP), which is an NP-hard problem. This means that the optimal solution is infeasible to calculate, except for very small fields. Therefore, a range of metaheuristic methods has been developed that provide a near-optimal solution to a TSP in a “reasonable” time. The main challenge with metaheuristic methods is that the quality of the solutions can normally not be compared to the absolute optimal solution since this “ground truth” value is unknown. Even though the selected benchmarking field requires only eight tracks, the solution space consists of more than 1.3 billion solutions. In this study, the absolute optimal solution for the capacitated coverage path planning problem was determined by calculating the non-working distance of the entire solution space and determining the solution with the shortest non-working distance. This was done for four scenarios consisting of low/high bin capacity and short/long distance between field and storage depot. For each scenario, the absolute optimal solution and its associated cost value (minimum non-working distance) were compared to the solutions of two metaheuristic algorithms; Simulated Annealing Algorithm (SAA) and Ant Colony Optimization (ACO). The benchmarking showed that neither algorithm could find the optimal solution for all scenarios, but they found near-optimal solutions, with only up to 6 pct increasing non-working distance. SAA performed better than ACO, concerning quality, stability, and execution time.

[1]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[2]  Yuxiao Hu,et al.  MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognition , 2016, ECCV.

[3]  A. K. Pamosoaji,et al.  Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem , 2019 .

[4]  Mohammad Deni Akbar,et al.  Hybrid genetic–tabu search algorithm to optimize the route for capacitated vehicle routing problem with time window , 2020 .

[5]  Dionysis Bochtis,et al.  Benefits from optimal route planning based on B-patterns , 2013 .

[6]  Dionysis Bochtis,et al.  Coverage planning for capacitated field operations, part II: Optimisation , 2015 .

[7]  Congdong Li,et al.  Multi-Objective Optimization Model of Emergency Organization Allocation for Sustainable Disaster Supply Chain , 2017 .

[8]  Y. L. Li,et al.  Improving the efficiency of spatially selective operations for agricultural robotics in cropping field , 2013 .

[9]  Emilio Frazzoli,et al.  Traveling Salesperson Problems for the Dubins Vehicle , 2008, IEEE Transactions on Automatic Control.

[10]  Bilal Kanso,et al.  Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem , 2020 .

[11]  Mogens Graf Plessen.  Coupling of Crop Assignment and Vehicle Routing for Harvest Planning in Agriculture , 2017, Artificial Intelligence in Agriculture.

[12]  D. Bochtis,et al.  AE—Automation and Emerging TechnologiesThe vehicle routing problem in field logistics part I , 2009 .

[13]  Gonzalo Pajares,et al.  Mix-opt: A new route operator for optimal coverage path planning for a fleet in an agricultural environment , 2016, Expert Syst. Appl..

[14]  Rafael Martí,et al.  Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions , 2005, J. Glob. Optim..

[15]  Claus G. Sørensen,et al.  Novel Route Planning System for Machinery Selection. Case: Slurry Application , 2020 .

[16]  Claus G. Sørensen,et al.  The vehicle routing problem in field logistics: Part II , 2009 .

[17]  Kanchana Sethanan,et al.  Methodology to Solve a Special Case of the Vehicle Routing Problem: A Case Study in the Raw Milk Transportation System , 2019, AgriEngineering.

[18]  Dionysis Bochtis,et al.  Minimising the non-working distance travelled by machines operating in a headland field pattern , 2008 .

[19]  Ibrahim A. Hameed,et al.  Driving Angle and Track Sequence Optimization for Operational Path Planning Using Genetic Algorithms , 2011 .

[20]  José L. Verdegay,et al.  Coverage path planning with unmanned aerial vehicles for 3D terrain reconstruction , 2016, Expert Syst. Appl..

[21]  Fitri Maya Puspita,et al.  The Branch and Cut Method for Solving Capacitated Vehicle Routing Problem (CVRP) Model of LPG Gas Distribution Routes , 2019 .

[22]  Yanjun Shi,et al.  A Heuristic Solution Method for Multi-Depot Vehicle Routing-Based Waste Collection Problems , 2020 .

[23]  Ehsan Nikbakhsh,et al.  Field path planning using capacitated arc routing problem , 2020, Comput. Electron. Agric..

[24]  Jian Jin,et al.  Optimal Coverage Path Planning for Arable Farming on 2D Surfaces , 2010 .

[25]  Luis Rodolfo Garcia Carrillo,et al.  An Integrated Traveling Salesman and Coverage Path Planning Problem for Unmanned Aircraft Systems , 2019, IEEE Control Systems Letters.

[26]  Fumihiko Ino,et al.  GPU‐based branch‐and‐bound method to solve large 0‐1 knapsack problems with data‐centric strategies , 2018, Concurr. Comput. Pract. Exp..