A comparative study on search strategies for cell assignments

DOI10.1080/00207160410001715276MaRDI QIDQ3155017zbMATH OpenOpenAlexFDO

Authors Ming Gu, Fei He, William N. N. Hung, Xiaoyu Song

Publication date 14 January 2005

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160410001715276

zbMATH Keywords

OptimizationHeuristicsBranch-and-boundScatter SearchMobile Communication

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks.
• Solving base station subsystem assignment problem in mobile communication networks using hybridized heuristic algorithm
• Fixed channel assignment in cellular communication systems considering the whole set of packed patterns. An investigation based on metaheuristics
• Cell formation in group technology: A combinatorial search approach
• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem

Cited in

(1)

• Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems

This page was built for publication: A comparative study on search strategies for cell assignments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3155017)