Planning for Agricultural Forage Harvesters and Trucks: Model, Heuristics, and Case Study

In this paper we study an actual problem proposed by an agricultural cooperative devoted to harvesting corn and grass. The cooperative uses harvesters for harvesting the crop and trucks for carrying it from the smallholdings to the landowners’ silos. The goal is to minimize the total working time of the machinery. Therefore, the cooperative needs to plan both the harvesters and trucks routing. This routing problem simultaneously incorporates the following characteristics: time windows, nested decisions, processing times required to service each facility and the fact that facilities must be visited in clusters. A binary integer linear programming model is proposed to solve this problem. However, since approaches dealing directly with such formulation lead to considerable computation times, we propose a heuristic alternative solution approach for the problem. The heuristic is applied to the case of the cooperative “Os Irmandiños” with a large number of landowners and smallholdings. We report on extensive computational tests to show that the proposed heuristic approach can solve large problems effectively in reasonable computing time.

[1]  Justo Puerto,et al.  A model and two heuristic approaches for a forage harvester planning problem: a case study , 2010 .

[2]  Eli M. Noam,et al.  Interconnecting the Network of Networks , 2001 .

[3]  Fabrice Marchal A Trip Generation Method for Time-Dependent Large-Scale Simulations of Transport and Land-Use , 2005 .

[4]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[5]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[6]  Carlos Amiama,et al.  Design and field test of an automatic data acquisition system in a self-propelled forage harvester , 2008 .

[7]  Gilbert Laporte,et al.  A tabu search heuristic using genetic diversification for the clustered traveling salesman problem , 1997, J. Heuristics.

[8]  James A. Chisman,et al.  The clustered traveling salesman problem , 1975, Comput. Oper. Res..

[9]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[10]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[11]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[12]  Gilbert Laporte,et al.  Rejoinder on: Static pickup and delivery problems: a classification scheme and survey , 2007 .

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

[14]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..