Abstract
We describe a setting where the arc routing activity is the principal operational focus of an enterprise. The cattle yard in Arizona studied in this chapter produces cattle for the general meat market. Cattlemen do not set the price for their product, which fluctuates depending on supply, demand and the psychology of the cattle market at the time of sale. Therefore, reducing operational costs is a major concern of a cattle yard, whose main operation is the daily delivery of feed to all the livestock. Since the feeding troughs are located along the sides of the pens, the profitability of the enterprise depends on finding the optimal arc traversals!
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Assad, A.A. and B.L. Golden (1995). “Arc Routing Methods and Applications”, in M.O. Ball et al., Eds., Handbooks in OR & MS, Vol. 8, 375–483, Elsevier Science B.V.
Bodin, L.D. and S.J. Kursh (1978). “A computer-assisted system for the routing and scheduling of street sweepers”, Operations Research 26, 525–537.
Christofides, N., V. Campos, A. Corberan and E. Mota (1986). “An algorithm for the Rural Postman Problem on a directed graph”, Mathematical Programming Study 26, 155–166.
Clarke, G. and J.W. Wright (1964) “Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research 12, 568–581.
Dror, M. and A. Langevin (1997). “A Generalised Traveling Salesman Problem (GTSP) approach to the Directed Clustered Rural Postman Problem”, Transportation Science 31, 187–192.
Dror, M., G. Laporte and P. Trudeau (1994). “Exact Solutions for Split Delivery Routing”, Discrete Applied Mathematics 50, 3:239–254.
Dror, M. and J.M.Y. Leung (1998) “Combinatorial optimization in a cattle yard: Feed distribution, vehicle scheduling, lot sizing and dynamic pen assignment” in Industrial Applications of Combinatorial Optimization, G. Yu (ed.), Kluwer Academic Publishers, Netherlands, p. 142–171.
Dror, M. and L. Levy (1986). “A vehicle routing improvement algorithm — comparison of a ‘greedy’ and a ‘matching’ implementation for inventory routing”, Computers and Operations Research, 13, 33–45.
Dror, M. and P. Trudeau (1989). “Savings by split delivery routing”, Transportation Science 23, 141–145.
Dror, M. and P. Trudeau (1990). “Split Delivery Routing,” Naval Research Logistics 37, 383–402.
Eglese, R.W. (1994). “Routing winter gritting vehicles”, Discrete Applied Mathematics 48, 231–244.
Eglese, R.W. and H. Murdock (1991). “Routing read sweepers in rural area”, J. Oper. Res. Soc. 42 (4), 281–288.
Eiselt, H.A., M. Gendreau and G. Laporte (1995a). “Arc routing problems. Part I: The Chinese Postman Problem”, Operations Research 43, 231–242.
Eiselt, H.A., M. Gendreau and G. Laporte (1995b). “Arc routing problems. Part II: The Rural Postman Problem”, Operations Research 43, 399–414.
Garey, M.R., and D.S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco.
Gendreau, M., A. Hertz and G. Laporte (1992). “New insertion and post-optimization procedures for the Traveling Salesman Problem”, Operations Research 40, 1086–1094.
Golden, B.L. and R.T. Wong (1981). “Capacitated arc routing problems”, Networks, 11, 305–315.
Golden, B., J. DeArmon and E. Baker (1983). “Computational experiments with algorithms for a class of routing problems”, Comp. Oper. Res. 10, 47–69.
Hertz, A. and M. Mittaz (2000), “Heuristic Algorithms”, in Dror, M. ed. Arc Routing: Theory, Solutions and Applications (this book).
Lin, S., B.W. Kernighan (1973). “An effective heuristic algorithm for the traveling salesman problem”, Operations Research, 21, 498–516.
Manber, U. and S. Israni (1984). “Pierce point minimization and optimal torch path determination in flame cutting”, J. Manufact. Syst. 3, 81–89.
Mullaseril, P.A., (1996). “Capacitated Rural Postman Problem with Time Windows and Split Delivery”, Ph.D. Thesis, MIS Department, University of Arizona, Tucson, Arizona, 85721.
Mullaseril, P.A., M. Dror and J.M.Y. Leung (1997). “Split delivery routing heuristics in livestock feed distribution”, Journal of Operational Research Society 48, 107–116.
Mullaseril, P.A., and M. Dror (1997). “A set covering approach for node and arc routing problems with split delivery and time windows”, Working Paper, MIS Department, University of Arizona (submitted for publication).
Noon, C.E. and J.C. Bean (1991). “A Lagrangean based approach to the asymmetric Generalised Traveling Salesman Problem”, Operations Research 39, 623–632.
Noon, C.E. and J.C. Bean (1993). “An efficient transformation of the Generalised Traveling Salesman Problem”, INFOR 31, 39–44.
Potvin, J.-Y. and J.-M. Rousseau (1995) “An exchange heuristic for routeing problems with time-windows”, Journal of the Operational Research Society 46, 1433–1446.
Stern, H. and M. Dror (1979). “Routing electric meter readers”, Comp. Oper. Res. 6, 209–223.
Tracey, M. and M. Dror (1996). “Interactive graphical computer application for large-scale cattle feed distribution management”, Decision Support Systems 19, 61–72.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dror, M., Leung, J.M.Y., Mullaseril, P.A. (2000). Livestock Feed Distribution and Arc Traversal Problems. In: Dror, M. (eds) Arc Routing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4495-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4495-1_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7026-0
Online ISBN: 978-1-4615-4495-1
eBook Packages: Springer Book Archive