The capacitated arc routing problem: Valid inequalities and facets

Computational Optimization and Applications

Volumn 10, Issue 2, 1998, Pages 165-187

  Belenguer, J M ^a   Benavent, E ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Arc routing problems; Integer programming; Polyhedral combinatorics; Routing

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC MEASURING INSTRUMENTS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; STRATEGIC PLANNING; OPTIMIZATION;

ARC ROUTING PROBLEMS; GENERALIZED ASSIGNMENT PROBLEMS (GAP); IDENTIFICATION PROCEDURES; POLYHEDRAL COMBINATORICS; CAPACITATED ARC ROUTING PROBLEM; GENERALIZED ASSIGNMENT PROBLEM (GAP);

ROUTERS; INTEGER PROGRAMMING;

EID: 0032070222     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018316919294     Document Type: Article

References (32)

1. A. Assad, W. Pearn, and B.L. Golden, "The capacitated Chinese postman problem: Lower bounds and solvable cases," American J. of Mathematical and Man. Sci., vol. 7, pp. 63-88, 1987.
2. A. Assad and B.L. Golden, "Arc routing methods and applications," Handbook on Operations Research and Management Science, North-Holland, vol. 6, pp. 375-483, 1995.
3. E. Balas and E. Zemel, "Facets of the knapsack polytope from minimal covers," SIAM Journal on Applied Mathematics, vol. 34, pp. 119-148, 1978.
4. J.M. Belenguer, "El poliedro del problema de rutas por arcos con capacidades," Ph.D. Thesis, Universitat de Valencia, 1990.
5. J.M. Belenguer and E. Benavent, "Polyhedral results on the capacitated arc routing problem," Dep. Estadistica e Inv. Op., T.R. 1-92, Univ. de Valencia, 1992.
6. J.M. Belenguer, E. Benavent, and F. Cognata, "A tabu heuristic for the capacitated arc routing problem," 1996, in preparation.
7. E. Beltrami and L. Bodin, "Networks and vehicle routing for municipal waste collection," Networks, vol. 4, pp. 65-94, 1974.
8. E. Benavent, V. Campos, A. Corberan, and E. Mota, "The capacitated arc routing problem. A heuristic algorithm," Questiió., vol. 14, nos. 1-3, pp. 107-122, 1990.
9. E. Benavent, V. Campos, A. Corberan, and E. Mota, "The capacitated arc routing problem. Lower bounds," Networks, vol. 22, pp. 669-690, 1992.
10. L.D. Bodin and S.J. Kursh, "A detailed description of a computer system for the routing and scheduling of street sweepers," Computers and Oper. Res., vol. 6, pp. 181-198, 1979.
11. N. Christofides, "The optimum traversal of a graph," OMEGA, vol. 1, pp. 719-732, 1973.
12. CPLEX Version 2.0, CPLEX Optimization Inc., 1992.
13. G. Cornuejols and F. Harche, "Polyhedral study of the capacitated vehicle routing problem," Mathematical Programming, vol. 60, pp. 21-52, 1993.
14. R. W. Eglese and L.Y.O. Li, "Efficient routing for winter gritting," Journal of the Operational Research Society, vol. 43, pp. 1031-1034, 1992.
15. H.A. Eiselt, M. Gendreau, and G. Laporte, "Arc routing problems, Part 1: The Chinese postman problem," Operations Research, vol. 43, pp. 231-242, 1995.
16. H.A. Eiselt, M. Gendreau, and G. Laporte, "Arc routing problems, Part 2: The rural postman problem," Operations Research, vol. 43, pp. 399-414, 1995.
17. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
18. B.L. Golden and R. Wong, "Capacitated arc routing problems," Networks, vol. 11, pp. 305-315, 1981.
19. B.L. Golden, J.S. DeArmon, and E.K. Baker, "Computational experiments with algorithms for a class of routing problems," Computers and Oper. Res., vol. 10, pp. 47-59, 1983.
20. E.S. Gottlieb and M.R. Rao, "The generalized assignment problem: Valid inequalities and facets," Mathematical Programming, vol. 46, pp. 31-52, 1990.
21. E.S. Gottlieb and M.R. Rao, "(l, k)-Configuration facets for the generalized assignment problem," Mathematical Programming, vol. 46, pp. 53-60, 1990.
22. F. Harche and G. Rinaldi, "The capacity inequalities for the capacitated vehicle routing problem," 1993, in preparation.
23. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley: New York, 1988.
24. M.W. Padberg, "(l, k)-Configurations and facets for packing problems," Mathematical Programming, vol. 18, pp. 94-99, 1980.
25. M.W. Padberg and M.R. Rao, "Odd minimum cut-sets and b-matchings," Mathematics of Oper. Res., vol. 7, pp. 67-80, 1982.
26. M.W. Padberg and G. Rinaldi, "Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut," Operations Research Letters, vol. 6, pp. 1-7, 1987.
27. W.L. Pearn, "New lower bounds for the capacitated arc routing problems," Networks, vol. 18, pp. 181-191, 1988.
28. W.L. Pearn, "Approximate solutions for the capacitated arc routing problem," Computers and Oper. Res., vol. 1, no. 16, pp. 589-600, 1989.
29. W.L. Pearn, "Augment-insert algorithms for the capacitated arc routing problem," Computers and Oper. Res., no. 18, pp. 189-198, 1991.
30. W.L. Pearn, A.A. Assad, and B. L. Golden "Transforming arc routing into node routing problems," Computers and Oper. Res., no. 14, pp. 285-288, 1987.
31. H. Stern and M. Dror, "Routing electric meter readers," Computers and Oper. Res., vol. 6, pp. 209-223, 1979.
32. Z. Win, "Contributions to routing problems," Ph.D. Thesis, University of Augsburg, 1988.