Skip to main content
SpringerLink
Log in

A model and two heuristic approaches for a forage harvester planning problem: a case study

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

This work considers a decision problem about orders of owners and routes of smallholdings for a harvester in an agricultural cooperative in which each owner has a proposal about the instant time in which he would like that the machine starts the activity in his land and the different smallholdings of each owner should be processed as a block. A binary linear programming model is introduced in order to reducing costs. Solving the model for actual size instances is computationally burdensome. Hence, we introduce and implement two heuristic algorithms to reduce the computational time. The heuristics are applied to the real case of the cooperative “Os Irmandiños” with a large number of owners and smallholdings. The numerical results show that the heuristics can solve large instances effectively with reasonable computational effort.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aarts E, Lenstra JK (2003) Local search in combinatorial optimization. Princeton University Press, Princeton

    Google Scholar 

  • Amiama C, Bueno J, Álvarez CJ, Pereira JM (2008) Design and field test of an automatic data acquisition system in a self-propelled forage harvester. Comput Electron Agric 61:192–200

    Article  Google Scholar 

  • Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15:1–31

    Article  Google Scholar 

  • Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115–119

    Article  Google Scholar 

  • 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–11

    Article  Google Scholar 

  • Glover F (1989) Tabu search—part I. ORSA J Comput 1:190–206

    Google Scholar 

  • Laporte G (1988) Location-routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 163–198

    Google Scholar 

  • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345–358

    Article  Google Scholar 

  • Laporte G, Potvin JY, Quilleret F (1996) A tabu search heuristic using genetic diversification for the clustered traveling salesman problem. J Heuristics 2:187–200

    Article  Google Scholar 

  • Osman IH, Laporte G (1996) Metaheuristics: a bibliography. Ann Oper Res 63:511–623

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Facultad de Informática, Universidad de Coruña, 15071, La Coruña, Spain

    Luisa Carpente

  2. Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Santiago de Compostela, 15782, Santiago de Compostela, Spain

    Balbina Casas-Méndez

  3. Oesía Tecnología, Polígono Industrial del Tambre, 15890, Santiago de Compostela, Spain

    Cristina Jácome

  4. Departamento de Estadística e IO, Facultad de Matemáticas, Universidad de Sevilla, 41012, Sevilla, Spain

    Justo Puerto

Authors
  1. Luisa Carpente
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balbina Casas-Méndez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristina Jácome
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Justo Puerto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Balbina Casas-Méndez.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carpente, L., Casas-Méndez, B., Jácome, C. et al. A model and two heuristic approaches for a forage harvester planning problem: a case study. TOP 18, 122–139 (2010). https://doi.org/10.1007/s11750-009-0104-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-009-0104-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation