Using the Vehicle Routing Problem to reduce field completion times with multiple machines

Optimization focused on field completion times rather than total machine time.Optimization obtained by transformation into a Vehicle Routing Problem.Significant reductions possible with meta-heuristic procedures like Tabu Search.Tabu Search is more important in complex fields and with more vehicles. The Vehicle Routing Problem (VRP) is a powerful tool used to express many logistics problems, yet unlike other vehicle routing challenges, agricultural field work consists of machine paths that completely cover a field. In this work, the allocation and ordering of field paths among a number of available machines has been transformed into a VRP that enables optimization of completion time for the entire field. A basic heuristic algorithm (a modified form of the common Clarke-Wright algorithm) and a meta-heuristic algorithm, Tabu Search, were employed for optimization. Both techniques were evaluated through computer simulations in two fields: a hypothetical basic rectangular field and a more complex, real-world field. Field completion times and effective field capacity were calculated for cases when 1, 2, 3, 5, and 10 vehicles were used simultaneously. Although the Tabu Search method required more than two hours to produce its solution on an Intel i7 processor compared to less than one second for the method based on Clarke-Wright, Tabu Search provided better solutions that resulted in reduced field completion times and increased effective field capacity. The benefit provided by Tabu Search was larger in the more complex field and as the number of vehicles increased. With ten vehicles in the real-world field, the benefit provided by Tabu Search over the modified Clarke-Wright resulted in reduced completion time of 32%, but even with only three vehicles a 15% reduction was obtained. While ten vehicles may only be applicable with future autonomous machines, simultaneous usage of three machines is not uncommon in current production. As producers consider using multiple machines to improve field completion times and effective field capacity, optimization of the vehicle routing will play an important role in ensuring those improvements are fully realized.

[1]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[2]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[3]  Arto Visala,et al.  Coverage path planning algorithms for agricultural field machines , 2009 .

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

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

[6]  Stavros Vougioukas,et al.  A distributed control framework for motion coordination of teams of autonomous agricultural vehicles , 2012 .

[7]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

[9]  R. J. Palmer,et al.  Improving the Efficiency of Field Operations , 2003 .

[10]  Claus Grøn Sørensen,et al.  A DSS for planning of soil-sensitive field operations , 2012, Decis. Support Syst..

[11]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[12]  Vitalijs Komasilovs,et al.  Specification development of robotic system for pesticide spraying in greenhouse , 2013, 2013 IEEE 14th International Symposium on Computational Intelligence and Informatics (CINTI).

[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]  Santosh K. Pitla,et al.  Multi-Robot System Control Architecture (MRSCA) for Agricultural Production , 2010 .

[15]  Sytze de Bruin,et al.  Optimized routing on agricultural fields by minimizing maneuvering and servicing time , 2012, Precision Agriculture.

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

[17]  Claus G. Sørensen,et al.  Automated generation of guidance lines for operational field planning , 2010 .

[18]  Julian Sanchez,et al.  Corn plant sensing using real-time stereo vision , 2009 .

[19]  Christophe Rosenberger,et al.  Multi-Agent Based Prototyping of Agriculture Robots , 2006, International Symposium on Collaborative Technologies and Systems (CTS'06).

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

[21]  Enrique Alba,et al.  Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms , 2004, EvoCOP.

[22]  Morikazu Nakamura,et al.  Resource assignment and scheduling based on a two-phase metaheuristic for cropping system , 2009 .

[23]  W. Anderson,et al.  Soil compaction in cropping systems: A review of the nature, causes and possible solutions , 2005 .

[24]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

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

[26]  Spyros Fountas,et al.  Specification of Behavioural Requirements for an Autonomous Tractor , 2002 .

[27]  Gonzalo Pajares,et al.  Fleets of robots for precision agriculture: a simulation environment , 2013, Ind. Robot.