IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v10y2010i3p321-343.html
   My bibliography  Save this article

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

Author

Listed:
  • Victor Blanco
  • Luisa Carpente
  • Yolanda Hinojosa
  • Justo Puerto

Abstract

No abstract is available for this item.

Suggested Citation

  • Victor Blanco & Luisa Carpente & Yolanda Hinojosa & Justo Puerto, 2010. "Planning for Agricultural Forage Harvesters and Trucks: Model, Heuristics, and Case Study," Networks and Spatial Economics, Springer, vol. 10(3), pages 321-343, September.
    • Handle: RePEc:kap:netspa:v:10:y:2010:i:3:p:321-343
    DOI: 10.1007/s11067-009-9120-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-009-9120-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-009-9120-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    3. Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003. "Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies," European Journal of Operational Research, Elsevier, vol. 151(1), pages 1-11, November.
    4. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    5. Eli M. Noam, 2001. "Interconnecting the Network of Networks," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262140721, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jenna Toussaint & Shang Wu & Kent D. Messer, 2012. "Maximizing Benefits for Women: A Charitable Donation Allocation Problem," Working Papers 12-12, University of Delaware, Department of Economics.
    2. Kusumastuti, Ratih Dyah & Donk, Dirk Pieter van & Teunter, Ruud, 2016. "Crop-related harvesting and processing planning: a review," International Journal of Production Economics, Elsevier, vol. 174(C), pages 76-92.
    3. Ana Esteso & M. M. E. Alemany & Angel Ortiz & Shaofeng Liu, 2022. "Optimization model to support sustainable crop planning for reducing unfairness among farmers," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 1101-1127, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Luisa Carpente & Balbina Casas-Méndez & Cristina Jácome & Justo Puerto, 2010. "A model and two heuristic approaches for a forage harvester planning problem: a case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 122-139, July.
    2. Jesus Gonzalez-Feliu, 2012. "Cost optimisation in freight distribution with cross-docking: N-echelon location routing problem," Post-Print halshs-00565329, HAL.
    3. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    4. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    5. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.
    6. Hennig, F. & Nygreen, B. & Christiansen, M. & Fagerholt, K. & Furman, K.C. & Song, J. & Kocis, G.R. & Warrick, P.H., 2012. "Maritime crude oil transportation – A split pickup and split delivery problem," European Journal of Operational Research, Elsevier, vol. 218(3), pages 764-774.
    7. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    8. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    9. Salazar-González, Juan-José & Santos-Hernández, Beatriz, 2015. "The split-demand one-commodity pickup-and-delivery travelling salesman problem," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 58-73.
    10. Connor Little & Salimur Choudhury & Ting Hu & Kai Salomaa, 2022. "Comparison of Genetic Operators for the Multiobjective Pickup and Delivery Problem," Mathematics, MDPI, vol. 10(22), pages 1-21, November.
    11. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    12. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    13. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    14. Ohad Eisenhandler & Michal Tzur, 2019. "A Segment-Based Formulation and a Matheuristic for the Humanitarian Pickup and Distribution Problem," Transportation Science, INFORMS, vol. 53(5), pages 1389-1408, September.
    15. Margaretha Gansterer & Richard F. Hartl, 2021. "The Prisoners’ Dilemma in collaborative carriers’ request selection," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 73-87, March.
    16. Trotta, Manuel & Archetti, Claudia & Feillet, Dominique & Quilliot, Alain, 2022. "Pickup and delivery problems with autonomous vehicles on rings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 221-236.
    17. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    18. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    19. Mohammad Torkjazi & Nathan Huynh, 2019. "Effectiveness of Dynamic Insertion Scheduling Strategy for Demand-Responsive Paratransit Vehicles Using Agent-Based Simulation," Sustainability, MDPI, vol. 11(19), pages 1-12, September.
    20. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:10:y:2010:i:3:p:321-343. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.