Journal Article10.1002/NET.3230110308
Capacitated arc routing problems
Bruce L. Golden,Richard T. Wong +1 more
551
TL;DR: 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.
read more
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 solution
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Complexity Of Vehicle Routing And Scheduling Problems
Jan Karel Lenstra,A. H. G. Rinnooy Kan +1 more
- 01 Jan 1979
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.
1.1K
Min-Max K-vehicles windy rural postman problem
TL;DR: The Min-Max version of the windy rural postman problem with several vehicles is introduced, and an ILP formulation is presented and its associated polyhedron is studied.
403
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.
379
Combinatorial optimization and Green Logistics
TL;DR: The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems.
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
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.
13.6K
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.
4.1K
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.
1.8K
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.
749
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.
522