LS(Graph): A constraint-based local search for constraint optimization on trees and paths

Constraints

Volumn 17, Issue 4, 2012, Pages 357-408

  Pham, Quang Dung ^a   Deville, Yves ^b   Van Hentenryck, Pascal ^c  

^a HANOI UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Viet Nam)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Combinatorial optimization; Constrained optimum paths; Constrained optimum trees; Constraint based local search; Edge disjoint paths; Graphs; Quorumcast routing; Routing and wavelength assignment with delay constraints

Indexed keywords

CONSTRAINED OPTIMUM PATHS; CONSTRAINED OPTIMUM TREES; DELAY CONSTRAINTS; EDGE-DISJOINT PATHS; GRAPHS; LOCAL SEARCH; QUORUMCAST;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; NETWORK ARCHITECTURE; TELECOMMUNICATION NETWORKS;

TREES (MATHEMATICS);

EID: 84868355622     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-012-9124-0     Document Type: Article

References (67)

1. Acar, U., Blelloch, G., Harper, R., Vittes, J., & Woo, S. (2004). An experimental analysis of change propagation in dynamic trees. In Proc 15th SODA (pp. 524-533).
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
3. Ahuja, R. K., Orlinb, J. B., & Sharma, D. (2003). A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters, 31, 185-194.
4. Ali, M., Ramamurthy, B., & Deogun, J. (1999). Genetic algorithm for routing in wdm optical networks with power considerations. Part I: The unicast case. In Proceedings of the 8th IEEE ICCCN'99 (pp. 335-340). Boston-Natick, MA, USA.
5. Ali, M., Ramamurthy, B., & Deogun, J. (2000). Routing and wavelength assignment with power considerations in optical networks. Computer Networks, 32, 539-555.
6. Alstrup, S., Holm, J., Lichtenberg, K. D., & Thorup, M. (2005). Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms, 1(2), 243-264. doi:10.1145/1103963.1103966.
7. Andrade, R., Lucena, A., & Maculan, N. (2006). Using lagrangian dual information to generate degree constrained spanning trees. Discrete Applied Mathematics, 154(5), 703-717.
8. Awerbuch, B., Gawlick, R., Leighton, T., & Rabani, Y. (1994). On-line admission control and circuit routing for high performance computing and communication. In 35th IEEE symposium on foundations of computer science (FOCS1994) (pp. 412-423).
9. Badeau, P., Gendreau,M., Guertin, F., Potvin, J. Y., & Taillard, E. (1997). A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research - C, 5, 109-122.
10. Banerjee, D., Mehta, V., & Pandey, S. (2004). A genetic algorithm approach for solving the routing and wavelength assignment problem in wdm networks. In 3rd IEEE/IEE international conference on networking, ICN'2004 (pp. 70-78). Paris.
11. Banerjee, D., & Mukherjee, B. (2000).Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Transactions on Networking, 8, 598-607. (Pubitemid 32017924)
12. Banerjee, S., Yoo, J.,&Chen, C. (1997). Design of wavelength routed optical networks for packet switched traffic. IEEE Journal of Lightware Technology, 15(9), 1636-1646. (Pubitemid 127603845)
13. Baveja, A., & Srinivasan, A. (2000). Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, 25(2), 255-280.
14. Beasley, J. E. (2012). Or-library. http://people.brunel.ac.uk/~mastjjb/ jeb/info.html. Accessed 15 Nov 2009.
15. Beasley, J. E., & Christofides, N. (1989). An algorithm for the resource constrained shortest path problem. Network, 19, 379-394.
16. Bender, M. A., Farach-Colton, M., Pemmasani, G., Skiena, S., & Sumazin, P. (2005). Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms, 57, 75-94. (Pubitemid 41501355)
17. Berkman, O., & Vishkin, U. (1993). Recursive star-tree parallel data structure. SIAM Journal On Computing, 22(2), 221-242. (Pubitemid 23639058)
18. Blesa, M., & Blum, C. (2007). Finding edge-disjoint paths in networks: An ant colony optimization algorithm. Journal of Mathematical Modelling and Algorithms, 6(3), 361-391.
19. Blum, C. (2006).Anew hybrid evolutionary algorithm for the huge k-cardinality tree problem. In Proceedings of the 8th annual conference on genetic and evolutionary computation (pp. 515-522). (Pubitemid 44611365)
20. Blum, C., & Blesa,M. (2005). New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers and Operations Research, 32(6), 1355-1377.
21. Bui, T., & Sundarraj, G. (2004). Ant system for the k-cardinality tree problem. In K. Deb, et al. (Ed.), Proceedings of the genetic and evolutionary computation conference (GECCO 2004) (Vol. 3102, pp. 36-47). (Pubitemid 39747196)
22. Chekuri, C., & Khanna, S. (2003). Edge disjoint paths revisited. In Proceedings of the 14th ACMSIAM symposium on discrete algorithms (SODA2003) (pp. 628-637).
23. Chen, C., & Banerjee, S. (1996). A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. In INFOCOM 1996 (pp. 164-171).
24. Cheung, S. Y., & Kumar, A. (1994). Efficient quorumcast routing algorithms. In Proceedings of INFOCOM'94 (pp. 840-847).
25. Chimani, M., Kandyba, M., Ljubic, I., & Mutzel, P. (2009). Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics, 14(2), 5.1-5.23.
26. Chlamtac, I., Ganz, A., & Karmi, G. (1992). Lightpath communications: An approach to high bandwidth optical WANS. IEEE Transactions on Communications, 40(7), 1171-1182.
27. Clímaco, J. C. N., Craveirinha, J. M. F., & Pascoal, M. M. B. (2003). A bicriterion approach for routing problems in multimedia networks. Networks, 41, 206-220.
28. de Aragão, M., Uchoa, E., & Werneck, R. (2001). Dual heuristics on the exact solution of large Steiner problems. In Proceedings of the Brazilian symposium on graphs, algorithms and combinatorics GRACO'01. Fortaleza.
29. Du, B., Gu, J., Tsang, D., & Wang, W. (1996). Quorumcast routing by multispace search. In Proceedings of IEEE Globecom1996 (pp. 1069-1073).
30. Dumitrescu, I., & Boland, N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks, 42, 135-153.
31. Dutta, R., & Rouskas, G. N. (2000). A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks, 1(1), 73-89.
32. Fischer, T. (2007). Improved local search for large optimum communication spanning tree problems. In MIC'2007-7th metaheuristics international conference.
33. Frederickson, G. N. (1997). A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24(1), 37-65. (Pubitemid 127453993)
34. Funke, B., Grünert, T., & Irnich, S. (2005). Local search for vehicle routing and scheduling problems: Review and conceptual integration. Journal of Heuristics, 11(4), 267-306. (Pubitemid 41261193)
35. Gruber, M., van Hemert, J., & Raidl, G. (2006). Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In Proceedings of the genetic and evolutionary computation conference (pp. 1187-1194). (Pubitemid 44611451)
36. Henzinger, M. R., & King, V. (1999). Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, 46(4), 502-516.
37. Ho, V., Francois, P., Deville, Y., Pham, D., & Bonaventure, O. (2010). Using local search for traffic engineering in switched ethernet networks. In Proceedings of 22nd international teletraffic congress (ITC-22). Amsterdam, Netherlands.
38. Hyytia, E. (2004). Resource allocation and performance analysis problems in optical networks. Ph.d. thesis, Dpt. of Electrical and Communications Engineering, Helsinki University of Technology, Helsinki, Sweden.
39. Jaumard, B., Meyer, C., & Yu, X. (2006). How much wavelength conversion allows a reduction in the blocking rate? Journal of Optical Networking, 5(12), 881-900. (Pubitemid 46324936)
40. Jaumard, B., Meyer, C., & Thiongane, B. (2007). Comparison of ILP formulations for the rwa problem. Optical Switching and Networking, 4, 157-172. (Pubitemid 350026477)
41. Kanellakis, P. C., & Papadimitriou, C. H. (1980). Local search for the asymmetric traveling salesman problem. Operations Research, 28(5), 1086-1099.
42. Kleinberg, J. (1996). Approximation algorithms for disjoint-paths problems. PhD thesis. Cambridge: MIT Press.
43. Kolliopoulos, S. G., & Stein, C. (2004). Approximating disjoint-path problems using packing integer programs. Mathematical Programming, 99(1), 63-87. (Pubitemid 40871732)
44. Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In 13th ACM symposium on parallel algorithms and architectures (SPAA'01) (pp. 38-47). (Pubitemid 32865390)
45. Krishnamoorthy, M., Ernst, A. T., & Sharaiha, Y. M. (2001). Comparison of algorithms for the degree constrained minimum spanning tree. Journal of Heuristics, 7(6), 587-611. (Pubitemid 33068055)
46. Krishnaswamy, R. M., & Sivarajan, K. N. (2001). Algorithms for routing and wavelength assignment based on solutions of LP-relaxations. IEEE Communications Letters, 5(10), 435-437. (Pubitemid 33600922)
47. Lee, K., Kang, K., Lee, T., & Park, S. (2002). An optimization approach to routing and wavelength assignment in wdm all-optical mesh networks without wavelength conversion. ETRI Journal, 24(2), 131-141. (Pubitemid 34428477)
48. Low, C. P. (1998). A fast search algorithm for the quorumcast routing problem. Information Processing Letters, 66, 87-92. (Pubitemid 128393192)
49. Mukherjee, B. (2006). Optical WDM networks. Springer.
50. Nardelli, E., & Proietti, G. (2001). Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. Journal of Graph Algorithms and Applications, 5(5), 39-57. (Pubitemid 39064663)
51. Noronha, T., & Ribeiro, C. (2006). Routing and wavelength assignment by partition coloring. European Journal of Operational Research, 171(3), 797-810. (Pubitemid 43132947)
52. Ozdaglar, A., & Bersekas, D. (2003). Routing and wavelength assignment in optical networks. IEEE/ACM Transactions on Networking, 11(2), 259-272.
53. Pham, Q. D. (2011) LS(Graph): A constrained-based local search framework for constrained optimum tree and path problems on graphs. PhD thesis, Université catholique de Louvain.
54. Pham, Q. D., Deville, Y., & Hentenryck, P. V. (2010). Constraint-based local search for constrained optimum paths problems. In Proceedings of the seventh international conference on integration of artificial intelligence and operations research techniques in constraint programming, CPAIOR'2010 (pp. 267-281).
55. Ramaswami, R., & Sivarajan, K. (1995). Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans Network, 3(5), 489-500.
56. Reimann, M., & Laumanns, M. (2004) A hybrid aco algorithm for the capacitated minimum spanning tree problem. In Proceedings of first international workshop on hybrid metaheuristics (pp. 1-10).
57. Sleator, D. D., & Tarjan, R. E. (1983). A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3), 362-391.
58. Sleator, D. D., & Tarjan, R. E. (1985). Self-adjusting binary search trees. Journal of the Association for Computing Machinery, 32(3), 652-686.
59. Tarjan, R. E., &Werneck, R. F. (2005). Self-adjusting top trees. In Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 813-822). (Pubitemid 40851444)
60. Tarjan, R. E., & Werneck, R. F. (2009). Dynamic trees in practice. Journal of Experimental Algorithmics (JEA), 14, 4.5:1-4.5:21.
61. Tornatore, M., Maier. G., & Pattavina, A. (2002). Wdm network optimization by ilp based on source formulation. In Proceedings of IEEE INFOCOM (pp. 1813-1821).
62. Van Hentenryck, P., & Michel, L. (2005). Constraint-based local search. London: MIT Press.
63. Wang, B., & Hou, J. C. (2004). An efficient qos routing algorithm for quorumcast communication. Computer Networks Journal, 44(1), 43-61.
64. Ye, Y., Chai, T., Cheng, T.,&Lu, C. (2003).Algorithms for the design of wdm translucent optical networks. Optics Express, 11(22), 2917-2926.
65. Yetginer, E., Liu, Z., & Rouskas, G. N. (2010). RWA in WDM rings: An efficient formulation based on maximal independent set decomposition. In The 17th IEEE workshop on local and metropolitan area networks (IEEE LANMAN 2010).
66. Zachariasen, M. (1999). Local search for the steiner tree problem in the Euclidean plane. European Journal of Operational Research, 119, 282-300. doi:10.1016/S0377-2217(99)00131-9. (Pubitemid 30518385)
67. Zang, H., Jue, J. P., & Mukherjee, B. (2000). A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks. Optical Networks Magazine, 1(1), 47-60.