New Kick Operators in Iterated Local Search Based Metaheuristic for Solving the Node Placement Problem in Multihop Networks

We consider a problem of finding an optimal node placement that minimizes the amount of traffic by reducing the weighted hop distances in multihop networks. The problem is called Node Placement Problem (NPP) and is one of the most important issues in multihop networks. NPP is known to be NP-hard. Therefore, several heuristic and metaheuristic algorithms have been proposed for optimizing NPP. Recently we proposed Iterated k-swap Local Search (IKLS) algorithm, which showed better performance than previous metaheuristic algorithms proposed by other researchers. IKLS simply consists of k-swap local search and a kick (mutation or perturbation) operator called Cross-Kick, a method that aims to escape from local optima. In this paper we focus on the kick operators in order to improve the performance of IKLS for NPP. New kick operators are presented and their effectivities are shown through computational experiments on the benchmark instances of NPP. The results show that IV-Kick with Rhombus is more effective than Cross-Kick and other kick operators, particularly for large-scaled instances.

[1]  Kengo Katayama,et al.  An effective local search for the maximum clique problem , 2005, Inf. Process. Lett..

[2]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[3]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[4]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[5]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

[6]  B. Mukherjee,et al.  WDM-based local lightwave networks. I. Single-hop systems , 1992, IEEE Network.

[7]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Bernd Freisleben,et al.  Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.

[11]  Teruo Higashino,et al.  A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[12]  Subrata Banerjee,et al.  Regular multihop logical topologies for lightwave networks , 1999, IEEE Communications Surveys & Tutorials.

[13]  Kengo Katayama,et al.  Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks , 2007, 2007 IEEE Congress on Evolutionary Computation.

[14]  Yuji Oie,et al.  Reconfiguration algorithms based on meta-heuristics for multihop WDM lightwave networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[15]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[16]  P. Merz,et al.  Memetic algorithms for the unconstrained binary quadratic programming problem. , 2004, Bio Systems.