Combinatorial Optimization in a Cattle Yard: Feed Distribution, Vehicle Scheduling, Lot Sizing, and Dynamic Pen Assignment

  • Moshe Dror
  • Janny M. Y. Leung
Part of the Applied Optimization book series (APOP, volume 16)


In this chapter describes various interesting combinatorial optimization problems which constantly present themselves in an operation of a large cattle yard. These problems include feed distribution, distribution vehicle scheduling, feed lot sizing (mixing) operation, and reassignment of cattle to pens. We examine the mathematical models and the corresponding solution methodologies for these problems, modeling them as a combination of arc routing, machine scheduling, lot sizing, and very large general 0–1 integer programming problems. Partial results and the considerable insight gained by our analysis is presented.


Schedule Problem Vehicle Rout Problem Feed Type Early Start Time Vehicle Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Assad and B.L. Golden, 1995, Arc routing methods and applications, in M.O. Ball, et al. (eds.) Handbooks in Operations Research and Management Science, 8, Elsevier Science, Amsterdam, 375–483.Google Scholar
  2. [2]
    L.D. Bodin and S.J. Kursh, 1978, A Computer-Assisted System for the Routing and Scheduling of Street Sweepers, Operations Research, 26, 525537.Google Scholar
  3. [3]
    J. Bruno, and P. Downey, 1978, Complexity of Task Sequencing with Deadlines, Set-up Times and Changeover Costs, SIAM Journal of Computing, 7, 393–404.CrossRefGoogle Scholar
  4. [4]
    D. Cattrysse, M. Salomon, R. Kuik, and L.N. Van Wassenhove, 1993, A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times, Management Science, 39, 477486.Google Scholar
  5. [5]
    G. Clarke and J.W. Wright, 1964, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12, 568–581.CrossRefGoogle Scholar
  6. [6]
    M. Dempster, J.K. Lenstra, and A.H.G. Rinnooy Kan, 1982, Deterministic and Stochastic Scheduling, Reidel, Dordrecht.CrossRefGoogle Scholar
  7. [7]
    J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis, 1995, Time Constrained Vehicle Routing and Scheduling, in M.O. Ball, et al. (eds.) Handbooks in Operations Research and Management Science, Vol. 8, Elsevier Science Publishers B.V., 35–139.Google Scholar
  8. [8]
    M. Dror, G. Laporte, and P. Trudeau, 1994, Exact Solutions for Split Delivery Routing, Discrete Applied Mathematics, 50, 239–254.CrossRefGoogle Scholar
  9. [9]
    M. Thor and P.A. Mullaseril, 1996, Live stock feed distribution: Capacitated Rural Postman Problem with Time Windows, Working Paper, MIS, University of Arizona, Tucson, Arizona.Google Scholar
  10. [10]
    M. Dror and P. Trudeau, 1989, Savings by split delivery routing, Transportation Science 23, 141–145.CrossRefGoogle Scholar
  11. [11]
    M. Dror and P. Trudeau, 1990, Split delivery routing, Naval Research Logistics 37, 383–402.Google Scholar
  12. [12]
    H.A. Eiselt, M. Gandreau, and G. Laporte, 1995, Arc routing problems–Part II: The rural postman problem, Operations Research, 43, 399–414.CrossRefGoogle Scholar
  13. [13]
    B. Fleischmann, 1990, The Discrete Lotsizing and Scheduling Problem, European Journal of Operational Research, 44, 337–348.CrossRefGoogle Scholar
  14. [14]
    M.R. Garey and D.J. Johnson, 1979, Computers and Intractability: A Guide to the theory of NP-completeness, Freeman, San Francisco, CA.Google Scholar
  15. [15]
    B. Golden, J. DeArmon, and E. Baker, 1983, Computational experiments with algorithms for a class of routing problems, Computers and Operations Research, 10, 47–69.CrossRefGoogle Scholar
  16. [16]
    B.L. Golden and R.T. Wong, 1981, Capacitated Arc Routing Problems, Networks, 11, 305–315.CrossRefGoogle Scholar
  17. [17]
    S. van Hoesel, R. Kuik, M. Salomon, and L.N. Van Wassenhove, 1994, The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming, Discrete Applied Mathematics, 48, 289–303.CrossRefGoogle Scholar
  18. [18]
    W. Horn, 1974, Simple Scheduling Algorithms, Naval Research Logistics Quarterly, 21, 177–185.CrossRefGoogle Scholar
  19. [19]
    J.K. Lenstra and A.H.G. Rinnooy Kan, 1976, On General Routing Problem, Networks, 6, 273–280.CrossRefGoogle Scholar
  20. [20]
    J. Maes and L.N. Van Wassenhove, 1988, Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review, Journal of the Operational Research Society, 39, 991–1004.Google Scholar
  21. [21]
    U. Manber and S. Israni, 1984, Pierce point minimization and optimal torch path determination in flame cutting, Journal of Manufacturing Systems, 3, 81–89.CrossRefGoogle Scholar
  22. [22]
    T.L. Magnanti and R. Vachani, 1990, A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs, Operations Research, 38, 456–473.CrossRefGoogle Scholar
  23. [23]
    P.A. Mullaseril, M. Dror, and J. Leung, 1996, Split-Delivery Routing Heuristics in Livestock Feed Distribution, (forthcoming in Journal of Op-erational Research Society).Google Scholar
  24. [24]
    W.L. Pearn, A.A. Assad, and B.L. Golden, 1987, Transforming arc routing into node routing problems, Computers 6 Operations Research, 14, 185208.Google Scholar
  25. [25]
    C.H. Papadimitriou, 1976, On the Complexity of Edge Traversing, Journal of the Association for Computing Machinery, 23, 544–554.CrossRefGoogle Scholar
  26. [26]
    M. Salomon, L.G. Kroon, R. Kuik, and L.N. Van Wassenhove, 1991, Some Extensions of the Discrete Lotsizing and Scheduling Problem, Management Science, 37, 801–812.CrossRefGoogle Scholar
  27. [27]
    H. Stern and M. Dror, 1979, Routing electric meter readers, Computers 4 Operations Research, 6, 209–223.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Moshe Dror
    • 1
  • Janny M. Y. Leung
    • 1
  1. 1.Management Information Systems Department College of Business and Public AdministrationUniversity of ArizonaTucsonUSA

Personalised recommendations