Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 3508-3515

  Katayama, Kengo ^a,b   Yamashita, Hiroshi ^b   Narihisa, Hiroyuki ^b  

^a IEEE

^b OKAYAMA UNIVERSITY OF SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; LIGHTWAVE NETWORKS; NODE PLACEMENT PROBLEM;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ITERATIVE METHODS; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 77951298876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424927     Document Type: Conference Paper

References (32)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
2. M. Kato and Y. Oie, "Reconfiguration algorithms based on metaheuristics for multihop WDM lightwave networks," in Proc. IEEE International Conference on Communications, 2000, pp. 1638-1644.
3. T. Kitani, M. Yonedu, N. Funabiki, T. Nakanishi, K. Okayama, and T. Higashino, "A two-stage hierarchical algorithm for wavelength assignment in WDM-based bidirectional manhattan street networks," in Proc. the 11th IEEE International Conference on Networks, 2003, pp. 419-424.
4. B. Mukherjee, "WDM-based local lightwave networks - part I: Singlehop systems," IEEE Network, vol. 6, no. 3, pp. 12-27, May 1992.
5. - , "WDM-based local lightwave networks - part II: Multihop systems," IEEE Network, vol. 6, no. 4, pp. 20-32, July 1992.
6. S. Banerjee, V. Jain, and S. Shah, "Regular multihop logical topologies for lightwave networks," IEEE Commun. Surveys., vol. 2, no. 1, 1st quarter 1999.
7. K. L. Yeung and T.-S. P. Yum, "Node placement optimization in shufflenets," IEEE/ACM Trans. Networking, vol. 6, no. 3, pp. 319-324, June 1998.
8. H.-L. T. Wong and K. L. Yeung, "Lookahead algorithm for node placement optimization in shufflenets," IEICE Trans. Commun., vol. E83-B, no. 7, pp. 1527-1533, July 2000.
9. S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Operations Research, vol. 21, pp. 498-516, 1973
10. B. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell System Technical Journal, vol. 49, pp. 291-307, 1970.
11. W. Michiels, E. Aarts, and J. Korst, Theoretical Aspects of Local Search. Springer-Verlag, 2006.
12. F. Glover and G. A. Kochenberger, Handbook of Metaheuristics, ser. International Series in Operations Research & Management Science. Kluwer Academic Publishers, 2003.
13. H. H. Hoos and T. Stützle, Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, 2004.
14. H. Lourenço, O. Martin, and T. Stützle, "Iterated local search," in Handbook of Metaheuristics, ser. International Series in Operations Research & Management Science, F. Glover and G. Kochenberger, Eds. Kluwer Academic Publishers, 2003, vol. 57, pp. 321-353.
15. P. Moscato and C. Cotta, "A gentle introduction to memetic algorithms," in Handbook of Metaheuristics, ser. International Series in Operations Research & Management Science, F. Glover and G. A. Kochenberger, Eds. Kluwer Academic Publishers, 2003, vol. 57, pp. 105-144.
16. D. Applegate, W. Cook, and A. Rohe, "Chained Lin-Kernighan for large traveling salesman problems," INFORMS Journal on Computing, vol. 15, no. 1, pp. 82-92, 2003.
17. D. Johnson, "Local optimization and the traveling salesman problem," in Proc. 17th International Colloquium on Automata, Languages and Programming, 1990, pp. 446-461.
18. D. Johnson and L. McGeoch, "The traveling salesman problem: A case study," in Local Search in Combinatorial Optimization, E. Aarts and J. Lenstra, Eds. John Wiley & Sons, 1997, pp. 215-310.
19. K. Katayama and H. Narihisa, "Iterated local search approach using genetic transformation to the traveling salesman problem," in Proc. of the Genetic and Evolutionary Computation Conference, 1999, pp. 321-328.
20. P. Merz and B. Freisleben, "Memetic algorithms for the traveling salesman problem," Complex Systems, vol. 13, no. 4, pp. 297-345, 2001.
21. H.-K. Tsai, J.-M. Yang, Y.-F. Tsai, and C.-Y. Kao, "An evolutionary algorithm for large traveling salesman problems," IEEE Transactions on Systems, Man and Cybernetics, Part B, vol. 34, pp. 1718-1729, 2004.
22. P. Merz and B. Freisleben, "Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning," Evolutionary Computation, vol. 8, no. 1, pp. 61-91, 2000.
23. K. A. Murthy, Y. Li, and P. M. Pardalos, "A local search algorithm for the quadratic assignment problem," Informatica, vol. 3, no. 4, pp. 524-538, 1992.
24. M. Yagiura, T. Yamaguchi, and T. Ibaraki, A Variable Depth Search Algorithm for the Generalized Assignment Problem, ser. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.). Kluwer, 1999, pp. 459-471.
25. S. R. Tiourine, C. A. J. Hurkens, and J. K. Lenstra, "Local search algorithms for the radio link frequency assignment problem," Telecommunication Systems, vol. 13, no. 2-4, pp. 293-314, 2000.
26. P. Merz and B. Freisleben, "Greedy and local search heuristics forunconstrained binary quadratic programming," Journal of Heuristics, vol. 8, no. 2, pp. 197-213, 2002.
27. K. Katayama, M. Tani, and H. Narihisa, "Solving large binary quadratic programming problems by effective genetic local search algorithm," in Proc. of the Genetic and Evolutionary Computation Conference, 2000, pp. 643-650.
28. P. Merz and K. Katayama, "Memetic algorithms for the unconstrained binary quadratic programming problem," BioSystems, vol. 78, no. 1-3, pp. 99-118, 2004.
29. K. Katayama, A. Hamamoto, and H. Narihisa, "An effective local search for the maximum clique problem," Information Processing Letters, vol. 95, no. 5, pp. 503-511, 2005.
30. K. Katayama, M. Sadamatsu, and H. Narihisa, "Iterated k-opt local search for the maximum clique problem," in Evolutionary Computation in Combinatorial Optimization, LNCS 4446. Springer-Verlag, 2007, pp. 84-95.
31. J. L. Bentley, "Fast algorithms for geometric traveling salesman problems," ORSA Journal on Computing, vol. 4, pp. 387-411, 1992.
32. K. D. Boese, A. B. Kahng, and S. Muddu, "A new adaptive multistart technique for combinatorial global optimizations," Operations Research Letters, vol. 16, no. 2, pp. 101-113, 1994.