Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems

References

• Ball M. O., Magnati T. L., Monma C. L., Nemhauser G. L.Network Routing (1995) (Institute for Operations Research and Management Sciences, Elsevier Science B. V., Amsterdam, The Netherlands) Google Scholar
• Bodin L. D., Golden B. L., Assad A., Ball M. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10(1):69–211Google Scholar
• Cao B., Rinderle K. Traveling salesman problem with path dependent costs—Generalization of one-dimensional search with traveling cost. (1992) . Technical report S-9201, Institute of System and Operations Research, University of the Federal Armed Forces-Munich, Neubiberg, GermanyGoogle Scholar
• Carlton W. B., Barnes J. W. Solving the traveling salesman problem with time windows using tabu search. IEE Trans. (1996) 28:617–629Crossref, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40(2):342–354Link, Google Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13(6):533–549Crossref, Google Scholar
• Glover F. Tabu search fundamentals and uses. (1992) (School of Business, University of Colorado at Boulder, Cororado) Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. (1992) . Technical report CRT-777, Center for Research on Transportation, Université de Montréal, Montréal, CanadaGoogle Scholar
• Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. (1976) (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois) . PhD dissertationGoogle Scholar
• Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35(2):254–265Link, Google Scholar