IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v58y2007i4d10.1057_palgrave.jors.2602164.html
   My bibliography  Save this article

A market-driven approach to the optimal stocking problem on African game ranches

Author

Listed:
  • J W Hearne

    (School of Mathematical and Geospatial Sciences, RMIT University)

Abstract

As the growing game ranch industry in Africa becomes more sophisticated so the demand grows for tools and techniques that help achieve greater profits. Within the constraints imposed by the need to meet ecological and other requirements in these multispecies systems, there is scope for manipulating the balance of species to meet economic objectives. A new model and approach centred on marketable packages is proposed to address much of the inadequacies of current practice and previous approaches to the problem. The solution method uses column-generation techniques to generate optimal hunting and live sales packages. Optimal stocking rates for each species then follow. The procedure is illustrated for a typical 4000 ha game farm in a semi-arid region.

Suggested Citation

  • J W Hearne, 2007. "A market-driven approach to the optimal stocking problem on African game ranches," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 423-428, April.
    • Handle: RePEc:pal:jorsoc:v:58:y:2007:i:4:d:10.1057_palgrave.jors.2602164
    DOI: 10.1057/palgrave.jors.2602164
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602164
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602164?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. C S Sung & J M Hong, 1999. "Branch-and-price algorithm for a multicast routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(11), pages 1168-1175, November.
    2. G Scheithauer & J Terno & A Müller & G Belov, 2001. "Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(12), pages 1390-1401, December.
    3. K Papoutsis & C Valouxis & E Housos, 2003. "A column generation approach for the timetabling problem of Greek high schools," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(3), pages 230-238, March.
    4. John Hearne & Jan Korrûbel & Kathryn Koch, 2000. "Modelling to optimise consumptive use of game," Annals of Operations Research, Springer, vol. 95(1), pages 269-284, January.
    5. Paul R. Day & David M. Ryan, 1997. "Flight Attendant Rostering for Short-Haul Airline Operations," Operations Research, INFORMS, vol. 45(5), pages 649-661, October.
    Full references (including those not matched with items on IDEAS)

    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. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    2. Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.
    3. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    4. Oliver Czibula & Hanyu Gu & Aaron Russell & Yakov Zinder, 2017. "A multi-stage IP-based heuristic for class timetabling and trainer rostering," Annals of Operations Research, Springer, vol. 252(2), pages 305-333, May.
    5. Doi, Tsubasa & Nishi, Tatsushi & Voß, Stefan, 2018. "Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time," European Journal of Operational Research, Elsevier, vol. 267(2), pages 428-438.
    6. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    7. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    8. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    9. Nissen, Rüdiger & Haase, Knut, 2004. "Duty-period-based network model for airline crew rescheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 581, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    11. C S Sung & H C Rim, 2004. "Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 630-639, June.
    12. Beraldi, P. & Bruni, M.E. & Conforti, D., 2009. "The stochastic trim-loss problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 42-49, August.
    13. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    14. Haroldo Santos & Eduardo Uchoa & Luiz Ochi & Nelson Maculan, 2012. "Strong bounds with cut and column generation for class-teacher timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 399-412, April.
    15. Meysam Shahvali KOHSHORI & Mehrnaz Shirani LIRI, 2012. "Multi Population Hybrid Genetic Algorithms for University Course Timetabling," Economics and Applied Informatics, "Dunarea de Jos" University of Galati, Faculty of Economics and Business Administration, issue 2, pages 5-16.
    16. E. Rod Butchers & Paul R. Day & Andrew P. Goldie & Stephen Miller & Jeff A. Meyer & David M. Ryan & Amanda C. Scott & Chris A. Wallace, 2001. "Optimized Crew Scheduling at Air New Zealand," Interfaces, INFORMS, vol. 31(1), pages 30-56, February.
    17. Chang, Shaw Ching, 2002. "A new aircrew-scheduling model for short-haul routes," Journal of Air Transport Management, Elsevier, vol. 8(4), pages 249-260.
    18. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    19. K A Willoughby & C J Zappe, 2006. "A methodology to optimize foundation seminar assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 950-956, August.
    20. Sophie Veldhoven & Gerhard Post & Egbert Veen & Tim Curtois, 2016. "An assessment of a days off decomposition approach to personnel shift scheduling," Annals of Operations Research, Springer, vol. 239(1), pages 207-223, April.

    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:pal:jorsoc:v:58:y:2007:i:4:d:10.1057_palgrave.jors.2602164. 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.palgrave-journals.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.