Classification in vehicle routing and scheduling
1981; Wiley; Volume: 11; Issue: 2 Linguagem: Inglês
10.1002/net.3230110204
ISSN1097-0037
Autores Tópico(s)Advanced Graph Theory Research
ResumoNetworksVolume 11, Issue 2 p. 97-108 Keynote Addresses Classification in vehicle routing and scheduling Lawrence Bodin, Lawrence Bodin College of Business and Management, University of Maryland at College Park, Maryland 20742Search for more papers by this authorBruce Golden, Bruce Golden College of Business and Management, University of Maryland at College Park, Maryland 20742Search for more papers by this author Lawrence Bodin, Lawrence Bodin College of Business and Management, University of Maryland at College Park, Maryland 20742Search for more papers by this authorBruce Golden, Bruce Golden College of Business and Management, University of Maryland at College Park, Maryland 20742Search for more papers by this author First published: Summer 1981 https://doi.org/10.1002/net.3230110204Citations: 216AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onEmailFacebookTwitterLinkedInRedditWechat References 1 E. Baker, " Efficient Heuristic Solutions for the Airline Crew Scheduling Problem", D.B.A. thesis, University of Maryland, College Park, Maryland, 1979. 2 M. Ball, " A Comparison of Relaxations and Heuristics for Certain Crew and Vehicle Scheduling Problems", presented at National ORSA/TIMS Meeting, Washington, DC (1980). 3 M. Ball, L. Bodin, and R. Dial, " Experimentation With a Computerized System for Scheduling Mass Transit Vehicles and Crews", presented at the International Workshop on Urban Passenger, Vehicle, and Crew Scheduling, The University of Leeds, England (July 1980). 4 M. Ball, L. Bodin, B. Golden, A. Assad, and C. Stathes, " A Strategic Truck Fleet Sizing Problem Analyzed by a Routing Heuristic", submitted for publication. 5 G. Bennington and K. Rebibo, " Overview of RUCUS Vehicle Scheduling Program (BLOCKS)", in Preprints: Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services, D. Bergmann and L. Bodin, Eds. (1975). 6 L. Bodin, "A Taxonomic Structure for Vehicle Routing and Scheduling Problems", Comput. Urban Soc., 1, 11–29 (1975). 7 L. Bodin and L. Berman, "Routing and Scheduling of School Buses by Computer", Transp. Sci., 13, 113–129 (1979). 8 L. Bodin and S. Kursh, "A Computer-Assisted System for the Routing and Scheduling of Street Sweepers", Oper. Res., 26, 525–537 (1978). 9 L. Bodin and S. Kursh, "A Detailed Description of a Computer System for the Routing and Scheduling of Street Sweepers", Comp. Oper. Res., 6, 181–198 (1979). 10 L. Bodin and T. Sexton, " The Subscriber Dial-a-Ride Problem", Final Report, U.S. Department of Transportation, Urban Mass Transportation Administration, Washington, D.C. (1979). 11 L. Bodin, D. Rosenfield, and A. Kydes, "UCOST, a Micro Approach to a Transit Planning Problem", J. Urban Anal., 5, 47–69 (1978). 12 N. Christofides and S. Eilon, "An Algorithm for the Vehicle Dispatching Problem", Oper. Res. Q., 20, 309–318 (1969). 13 N. Christofides, A. Mingozzi, and P. Toth, " Exact Algorithms for the Vehicle Routing Problem, Based on Spanning Trees and Shortest Path Relaxations", Math. Program., to appear. 14 G. Clarke and J. Wright, "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Oper. Res., 12, 568–581 (1964). 15 H. Crowder and M. Padberg, "Solving Large-Scale Symmetric Traveling Salesman Problems to Optimality", Manag. Sci., 26, 495–509 (1980). 16 G. Dantzig and J. Ramser, "The Truck Dispatching Problem", Manag. Sci., 6, 81–91 (1959). 17 U. Derigs, " A Shortest Augmenting Path Method for Solving Minimal Perfect Matching Problems", Technical Report, University of Cologne, Cologne, West Germany (April 1979). 18 U. Derigs and G. Kazakidis, " On Two Methods for Solving Minimal Perfect Matching Problems", Technical Report, University of Cologne, Cologne, West Germany (May 1979). 19 W. Finnegan, " A Network Model for Bidline Generation", in FEC Technical Report, Federal Express Corp., Memphis, TN (1977). 20 L. Ford and D. Fulkerson, Flows in Networks, Princeton U.P., Princeton, NJ, 1962. 21 B. Gavish and K. Srikanth, " Mathematical Formulations for the Dial-a-Ride Problem", submitted for publication. 22 B. Gillett and T. Johnson, "Multi-terminal Vehicle-Dispatch Algorithm", Omega, 4, 711–718 (1976). 23 B. Gillett and L. Miller, "A Heuristic Algorithm for the Vehicle Dispatch Problem", Oper. Res., 22, 340–349 (1974). 24 B. Golden, " Recent Developments in Vehicle Routing", in Computers and Mathematical Programming, W. White, Ed., National Bureau of Standards Special Publication 502, Washington, DC, 233–240 (1978). 25 B. Golden, A. Assad, and L. Levy, " The Fleet Size and Mix Vehicle Routing Problem", submitted for publication. 26 B. Golden, L. Bodin, T. Doyle, and W. Stewart, "Approximate Traveling Salesman Algorithms", Oper. Res., 28, 694–711 (1980). 27 B. Golden, T. Magnanti, and H. Nguyen, "Implementing Vehicle Routing Algorithms", Networks, 7, 113–148 (1977). 28 B. Golden and R. Wong, " Capacitated Arc Routing Problems", Networks, to appear. 29 M. Held and R. Karp, "The Traveling-Salesman Problem and Minimum Spanning Trees", Oper. Res., 18, 1138–1162 (1970). 30 M. Held and R. Karp, "The Traveling-Salesman Problem and Minimum Spanning Trees, Part II", Math. Program., 1, 6–25 (1971). 31 J. Hinson and S. Mulherkar, " Improvements to the Clarke and Wright Algorithm as Applied to an Airline Scheduling Problem", Technical Report, Federal Express Corp. (1975). 32 R. Karp, "Probabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plane", Math. Oper. Res., 2, 209–224 (1977). 33 P. Krolak, W. Felts, and G. Marble, "A Man-Machine Approach toward Solving the Traveling Salesman Problem", Comm. ACM, 14, 327–334 (1971). 34 P. Krolak, W. Felts, and J. Nelson, "A Man-Machine Approach Toward Solving the Generalized Truck Dispatching Problem", Transp. Sci., 6, 149–169 (1972). 35 S. Lin, "Computer Solutions of the Traveling Salesman Problem", Bell Syst. Tech. J., 44, 2245–2269 (1965). 36 S. Lin and B. Kernighan, "An Effective Heuristic Algorithm for the Traveling Salesman Problem", Oper. Res., 21, 498–516 (1973). 37 R. Marsten, M. Muller, and C. Killion, " Crew Planning at Flying Tiger: A Successful Application of Integer Programming", Technical Report No. 553, Management Information Systems Dept., University of Arizona, Tucson, AZ (1978). 38 E. Minieka, "The Chinese Postman Problem for Mixed Networks", Manag. Sci., 25, 643–648 (1979). 39 R. Newton and W. Thomas, "Bus Routing in a Multi-School System", Comput Oper. Res., 1, 213–222 (1974). 40 J. Norback and R. Love, "Heuristic Geometric Approaches to Solving the Traveling Salesman Problem", Manag. Sci., 23, 1208–1223 (1977). 41 C. Orloff, "Route Constrained Fleet Scheduling", Transp. Sci., 10, 149–168 (1976). 42 H. Psaraftis, " Dynamic Programming Algorithms for Specially Structured Sequencing and Routing Problems in Transportation", Ph.D. thesis, M.I.T., Cambridge, MA, 1978. 43 J.-M. Rousseau, J. Desrosiers, and J. Ferland, " A School Bus Scheduling System", presented at National ORSA/TIMS Meeting, Washington, DC (1980). 44 R. Russell, "An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions", Oper. Res., 25, 517–524 (1977). 45 R. Russell and W. Igo, "An Assignment Routing Problem", Networks, 9, 1–17 (1979). 46 T. Sexton, " The Single Vehicle Many to Many Routing and Scheduling Problem", Ph.D. thesis, State University of New York at Stony Brook, Stony Brook, NY, 1979. 47 D. Stein, "Scheduling Dial-a-Ride Transportation Systems", Trans. Sci., 12, 232–249 (1978). 48 H. Stern and M. Dror, "Routing Electric Meter Readers", Comput. Oper. Res., 6, 209–223 (1979). 49 W. Stewart and B. Golden, " A Vehicle Routing Algorithm Based on Generalized Lagrange Multipliers", Proceedings of the AIDS 1979 Annual Convention, L. Moore, K. Monroe, B. Taylor, Eds., New Orleans, LA, 1979, Vol. 2, pp. 108–110. 50 A. Wren and B. Smith, " VAMPIRES and TASC: Two Successfully Applied Bus Scheduling Programs", presented at the International Workshop on Urban Passenger, Vehicle, and Crew Scheduling, University of Leeds, Leeds, England (July 1980). Citing Literature Volume11, Issue2Summer 1981Pages 97-108 ReferencesRelatedInformation
Referência(s)