Planning for Agricultural Forage Harvesters and Trucks: Model, Heuristics, and Case Study
Tóm tắt
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.
Tài liệu tham khảo
Aarts E, Lenstra J (eds) (2003) Local search in combinatorial optimization. Princeton University Press, Princeton
Amiama C, Bueno J, Álvarez C, Pereira J (2008) Design and field test of an automatic data acquisition system in a self-propelled forage harvester. Comput Electron Agric 61(2):192–200
Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Networks and Spatial Economics 6(3):293–311
Berbeglia G, Cordeau J, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15(1):45–47
Carpente L, Casas-Méndez B, Jácome C, Puerto J (2009) A model and two heuristic approaches for a forage harvester planning problem: a case study. TOP. doi:10.1007/s11750-009-0104-5
Chisman J (1975) The clustered traveling salesman problem. Computers & OR 2(2):115–119
Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151(1):1–11
Glover F (1989) Tabu search, part I. ORSA J Comput 1(3):190–206
Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358
Laporte G, Potvin J, Quilleret F (1996) A tabu search heuristic using genetic diversification for the clustered traveling salesman problem. Journal of Heuristics 2:187–200
Marchal F (2005) A trip generation method for time-dependent large-scale simulations of transport and land-use. Networks and Spatial Economics 5(2):179–192
Noam E (2001) Interconnecting the network of networks. MIT, Cambridge
Osman I, Laporte G (1996) Metaheuristics: a bibliography. Annals of Operations Research 63:511–623