Split-delivery routeing heuristics in livestock feed distribution

Journal of the Operational Research Society

Volumn 48, Issue 2, 1997, Pages 107-116

  Mullaseril, P A ^a   Dror, M ^a   Leung, J ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

Distribution; Heuristics; Logistics management; Networks and graphs; Optimization; Transport; Vehicle routeing

Indexed keywords

DISTRIBUTION OF GOODS; FARMS; GRAPH THEORY; HEURISTIC METHODS; MANAGEMENT; MATHEMATICAL MODELS; TRANSPORTATION ROUTES; TRUCKS;

LIVESTOCK FEED DISTRIBUTION; LOGISTICS MANAGEMENT; NETWORKS AND GRAPHS; SPLIT DELIVERY ROUTEING HEURISTICS; TRANSPORT; VEHICLE ROUTEING;

OPTIMIZATION;

EID: 0031071257     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600338     Document Type: Article

References (18)

1. Bodin, L. D., Kursh, S. J., (1978). A computer-assisted system for the routeing and scheduling of street sweepersOper Res 26: 525-537.
2. Manber, U., Israni, S., (1984). Pierce point minimization and optimal torch path determination in flame cuttingJ Manufact Syst 3: 81-89
3. Stern, H., Dror, M., (1979). Routing electric meter readers Comp Oper Res 6: 209-223.
4. Christofides, N., Campos, V., Corberan, A., Mota, E., (1986).An algorithm for the Rural Postman Problem on a directed graph Mathe Prog Study 26: 155-166.
5. Eiselt H.A., Gendreau M, Laporte G., (1995). Arc routing problems—Part II: The Rural Postman Problem.Operations Research 43: 399-414.
6. Garey, M.R., Johnson, D.J., (1979).Computers and Intract-ability: A Guide to the Theory of NP-completeness. Freeman: San Francisco.
7. Papadimitriou, C.H., (1976). On the complexity of edge traversing J ACM23: 544-554.
8. Pearn, W.L., Assad, A.A., Golden, B.L., (1987). Transforming arc routing into node routing problemsComp Oper Res 14: 185-288.
9. Dror, M., Trudeau, P., (1989). Savings by split delivery routing Trans Sci 23: 141-145.
10. Dror, M., Trudeau, P., (1990). Split delivery routingNaval Res Logis37: 383-402.
11. Dror, M., Laporte, G., Trudeau, P., (1994). Exact solutions for split delivery routingDis Appl Mathe50: 239-254.
12. Dror, M., Leung, J., Mullaseril, P.A., (1995). Routing and Scheduling for Livestock Feed Distribution. Working Paper, Department of M.I.S., University of Arizona.
13. Golden, B., Dearmon, J., Baker, E., (1983). Computational experiments with algorithms for class of routing problems Comp Oper Res10: 47-69.
14. Golden, B.L., Wong, R.T., (1981). Capacitated arc routing problemsNetworks 11: 305-315.
15. Lin, S., Kernighan, B.W., (1973). An effective heuristic algorithm for the travelling salesman problemOper Res 21: 498-516
16. Dror, M., Levy, L., (1986). A vehicle routing improvement algorithm- comparison of a ‘greedy’ and a ‘matching’ imple-mentation for inventory routingComp Oper Res 23: 33-45.
17. Potvin, J.Y., Rousseau, J.M., (1995). An exchange heuristic for routeing problems with time windowsJ Oper Res Soc 46: 1433-1446.
18. Clark, G., Wright, J.W., (1964). Scheduling of vehicles from a central depot to a number of delivery pointsOper Res 12: 568- 581