Combinatorial Optimization in a Cattle Yard: Feed Distribution, Vehicle Scheduling, Lot Sizing, and Dynamic Pen Assignment
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.
KeywordsSchedule Problem Vehicle Rout Problem Feed Type Early Start Time Vehicle Schedule
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- 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
- M. Dror and P. Trudeau, 1990, Split delivery routing, Naval Research Logistics 37, 383–402.Google Scholar
- 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
- 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
- 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
- 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