IDEAS home Printed from https://ideas.repec.org/a/wly/agribz/v10y1994i2p179-191.html
   My bibliography  Save this article

Scheduling efficiencies of Farm-to-plant milk collection in Western Ohio

Author

Listed:
  • Russell T. Coltman

    (Department of Agricultural Economics and Rural Sociology, The Ohio State University)

  • Gary D. Schnitkey

    (Department of Agricultural Economics and Rural Sociology, The Ohio State University)

  • Mario J. Miranda

    (Department of Agricultural Economics and Rural Sociology, The Ohio State University)

Abstract

We examined the efficiency of farm-to-plant milk collection in western Ohio. Results suggest that mileage reductions of 10% are possible by reordering farm stops while collecting loads of milk. A further 3% reduction is possible by moving dairy farms between loads. When examining efficiencies, guaranteed lowest mileage (GLM) and heuristic algorithms were used to generate schedules. Heuristic algorithms account for about 80% of the mileage reductions identified by GLM algorithms. GLM algorithms are computationally feasible for ordering farm stops while collecting milk loads. However, heuristic algorithms must be relied on for moving dairy farms between loads.

Suggested Citation

  • Russell T. Coltman & Gary D. Schnitkey & Mario J. Miranda, 1994. "Scheduling efficiencies of Farm-to-plant milk collection in Western Ohio," Agribusiness, John Wiley & Sons, Ltd., vol. 10(2), pages 179-191.
    • Handle: RePEc:wly:agribz:v:10:y:1994:i:2:p:179-191
    DOI: 10.1002/1520-6297(199403/04)10:2<179::AID-AGR2720100207>3.0.CO;2-L
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. Dimitris J. Bertsimas & Garrett van Ryzin, 1991. "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, INFORMS, vol. 39(4), pages 601-615, August.
    2. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Sehulster, Jean M. & Pratt, James E., 1983. "Potential Savings in Farm Milk Pickup Costs from Eliminating Route Duplication and Using Improved Scheduling Techniques," Research Bulletins 184123, Cornell University, Department of Applied Economics and Management.
    4. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    5. Bocxe, M. A. G. & Tilanus, C. B., 1985. "Testing vehicle scheduling programs for milk collection," European Journal of Operational Research, Elsevier, vol. 20(1), pages 25-33, April.
    6. Beierlein, James G. & Kirkland, Jack J. & Cummins, Melissa J., 1988. "A Systems Approach to Minimizing the Total Cost of Moving Milk from Farmers to Consumers in Pennsylvania," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 29(1).
    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. van de Klundert, J. & Wormer, L., 2008. "ASAP: the after salesman problem," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    3. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    4. Atieh Madani & Rajan Batta & Mark Karwan, 2021. "The balancing traveling salesman problem: application to warehouse order picking," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 442-469, July.
    5. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    6. Diego Muñoz-Carpintero & Doris Sáez & Cristián E. Cortés & Alfredo Núñez, 2015. "A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach," Transportation Science, INFORMS, vol. 49(2), pages 239-253, May.
    7. Havinga, Maik J.A. & de Jonge, Bram, 2020. "Condition-based maintenance in the cyclic patrolling repairman problem," International Journal of Production Economics, Elsevier, vol. 222(C).
    8. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    9. Joris van de Klundert & Laurens Wormer, 2010. "ASAP: The After-Salesman Problem," Manufacturing & Service Operations Management, INFORMS, vol. 12(4), pages 627-641, March.
    10. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
    11. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    12. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    13. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    14. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    15. Douglas G. Macharet & Armando Alves Neto & Vila F. Camara Neto & Mario F. M. Campos, 2018. "Dynamic region visit routing problem for vehicles with minimum turning radius," Journal of Heuristics, Springer, vol. 24(1), pages 83-109, February.
    16. Chou, Yon-Chun & Chen, Yao-Hung & Chen, Hui-Min, 2014. "Pickup and delivery routing with hub transshipment across flexible time periods for improving dual objectives on workload and waiting time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 98-114.
    17. Swihart, Michael R. & Papastavrou, Jason D., 1999. "A stochastic and dynamic model for the single-vehicle pick-up and delivery problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 447-464, May.
    18. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    19. Nikhil Garg & Hamid Nazerzadeh, 2022. "Driver Surge Pricing," Management Science, INFORMS, vol. 68(5), pages 3219-3235, May.
    20. Papastavrou, Jason D., 1996. "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, Elsevier, vol. 95(1), pages 167-177, November.

    More about this item

    Statistics

    Access and download statistics

    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:wly:agribz:v:10:y:1994:i:2:p:179-191. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1520-6297 .

    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.