Local Search Methods for the Winner Determination Problem in Multi-Unit Combinatorial Auctions

2014 ◽  
pp. 589-599
Author(s):  
Abdellah Rezoug ◽  
Dalila Boughaci
Keyword(s):  
Local Search ◽  
Combinatorial Auctions ◽  
Winner Determination Problem ◽  
Search Methods ◽  
Winner Determination ◽  
Local Search Methods

scholarly journals Planning capacity for 5G and beyond wireless networks by discrete fireworks algorithm with ensemble of local search methods

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Hafiz Munsub Ali ◽  
Jiangchuan Liu ◽  
Waleed Ejaz
Keyword(s):  
Wireless Networks ◽  
Local Search ◽  
Wireless Network ◽  
Statistical Tests ◽  
Mathematical Framework ◽  
Integer Programming Problem ◽  
Search Methods ◽  
Fireworks Algorithm ◽  
Local Search Methods ◽  
Planning Capacity

Abstract In densely populated urban centers, planning optimized capacity for the fifth-generation (5G) and beyond wireless networks is a challenging task. In this paper, we propose a mathematical framework for the planning capacity of a 5G and beyond wireless networks. We considered a single-hop wireless network consists of base stations (BSs), relay stations (RSs), and user equipment (UEs). Wireless network planning (WNP) should decide the placement of BSs and RSs to the candidate sites and decide the possible connections among them and their further connections to UEs. The objective of the planning is to minimize the hardware and operational cost while planning capacity of a 5G and beyond wireless networks. The formulated WNP is an integer programming problem. Finding an optimal solution by using exhaustive search is not practical due to the demand for high computing resources. As a practical approach, a new population-based meta-heuristic algorithm is proposed to find a high-quality solution. The proposed discrete fireworks algorithm (DFWA) uses an ensemble of local search methods: insert, swap, and interchange. The performance of the proposed DFWA is compared against the low-complexity biogeography-based optimization (LC-BBO), the discrete artificial bee colony (DABC), and the genetic algorithm (GA). Simulation results and statistical tests demonstrate that the proposed algorithm can comparatively find good-quality solutions with moderate computing resources.

Sign in / Sign up

Export Citation Format

Share Document