VL-PLS: A Multi-objective Variable Length Pareto Local Search To Solve The Node Placement Problem For Next Generation Network

dc.contributor.authorAbdelkhalek, Ons
dc.contributor.authorDahmani, Nadia
dc.contributor.authorKrichen, Saoussen
dc.contributor.authorGuitouni, Adel
dc.date.accessioned2018-06-27T19:48:20Z
dc.date.available2018-06-27T19:48:20Z
dc.date.copyright2015en_US
dc.date.issued2015
dc.description.abstractIn the node placement problem for next generation network, an existing networks coverage is extended by placing new nodes and connecting them via ad hoc technologies so as the global network communication coverage is optimized. Four relevant objective functions are considered: The maximization of the communication coverage, the minimization of the nodes placement and the communication devices costs, the maximization of the total minimum capacity bandwidth to connect the infrastructure, and the minimization of the total overlapping. To tackle this problem, a new multi-objective variable length Pareto local search (VL-PLS) algorithm is proposed. The main incentive of the VL-PLS algorithm is that, in the proposed solution encoding, both substring and solution lengths dynamically vary leading to emphasize the optimization process and look for the optimal number of placed node. Three different neighborhood structures are presented in order to ensure a good exploration of the search space. A comparative study with an existing algorithm from the literature is dressed using different multi-objective performance metrics to support the performance of our algorithm.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelFacultyen_US
dc.identifier.citationAbdelkhalek, O., Dahmani, N., Krichen, S. & Guitouni, A. (2015). VL-PLS: A Multiobjective Variable Length Pareto Local Search To Solve The Node Placement Problem For Next Generation Network. Procedia: Computer Science, 73, 250-257. https://doi.org/10.1016/j.procs.2015.12.025en_US
dc.identifier.urihttps://doi.org/10.1016/j.procs.2015.12.025
dc.identifier.urihttp://hdl.handle.net/1828/9527
dc.language.isoenen_US
dc.publisherProcedia: Computer Scienceen_US
dc.subjectPareto Local Searchen_US
dc.subjectGenetic Algorithmen_US
dc.subjectNext Generation Networksen_US
dc.subjectNode Placement Problemen_US
dc.subjectHeterogeneous Network Planningen_US
dc.titleVL-PLS: A Multi-objective Variable Length Pareto Local Search To Solve The Node Placement Problem For Next Generation Networken_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Guitouni_Adel_ProcediaComputSci_2015.pdf
Size:
324.62 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: