Abstract
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 known to be NP-hard. Therefore, several heuristic and metaheuristic algorithms have been proposed for solving NPP, such as local search, genetic algorithm, simulated annealing, tabu search, iterated local search, ant colony optimization, etc. Although Variable Neighborhood Search (VNS) is known to be one of the most promising and efficient metaheuristic algorithms for optimization problems, VNS has not been shown for NPP yet. In this paper we propose VNS algorithms for NPP. The proposed VNSs consist of two phases: local search phase to obtain a local optimum and perturbation phase to get out of the corresponding valley in the search space. We show six types of neighborhood change schemes for the perturbation phase of VNS, and through computational experiments, we compare each performance of six VNSs incorporating k-swap local search, called VNS1, VNS2,…, VNS6. The experimental results indicate that VNS4 outperformed the others for large problem instances particularly, which adopts a suitable perturbation size selected by exploring from the upper bound that is adaptively lower in the search.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman, New York (1979)
Gendreau, M., Potvin, J.Y.: Handbook of Metaheuristics. International Series in Operations Research & Management Science. Springer (2010)
Hansen, P., Mladenovi´c, N., Moreno-P´erez, J.A.: Variable neighbourhood search: Methods and applications. Annals of Operations Research 175(1), 367–407 (2010)
Katayama, K., Akagi, Y., Kulla, E., Minamihara, H., Nishihara, N.: New kick operators in iterated local search based metaheuristic for solving the node placement problem in multihop networks. In: Proceedings of the 17th International Conference on Network-Based Information Systems (NBiS-2014), pp. 141–148 (2014)
Katayama, K., Yamashita, H., Narihisa, H.: Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 3508–3515 (2007)
Kato, M., Oie, Y.: Reconfiguration algorithms based on meta-heuristics for multihop WDM lightwave networks. In: Proc. IEEE International Conference on Communications, pp. 1638–1644 (2000)
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49, 291–307 (1970)
Kitani, T., Yonedu, M., Funabiki, N., Nakanishi, T., Okayama, K., Higashino, T.: A two-stage hierarchical algorithm for wavelength assignment in WDM-based bidirectional manhattan street networks. In: Proc. the 11th IEEE International Conf. on Networks, pp. 419–424 (2003)
Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)
Melo, L.A., Pereira, F.B., Costa, E.: MC-ANT: A multi-colony ant algorithm. In: Proc. 9th International Conference on Artificial Evolution, EA 2009, (LNCS 5975), pp. 25–36 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Katayama, K., Okamoto, Y., Kulla, E., Nishihara, N. (2017). Variable Neighborhood Search Algorithms for the Node Placement Problem in Multihop Networks. In: Barolli, L., Xhafa, F., Yim, K. (eds) Advances on Broad-Band Wireless Computing, Communication and Applications. BWCCA 2016. Lecture Notes on Data Engineering and Communications Technologies, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-49106-6_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-49106-6_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49105-9
Online ISBN: 978-3-319-49106-6
eBook Packages: EngineeringEngineering (R0)