TY - GEN A1 - Giovanidis, Anastasios A1 - Brueck, Stefan A1 - D'Andreagiovanni, Fabio A1 - Krolikowski, Jonatan A1 - Hartanto Tanzil, Vicky T1 - A 0-1 Program for Minimum Clustering in Downlink Base Station Cooperation N2 - Base station cooperation in the downlink of cellular systems has been recently suggested as a promising concept towards a better exploitation of the communication system physical resources. It may offer a high gain in capacity through interference mitigation. This however, comes at a cost of high information exchange between cooperating entities and a high computational burden. Clustering of base stations into subgroups is an alternative to guarantee such cooperation benefits in a lower scale. The optimal definition of clusters, however, and a systematic way to find a solution to such problem is not yet available. In this work, we highlight the combinatorial nature of the problem, exploit this to describe the system of users and base stations as a graph and formulate a pure 0-1 program. Its solution suggests a cost optimal way to form clusters and assign user subsets to them. T3 - ZIB-Report - 11-19 KW - Wireless Communications KW - Base Station Cooperation KW - 0-1 Program Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-12776 ER - TY - CHAP A1 - D'Andreagiovanni, Fabio A1 - Krolikowski, Jonatan A1 - Pulaj, Jonad T1 - A hybrid primal heuristic for Robust Multiperiod Network Design T2 - EvoApplications 2014 Y1 - 2014 ER - TY - GEN A1 - D'Andreagiovanni, Fabio A1 - Krolikowski, Jonatan A1 - Pulaj, Jonad T1 - A hybrid primal heuristic for Robust Multiperiod Network Design N2 - We investigate the Robust Multiperiod Network Design Problem, a generalization of the classical Capacitated Network Design Problem that additionally considers multiple design periods and provides solutions protected against traffic uncertainty. Given the intrinsic difficulty of the problem, which proves challenging even for state-of-the art commercial solvers, we propose a hybrid primal heuristic based on the combination of ant colony optimization and an exact large neighborhood search. Computational experiments on a set of realistic instances from the SNDlib show that our heuristic can find solutions of extremely good quality with low optimality gap. T3 - ZIB-Report - 13-78 KW - Multiperiod Network Design, Traffic Uncertainty, Robust Optimization, Multiband Robustness, Hybrid Heuristics Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-44081 SN - 1438-0064 ER - TY - GEN A1 - D'Andreagiovanni, Fabio A1 - Krolikowski, Jonatan A1 - Pulaj, Jonad T1 - A Fast Hybrid Primal Heuristic for Multiband Robust Capacitated Network Design with Multiple Time Periods N2 - We investigate the Robust Multiperiod Network Design Problem, a generalization of the Capacitated Network Design Problem (CNDP) that, besides establishing flow routing and network capacity installation as in a canonical CNDP, also considers a planning horizon made up of multiple time periods and protection against fluctuations in traffic volumes. As a remedy against traffic volume uncertainty, we propose a Robust Optimization model based on Multiband Robustness (Büsing and D'Andreagiovanni, 2012), a refinement of classical Gamma-Robustness by Bertsimas and Sim (2004) that uses a system of multiple deviation bands. Since the resulting optimization problem may prove very challenging even for instances of moderate size solved by a state-of-the-art optimization solver, we propose a hybrid primal heuristic that combines a randomized fixing strategy inspired by ant colony optimization and an exact large neighbourhood search. Computational experiments on a set of realistic instances from the SNDlib (2010) show that our original heuristic can run fast and produce solutions of extremely high quality associated with low optimality gaps. T3 - ZIB-Report - 14-40 KW - Capacitated Network Design KW - Multiperiod Design KW - Multiband Robust Optimization KW - Traffic Uncertainty KW - Metaheuristic KW - Ant Colony Optimization KW - Exact Large Neighborhood Search Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-52862 SN - 1438-0064 ER - TY - JOUR A1 - D'Andreagiovanni, Fabio A1 - Krolikowski, Jonatan A1 - Pulaj, Jonad T1 - A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods JF - Applied Soft Computing N2 - We investigate the Robust Multiperiod Network Design Problem, a generalization of the Capacitated Network Design Problem (CNDP) that, besides establishing flow routing and network capacity installation as in a canonical CNDP, also considers a planning horizon made up of multiple time periods and protection against fluctuations in traffic volumes. As a remedy against traffic volume uncertainty, we propose a Robust Optimization model based on Multiband Robustness (Büsing and D'Andreagiovanni, 2012), a refinement of classical Gamma-Robustness by Bertsimas and Sim (2004) that uses a system of multiple deviation bands. Since the resulting optimization problem may prove very challenging even for instances of moderate size solved by a state-of-the-art optimization solver, we propose a hybrid primal heuristic that combines a randomized fixing strategy inspired by ant colony optimization and an exact large neighbourhood search. Computational experiments on a set of realistic instances from the SNDlib (2010) show that our original heuristic can run fast and produce solutions of extremely high quality associated with low optimality gaps. Y1 - 2014 U6 - https://doi.org/10.1016/j.asoc.2014.10.016 VL - 26 SP - 497 EP - 507 ER -