Journal ArticleDOI
Capacitated arc routing problems
Bruce L. Golden,Richard T. Wong +1 more
Reads0
Chats0
TLDR
The intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems.Abstract:
A capacitated node routing problem, known as the vehicle routing or dispatch problem, has been the focus of much research attention On the other hand, capacitated arc routing problems have been comparatively neglected Both classes of problems are extremely rich in theory and applications Our intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems In addition, we identify several related routing problems and develop tight lower bounds on the optimal solutionread more
Citations
More filters
Posted Content
Complexity Of Vehicle Routing And Scheduling Problems
TL;DR: The complexity of a class of vehicle routing and scheduling problems is investigated and known NP-hardness results are reviewed and compiled to compile the worst-case performance of approximation algorithms.
Journal ArticleDOI
Arc Routing Problems, Part II: The Rural Postman Problem
TL;DR: The Rural Postman Problem (RPP) is reviewed and applications are organized as follows: Applications, the Undirected R PP, the Directed RPP, the Stacker Crane problem, the Capacitated Arc Routing Problem.
Journal ArticleDOI
Review: Industrial aspects and literature survey: Fleet composition and routing
TL;DR: The purpose of this paper is to describe industrial aspects of combined fleet composition and routing in maritime and road-based transportation, and to present the current status of research in the form of a comprehensive literature review.
Journal ArticleDOI
Routing problems: A bibliography
Gilbert Laporte,Ibrahim H. Osman +1 more
TL;DR: This bibliography contains 500 references on four classical routing problems: the Traveling Salesman problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the Rural Postman problem.
References
More filters
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Journal ArticleDOI
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Journal ArticleDOI
P-Complete Approximation Problems
Sartaj Sahni,Teofilo F. Gonzalez +1 more
TL;DR: For P- complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete.
Journal ArticleDOI
On the Computational Complexity of Combinatorial Problems
TL;DR: A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense that either all or none of them can be solved in polynomial time.
Journal ArticleDOI
Networks and vehicle routing for municipal waste collection
E. J. Beltrami,Lawrence D. Bodin +1 more
TL;DR: Vehicle routing for municipal waste collection encompasses a variety of problems and the techniques developed for solving some of these problems are explored.