Abstract
As explained in Chapter 4, most realistic Arc Routing Problems are known to be NP-hard. Therefore we can expect that there will be certain instances which are impossible to solve to optimality within a reasonable time. However, this does not mean that all instances will be impossible to solve. It may well be that an instance which arises in practice has some structure which makes it amenable to solution by an optimization algorithm. Since, in addition, significant costs are often involved in realworld instances, research into devising optimization algorithms is still regarded as important.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Araque, J.R. (1990) Lots of combs of different sizes for vehicle routing. Discussion Paper, Centre for Operations Research and Econometrics, Catholic University of Louvain, Belgium.
Araque, J.R., L.A. Hall & T.L. Magnanti (1990) Capacitated trees, capacitated routing and associated polyhedra. Discussion Paper, Centre for Operations Research and Econometrics, Catholic University of Louvain, Belgium.
Assad, A.A. & B.L. Golden (1995) Arc routing methods and applications. In M.O. Ball, T.L. Magnanti, C.L. Monma & G.L. Nemhauser (Eds.) Network Routing. Handbooks of Operations Research and Management Science, 8. Amsterdam: North Holland.
Augerat, P., J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef & G. Rinaldi (1995). Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Research report RR949-M, ARTEMIS-IMAG, France.
Ball, M.O. & M.J. Magazine (1988) Sequencing of insertions in printed circuit board assembly. Oper. Res., 36, 192–201.
Belenguer, J.M. (1990) The capacitated arc-routing problem polyhedron. PhD dissertation (in Spanish), Dept. of Stats and OR, University of Valencia, Spain.
Belenguer, J.M. & E. Benavent (1998a) The capacitated arc routing problem: valid inequalities and facets. Computational Optimization & Applications, 10, 165–187.
Belenguer, J.M. & E. Benavent (1998b) A cutting-plane algorithm for the capacitated arc routing problem. Working Paper, Dept. of Stats and OR, University of Valencia, Spain.
Christof, T. & G. Reinelt (1996) Combinatorial optimization and small polytopes. Top (J. Span. Stats. & O.R. Soc), 4, 1–64.
Christofides, N. (1973) The optimum traversal of a graph. Omega, 1, 719–732.
Christofides, N., E. Benavent, V. Campos, A. Corberán & E. Mota (1984) An optimal method for the mixed postman problem, in P. Thoft-Christensen (Ed.) System Modelling and Optimization, Lecture Notes in Control and Inf. Sciences, 59. Berlin: Springer.
Christofides, N., V. Campos, A. Corberán & E. Mota (1981) An algorithm for the rural postman problem. Report ICO.R.81.5, Imperial College, London.
Christofides, N., V. Campos, A. Corberán & E. Mota (1986) An algorithm for the rural postman problem on a directed graph. Math. Prog. Study, 26, 155–166.
Corberán, A., A. Romero & J.M. Sanchis (1997) Facets of the mixed rural postman polyhedron. Working paper, Dept. of Stats and OR, University of Valencia, Spain.
Corberán, A., & J.M. Sanchis (1994) A polyhedral approach to the rural postman problem. Eur. J. Opl Res., 79, 95–114.
Corberán, A., & J.M. Sanchis (1998) The general routing problem polyhedron: facets from the RPP and GTSP polyhedra. Eur. J. Opl Res., 108, 538–550.
Cornuéjols, C., & F. Harche (1993) Polyhedral study of the capacitated vehicle routing problem. Math. Prog., 60, 21–52.
Cornuéjols, G., J. Fonlupt & D. Naddef (1985) The traveling salesman problem on a graph and some related integer polyhedra. Math. Prog., 33, 1–27.
Edmonds, J. (1963) The Chinese postman problem. Oper. Res., 13, Suppl. 1, B73–B77.
Edmonds, J. & E.L. Johnson (1973) Matchings, Euler tours and the Chinese postman. Math. Prog., 5, 88–124.
Eiselt, H.A., M. Gendreau & G. Laporte (1995) Arc-routing problems, part 1: the Chinese postman problem. Oper. Res., 43, 231–242.
Eiselt, H.A., M. Gendreau & G. Laporte (1995) Arc-routing problems, part 2: the rural postman problem. Oper. Res., 43, 399–414.
Fleischmann, B. (1985) A cutting-plane procedure for the traveling salesman problem on a road network. Eur. J. Opl Res., 21, 307–317.
Ford, L.R. & D.R. Fulkerson (1962) Flows in Networks. Princeton University Press, Princeton, NJ.
Garey, M.R. & D.S. Johnson (1979) Computers and Intractability: a guide to the theory of NP-completeness. San Fr.; Freeman.
Ghiani, G. & G. Laporte (1997) A branch-and-cut algorithm for the undirected rural postman problem. Working Paper, Centre for Research on Transportation, University of Montréal.
Golden, B.L. & R.T. Wong (1981) Capacitated arc routing problems. Networks, 11, 305–315.
Gottlieb, E.S. & M.R. Rao (1990a) The generalised assignment problem: valid inequalities and facets. Math. Program., 46, 31–52
Gottlieb, E.S. & M.R. Rao (1990b) (1, k)-configuration facets for the generalised assignment problem. Math. Program., 46, 53–60.
M. Grötschel & M.W. Padberg (1985) Polyhedral theory. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy-Kan & D.B. Schmoys (eds.) The Traveling Salesman Problem. New York: Wiley.
Grötschel, M. & Z. Win (1988) On the windy postman polyhedron. Report No. 75, Schwerpunkt-progam der Deutschen Forschungsgeneinschaft, Universität Augsburg, Germany.
Grötschel, M. & Z. Win (1992) A cutting plane algorithm for the windy postman problem. Math. Prog., 55, 339–358.
Guan, M. (1962) Graphic programming using odd or even points. Chinese Math., 1, 237–277.
Guan, M. (1984) On the windy postman problem. Discr. Appl. Math., 9, 41–46.
Gun, H. (1993) Polyhedral structure and efficient algorithms for certain classes of directed rural postman problem. PhD dissertation, Applied Math. Program, University of Maryland at College Park, Md.
Jünger, M., G. Reinelt & G. Rinaldi (1995) The traveling salesman problem. In M.O. Ball, T.L. Magnanti, C.L. Monma & G.L. Nemhauser (Eds.) Network Models. Handbooks on Operations Research and Management Science Vol. 7. Amsterdam: Elsevier.
Jünger, M., G. Reinelt & G. Rinaldi (1997) The traveling salesman problem. In M. Dell’Amico, F. Maffioli & S. Martello (Eds.) Annotated Bibliographies in Combinatorial Optimization. Chichester: Wiley.
Kappauf, C.H. & G.J. Koehler (1979) The mixed postman problem. Disc. Appl. Math., 1, 89–103.
Karp, R.M. & C.H. Papadimitriou (1982) On linear characterizations of combinatorial optimization problems. SI AM J. Comput., 11, 620–632.
Lenstra, J.K. & A.H.G. Rinnooy-Kan (1976) On general routing problems. Networks, 6, 273–280.
Letchford, A.N. (1997a) Polyhedral results for some constrained arcrouting problems. PhD Dissertation, Dept. of Management Science, Lancaster University.
Letchford, A.N. (1997b) New inequalities for the general routing problem. Eur. J. Opl Res., 96, 317–322.
Letchford, A.N. (1999) The general routing problem: a unifying framework. Eur. J. Opl Res., 112, 122–133.
Letchford, A.N. & R.W. Eglese (1998) The rural postman problem with deadline classes. Eur. J. of Opl Res., 105, 390–400.
Nemhauser, G.L. & L.A. Wolsey (1988) Integer and Combinatorial Optimization. New York: Wiley.
Nobert, Y. & J.-C. Picard (1996) An optimal algorithm for the mixed Chinese postman problem. Networks, 21, 95–108.
Orloff, C.S. (1974) A fundamental problem in vehicle routing. Networks, 4, 35–64.
Padberg, M.W. & G. Rinaldi (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev., 33, 60–100.
Papadimitriou, C.H. (1976) On the complexity of edge traversing. J. of the A.CM., 23, 544–554.
Queyranne, M. & Y. Wang (1992) On the convex hull of feasible solutions to certain combinatorial problems. Oper. Res. Lett., 11, 1–11.
Ralphs, T.K. (1993) On the mixed Chinese postman problem. Oper. Res. Lett., 14, 123–127.
Romero, A. (1997) The rural postman polyhedron on a mixed graph. PhD dissertation (in Spanish), Dept. of Stats and OR, University of Valencia, Spain.
Savall, J.V. (1990) Polyhedral results and approximate algorithms for the directed rural postman problem. PhD Dissertation (in Spanish), Dept. of Stats and OR, University of Valencia, Spain.
Welz, S.A. (1994) Optimal solutions for the capacitated arc routing problem using integer programming. PhD Dissertation, Dept. of QT and OM, University of Cincinnati.
Weyl, H. (1935) Elementare Theorie der konvexen Polyeder. Comentarii Mathematici Helvetica, 7, 290–306.
Win, Z. (1987) Contributions to routing problems. Doctoral Dissertation, Universität Augsburg, Germany.
Win, Z. (1989) On the windy postman problem on Eulerian graphs. Math. Prog., 44, 97–112.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Eglese, R.W., Letchford, A.N. (2000). Polyhedral Theory for Arc Routing Problems. In: Dror, M. (eds) Arc Routing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4495-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4495-1_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7026-0
Online ISBN: 978-1-4615-4495-1
eBook Packages: Springer Book Archive