162 Heurísticas Construtivas
5.2 Perspectivas de desenvolvimento
O trabalho apresentado nesta dissertação preconiza um conjunto de desen- volvimentos futuros. Estes consistirão fundamentalmente na inclusão de extensões às implementações realizadas, de forma a expandir o seu domínio de aplicação.
Relativamente aos algoritmos heurísticos desenvolvidas e apresentadas no presente trabalho, pode evoluir-se no sentido de os melhorar, investimento esse que poderá encontrar forma nos seguintes pontos:
1. Modificação dos critérios de decisão na escolha do vértice seguinte (ou- tras variantes aos algoritmos propostos);
2. Flexibilização do mecanismo de redireccionamento do percurso de cor- te ("backtracking").
Um dos desenvolvimentos deste trabalho, a realizar a curto prazo, con- siste na implementação de Meta-Heurísticas (utilizando as heurísticas cons- trutivas implementadas como geradoras de soluções iniciais, por exemplo). Outra estratégia de resolução a desenvolver para o problema de deter- minação de percursos de corte, passa pela construção de modelos de progra- mação matemática para o problema.
Finalmente, o refinamento do Limite Inferior para o PDPC é também um vector de actuação importante, dada a necessidade de definir um processo de medida da optimalidade das soluções obtidas.
Concluindo, espera-se que o trabalho desenvolvido tenha contribuído de alguma forma para a área de investigação dos problemas de rotas em arcos, nomeadamente no âmbito da determinação de percursos de corte, e que se venha a revelar como precursor no desenvolvimento de aplicações práticas inovadoras na mesma área.
[1] B. S. Alprin. A simulation approach to solving the snow and ice removal problem in an urban area. Master's thesis, The University of Tulsa, Oklahoma, 1975.
[2] R. Alvarez-Valdez, E. Benavent, V. Campos, A. Corberán, E. Mota, J. M. Tamarit, and V. Vails. A computerised system for urban garbage collection. 1993.
[3] R. D. Angel, W. L. Caulde, R. Noonan, and A. Whinston. Computer- assisted school bus scheduling. Mgmt. Sci., B18:279-288, 1972. [4] A. A. Assad, W. L. Pearn, and B. L. Golden. The capacitatede Chinese
postman problem: Lower bounds and solvable cases. Am. J. Math,
and Mgmt. Sci., 7:63-88, 1987.
[5] J. M. Belenguer. El Poliedro Del Problema de Rutas Por Arcos Com
Capacidades. PhD thesis, Universidad de Valencia, Spain, 1991.
[6] J. M. Belenguer and E. Benavent. Polyhedral results on the capacita- ted arc routing problem. 1991.
[7] E. Beltrami and L. Bodin. Networks and vehicle routing for municipal waste collection. Networks, 4:65-94, 1974.
[8] E. Benavent, V. Campos, A. Corberán, and E. Mota. The capacitated arc routing problem. A heuristic algorithm. Qúestiió, 14(1-3):107—122, 1990.
[9] E. Benavent, V. Campos, A. Corberán, and E. Mota. The capacitated arc routing problem: lower bounds. Networks, 22(7):669-690, 1992.
168 BIBLIOGRAFIA
[10] E. Benavent, A. Corberan, and E. Mota. Problemas de rutas por arcos. Quaderns d'Estadística, Sistemas, Informática i Investigado
Operativa (QUESTIIÓ), 7:479-490, 1983.
[11] B. Bennett and D. Gazis. School bus routing by computer. Trans.
Res., 6:317, 1972.
[12] L. Bodin, B. Golden, A. Assad, and M. Ball. Routing and scheduling of vehicles and crews. The state of the art. Comput. Oper. Res., 10(2):63- 211, 1983.
[13] L. D. Bodin, G. Fagin, R Welebny, and J. Greenberg. The design of a computerized sanitation vehicle routing and scheduling system for the town of oyster bay, new york. Comput. and Opns. Res., 16:45-54, 1989.
[14] L. D. Bodin and S. J. Kursh. A computer-assisted system for the rou- ting and scheduling of street sweepers. Operations Research, 26:525- 537, 1978.
[15] L. D. Bodin and S. J. Kursh. A detailed description of a computer system for the routing and scheduling of street sweepers. Computers
and Operations Research, 6:181-198, 1979.
[16] J. Bouliane and G. Laporte. Locating postal relay boxes using a set covering algorithm. Am. J. Math, and Mgmt. Sci., 12:65-74, 1992. [17] J. Braca, J. Bramei, B. Posner, and D. Simchi-Levi. A computerized
approach to the new york city school bus routing project. 1993. [18] P. Brucker. The Chinese Postman Problem for Mixed Graphs. Sprin-
ger, Berlin., 1981.
[19] R. G. Busacker and T. L. Saaty. Finite Graphs and Networks: an
Introduction with Applications. McGraw-Hill, New York, 1965.
[20] G. Carpaneto and P. Toth. Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science, 26:736-743, 1980.
[21] L. Chapleau, A. Ferland, G. Lapalme, and J. M. Rousseau. A parallel insert method for the capacitated arc routing problem. O. R. Lett., 3:95-99, 1984.
[22] N. Christofides. The optimum traversal of a graph. Omega, 1:719-732, 1973.
[23] N. Christofides. Graph Theory. An Algorithm Approach. Academic Press, London, 1975.
[24] N. Christofides. Worst-case analysis of a new heuristic for the tra- velling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1976.
[25] N. Christofides, V. Campos, A. Corberan, and E. Mota. An algorithm for the rural postman problem. Technical report, Imperial College, 1981. Report IC-OR.
[26] N. Christofides, V. Campos, A. Corberán, and E. Mota. An algorithm for the rural postman problem on a directed graph. Math. Program-
ming Stud., (26): 155-166, 1986.
[27] R. M. Clark and J. I. Gillean. Analyses of solid waste management operations in Cleveland, ohio. Interfaces, 6 (1, part 2):32-42, 1975. [28] R. M. Clark and C. H. Lee Jr. Systems planning for solid waste
collection. Comput. and Opns. Res., 3:157-173, 1976.
[29] G. Clarke and J. W. Wright. Scheduling of vehicle from a central depot to a number of delivery points. Opns. Res., 12:568-581, 1964. [30] T. M. Cook and B. S. Alprin. Snow and ice removal in an urban
environment. Mgmt. Sci., 23:227-234, 1976.
[31] A. Corberán and J. M. Sanchis. A polyhedral approach to the rural postman problem. European Journal of Operational Research, 79:95- 114, 1994.
170 BIBLIOGRAFIA
[32] A. Corberán and J. M. Sanchis. On the general routing problem polyhedron: Facets from the GTPS and RPP polyhedra. European
Journal of Operational Research, 108:538-550, 1998.
[33] P. F. Córdoba, L. M. Garcia Raffi, and J. M. Sanchis. A heuristic algo- rithm based on monte carlo methods for the rural postman problem.
Computers Ops. Res., 25(12):1097-1106, 1998.
[34] G. Cornuejols, J. Fonlupt, and D. Naddef. The travelling salesman problem on a graph and some related integer polyhedra. Math. Pro-
gramming, 33(1):1—27, 1985.
[35] J. Desrosiers, J. A. Ferland, J. M. Rousseau, G. Lapalme, and L. Cha- pleau. TRANSCOL: A multi-period school bus routing and scheduling system. TIMS Studies Mgmt. Set., 22:47-71, 1986.
[36] M. Dror, H. Stern, and P. Trudeau. Postman tour on a graph with precedence relation on arcs. Networks, 17(3):283-294, 1987.
[37] J. Edmonds. Optimum branching. J. Res. Natl. Bur. Stand., Section B. 71:233-240, 1967.
[38] J. Edmonds and E. L. Johnson. Matching, euler tours and the Chinese postman. Mathematical Programming, 5:88-124, 1973.
[39] R. W. Eglese and L. Y. Li. Efficient routing for winter gritting. JOR-
SA, 43:1031-1034, 1992.
[40] R. W. Eglese and H. Murdock. Routing road sweepers in a rural area.
JORSA, 42:281-288, 1991.
[41] H. A. Eiselt, M. Gendreu, and G. Laporte. Arc routing pro- blems, PART i: The Chinese postman problem. Operations Research, 43(2):231-242, March-April 1995.
[42] H. A. Eiselt, M. Gendreu, and G. Laporte. Arc routing pro- blems, PART II: The rural postman problem. Operations Research, 43(3):399-414, May-June 1995.
[43] R. England. Computer analysis ensures a clean sweep. Surveyor, 6(15), 1982.
[44] L. Euler. Solutio problematis ad geometriam situs pertinentis. Com-
mentarii academiae scientiarum Petropolitanae, 8:128-140, 1736.
[45] J. R. Evans and E. Minieka. Optimization algorithms for networks
and graphs. Marcel Dekker Inc., New York, 1992.
[46] B. Fleischmann. A new class of cutting planes for the simmetric tra- velling salesman problem. Math. Prog., 40:225-246, 1988.
[47] H. Fleischner. Eulerian graphs and related topics. Part 1. Vol. 1. North-Holland Publishing Co., Amsterdam, 1990.
[48] H. Fleischner. Eulerian graphs and related topics. Part 1. Vol. 2. North-Holland Publishing Co., Amsterdam, 1991.
[49] L. R. Ford, Jr. and D. R. Fulkerson. Flows in networks. Princeton University Press, Princeton, N.J., 1962.
[50] G. N. Frederickson. Approximation algorithms for some postman pro- blems. Journal of the ACM, 26(3):538-554, July 1979.
[51] G N. Frederickson, M. S. Hecht, and C. E. Kim. Approximation algorithms for some routing problems. SIAM J. Comput., 7(2):178- 193, 1978.
[52] L. F. Gelders and D. G Cattrysse. Public waste collection: A case study. Belgian J. Opns. Res. Statist, and Comput. Sci., 3:3-15, 1991. [53] E. Gélinas. Le problème du postier chinois avec contraintes générales de préséance. Master's thesis, Ecole Polytechnique de Montréal, Ca- nada, 1992.
[54] B. L. Golden, J. S. deArmon, and E. K. Baker. Computational ex- periments with algorithms for a class of routing problems. Comput.
172 BIBLIOGRAFIA
[55] B. L. Golden and R. T. Wong. Capacitated arc routing problems.
Networks, 11:305-315, 1981.
[56] M. Grõtschel and 0 . Holland. Solution of large-scale travelling sales- man problems. Mathematical Programming, 51(2):141-202, 1991. [57] M. Guan. Graphic programming using odd and even points. Chinese
Math, 1:273-277, 1962.
[58] M. Guan. A survey on the Chinese postman problem. J. Math. Res.
Exposition, 4(1):113-119, 1984.
[59] F. Harary. Graph Theory. Addison-Wesley, Reading, Mass., 1969. [60] E. Haslam and J. R. Wright. Application of routing technologies to
rural snow and ice control. Trans. Res., (1304):202-211, 1991. [61] M. Held and R. M. Karp. The travelling salesman problem and mini-
mum spanning trees: Part II. Math. Prog., 1:6-25, 1971.
[62] C. Hierholzer. Uber die moglichkeit, einen linienzug ohne WiederHo- lung und ohne UnterBrechung zu umfahren. Mathematische Annalen, VL30-32, 1873.
[63] R. M. Karp. A patching algorithm for nonsymmetric travelling sales- man problem. SIAM Journal on Computing, 8:561-573, 1979. [64] A. Kaufmann. Graphs, Dynamic Programming and Finit Games. Aca-
demic Press, New York, 1967.
[65] M. Konopasek. Mathematical treatments of some apparel marking and cutting problems. Technical Report 99-26-90857-10, U.S. Dept. of Commerce, 1981.
[66] G. Laporte. Location-routing problems. In Vehicle routing: methods
and studies, pages 163-197. North-Holland, Amsterdam, 1988.
[67] G. Laporte. Modeling and solving several classes of arc routing problems as travelling salesman problems. Computers Ops. Res., 24(11):1057-1061, 1997.
[68] R. C. Larson and A. R. Odoni. Urban Operations Research. Prentice- Hall, Englewood Cliffs, N. J., 1981.
[69] E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys.
The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, U. K., 1985.
[70] J. K. Lenstra and A. H. G. Rinnooy Kan. On general routing problems.
Networks, 6:273-280, 1976.
[71] L. Levy. The Walking Line of Travel Problem: An Application of Arc
Routing and Partitioning. PhD thesis, University of Maryland, College
Park, Md., 1987.
[72] L. Levy and L. Bodin. Scheduling in the postal carriers for the united states postal service: An application of arc partitioning and routing.
Vehicle Routing: Methods and Studies, pages 359-394, 1988.
[73] L. Levy and L. D. Bodin. The arc oriented location routing problem.
INFOR, 27:74-94, 1989.
[74] T. M. Liebling. Graphentheorie in Planungs- und Tourenproblemen, volume 21 of LN in Operations Research and Mathematical Systems. Springer, Berlin/New York, 1970.
[75] P. F. Limieux and L. Campagna. The snow ploughing problem solved by a graph theory algorithm. Civil Eng. Syst., 1:337-341, 1984. [76] S. Lin and B. W. Kernighan. An effective heuristic algorithm for the
travelling salesman problem. Opns. Res., 21:498-516, 1973.
[77] A. Lukka and L. Salminen. Comparison of three heuristics for an arc routing problem. Technical Report 6/1987, Department of Information Technology, Lappeenranta University of Technology, Finland, 1987. [78] J. W. Male and J. C. Liebman. Districting and routing for solid waste
collection. J. Environ. Eng. Div., 104, 1978.
[79] J. W. Male, J. C. Liebman, and C. S. Orloff. An improvment to orloff's general routing problem. Networks, 7:89-92, 1977.
174 BIBLIOGRAFIA
[80] E. Minazzato. La Raccolta Dei Solidi Urbani Nella Città Di Como:
Modelli e Algoritmi Di Ricerca Operativa. PhD thesis, Università degli
Studi di Padova, Italy, 1988.
[81] E. Minieka. The Chinese postman problem for mixed networks. Ma-
nagement Sci, 25(7):643-648, 1979/80.
[82] M. Negreiros. O problema de planejamento e percurso de veículos na coleta do lixo urbano domiciliar. Master's thesis, Federal University of Rio de Janeiro, Brazil, 1974.
[83] C. E. Noon and J. C. Bean. An efficient transformation of the gene- ralized travelling salesman problem. INFOR, 31:39-44, 1993.
[84] Y. Norbert and J. C. Picard. An optimal algorithm for the mixed Chinese postman problem. Technical Report 799, Centre de recherche sur les transports, Montreal, Canada, 1991.
[85] J. F. Oliveira. Problemas de Posicionamento de Figuras Irregulares:
Uma Perspectiva de Optimização. PhD thesis, Faculdade de Engenha-
ria da Universidade do Porto, 1995.
[86] C. S. Orloff. A fundamental problem in vehicle routing. Networks, 4:35-64, 1974.
[87] M. Padberg and G. Rinaldi. Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Operations Research
Letters, 6:1-7, 1987.
[88] M. Padberg and G. Rinaldi. A branch-and-cut algorithm for the re- solution of large-scale symmetric travelling salesman problems. SIAM
Review, 33(1):60-100, March 1991.
[89] M. W. Padberg and M. Grõtschel. Polyhedral Computations., pages 307-360. John Wiley, Chichester, U. K., 1985.
[90] C. H. Papadimitriou. On the complexity of edge traversing. Journal
[91] W. L. Pearn. New lower bounds for the capacitated arc routing pro- blem. Networks, 18(3):181-191, 1988.
[92] W. L. Pearn. Approximate solutions for the capacitated arc routing problem. Comput. Oper. Res., 16(6):589-600, 1989.
[93] W. L. Pearn. Augment-insert algorithms for the capacitated arc rou- ting problem. Comput. and Opns. Res., 18:189-198, 1991.
[94] W. L. Pearn and M. L. Li. Algorithms for the windy postman problem.
Computers Ops. Res., 21:641-651, 1994.
[95] W. L. Pearn and T. C. Wu. Algorithms for the rural postman problem.
Computers and Operations Research, 22(8):819—828, 1995.
[96] D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis. An analysis of seve- ral heuristicas for the travelling salesman problem. SIAM J. Comput., 6:563-581, 1977.
[97] S. Roy and J. M. Rousseau. The capacitated Canadian postman pro- blem. INFOR, 27:58-73, 1989.
[98] J. M. Sanchis. El Poliedro Del Problema Del Cartero Rural. PhD thesis, Universidad de Valencia, Spain, 1990.
[99] H. Stern and M. Dror. Routing electric meter readers. Comput. and
Opns. Res., 6:209-223, 1979.
[100] R. Strieker. Public sector vehicle routing: The Chinese postman pro- blem. Master's thesis, Department of Electrical Engineering, Massa- chusetts Institute of Technology, Cambridge, Mass., 1970.
[101] A. J. Swersey and W. Ballard. Scheduling school buses. Mgmt. Sci., 30:844-853, 1984.
[102] W. B. Tucker and G. M. Clohan. Computer simulation of urban snow removal. Trans. Research Board Special Research Report, (185):293- 302, 1979.
176 BIBLIOGRAFIA
[103] W. Turner and E. Hougland. The optimal routing of solid waste col- lection. AIIE Trans., 7:427-431, 1975.
[104] G. Ulusoy. The fleet size and mix problem for capacitated arc routing.
European J. Oper. Res., 22(3):329-337, 1985.
[105] G.E. Wangdahl, S.M. Pollock, and J.B. Woodware. Minimum- trajectory pipe routing. J. Ship. Res., 18:46-49, 1974.
[106] Z. Win. Contributions to Routing Problems. PhD thesis, Universitat Augsburg, Germany, 1987.
[107] Z. Win. On the windy postman problem on eulerian graphs. Math.
Prog., 44:97-112, 1989.
[108] J. Wunderlich, L. Collette, L. Levy, and L. D. Bodin. Scheduling meter readers for southern California gas company. Interfaces, 22(3):22-30, 1992.
[109] R. Wyskida and J. Gupta. IE's improve city's solid waste collection.