메뉴 건너뛰기




Volumn 134, Issue , 2014, Pages 3-17

A hybrid exact-aco algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks

Author keywords

Ant colony optimization; Binary linear programming; Cooperative wireless networks; Exact local search; Hybridization

Indexed keywords

ALGORITHMS; ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; BASE STATIONS; LINEAR PROGRAMMING; OPTIMIZATION; WIRELESS NETWORKS;

EID: 84943225004     PISSN: 18678211     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-319-06944-9_1     Document Type: Conference Paper
Times cited : (11)

References (35)
  • 1
    • 37249041991 scopus 로고    scopus 로고
    • Optimization problems and models for planning cellular networks
    • In: Resende, M., Pardalos, P. (eds.), Springer, Heidelberg
    • Amaldi, E., Capone, A., Malucelli, F., Mannino, C.: Optimization problems and models for planning cellular networks. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunication, pp. 917–939. Springer, Heidelberg (2006)
    • (2006) Handbook of Optimization in Telecommunication , pp. 917-939
    • Amaldi, E.1    Capone, A.2    Malucelli, F.3    Mannino, C.4
  • 5
    • 79956127340 scopus 로고    scopus 로고
    • Hybrid metaheuristics in combinatorial optimization: A survey. Appl
    • Blum, C., Puchinger, J., Raidl, G. R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft Comp.11(6), 4135–4151 (2011)
    • (2011) Soft Comp , vol.11 , Issue.6 , pp. 4135-4151
    • Blum, C.1    Puchinger, J.2    Raidl, G.R.3    Roli, A.4
  • 6
    • 84864351097 scopus 로고    scopus 로고
    • New results about multi-band uncertainty in robust optimization
    • In: Klasing, R. (ed.), Springer, Heidelberg
    • Büsing, C., D’Andreagiovanni, F.: New results about multi-band uncertainty in robust optimization. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 63–74. Springer, Heidelberg (2012)
    • (2012) SEA 2012. LNCS , vol.7276 , pp. 63-74
    • Büsing, C.1    D’Andreagiovanni, F.2
  • 7
    • 84915764166 scopus 로고    scopus 로고
    • A new theoretical framework for Robust Optimization under multi-band uncertainty
    • In: Helber, S. et al. (eds.), Springer, Heidelberg
    • Büsing, C., D’Andreagiovanni, F.: A new theoretical framework for Robust Optimization under multi-band uncertainty. In: Helber, S. et al. (eds.) Operations Research Proceedings 2012, pp.115–121. Springer, Heidelberg (2014)
    • (2014) Operations Research Proceedings 2012 , pp. 115-121
    • Büsing, C.1    D’Andreagiovanni, F.2
  • 8
    • 79957645802 scopus 로고    scopus 로고
    • A new computational approach for maximum link activation in wireless networks under the SINR model
    • Capone, A., Chen, L., Gualandi, S., Yuan, D.: A new computational approach for maximum link activation in wireless networks under the SINR model. IEEE Trans. Wireless Comm.10(5), 1368–1372 (2011)
    • (2011) IEEE Trans. Wireless Comm , vol.10 , Issue.5 , pp. 1368-1372
    • Capone, A.1    Chen, L.2    Gualandi, S.3    Yuan, D.4
  • 9
    • 45749101709 scopus 로고    scopus 로고
    • The Displacement of Base Station in Mobile Communication with Genetic Approach
    • Choi, Y. S., Kim, K. S., Kim, N.: The Displacement of Base Station in Mobile Communication with Genetic Approach. EURASIP J. Wireless Comm. Net. (2008). doi:10.1155/2008/580761
    • (2008) EURASIP J. Wireless Comm. Net
    • Choi, Y.S.1    Kim, K.S.2    Kim, N.3
  • 10
    • 84866158651 scopus 로고    scopus 로고
    • A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
    • Classen, G., Koster, A. M. C. A., Schmeink, A.: A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. Comput. OR 40(1), 80–90 (2013)
    • (2013) Comput. OR , vol.40 , Issue.1 , pp. 80-90
    • Classen, G.1    Koster, A.2    Schmeink, A.3
  • 11
    • 12344255882 scopus 로고    scopus 로고
    • Exploring relaxation induced neighborhoods to improve MIP solutions
    • Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program.102, 71–90 (2005)
    • (2005) Math. Program , vol.102 , pp. 71-90
    • Danna, E.1    Rothberg, E.2    Le Pape, C.3
  • 12
    • 84874184980 scopus 로고    scopus 로고
    • GUB covers and power-indexed formulations for wireless network design
    • D’Andreagiovanni, F., Mannino, C., Sassano, A.: GUB covers and power-indexed formulations for wireless network design. Manage. Sci. 59(1), 142–156 (2013)
    • (2013) Manage. Sci , vol.59 , Issue.1 , pp. 142-156
    • D’Andreagiovanni, F.1    Mannino, C.2    Sassano, A.3
  • 13
    • 84924479525 scopus 로고    scopus 로고
    • Pure 0–1 programming approaches to wireless network design
    • Ph. D. Thesis
    • D’Andreagiovanni, F.: Pure 0–1 programming approaches to wireless network design. Ph. D. Thesis. 4OR-Q. J. Oper. Res.10(2), 211–212 (2012)
    • (2012) 4OR-Q. J. Oper. Res , vol.10 , Issue.2 , pp. 211-212
    • D’Andreagiovanni, F.1
  • 14
    • 79955855569 scopus 로고    scopus 로고
    • On improving the capacity of solving large-scale wireless network design problems by genetic algorithms
    • In: Chio, C., et al. (eds.), Springer, Heidelberg
    • D’Andreagiovanni, F.: On improving the capacity of solving large-scale wireless network design problems by genetic algorithms. In: Chio, C., et al. (eds.) EvoApplications 2011, Part II. LNCS, vol. 6625, pp.11–20. Springer, Heidelberg (2011)
    • (2011) Evoapplications 2011, Part II. LNCS , vol.6625 , pp. 11-20
    • D’Andreagiovanni, F.1
  • 15
    • 80053041601 scopus 로고    scopus 로고
    • Negative cycle separation in wireless network design
    • In: Pahl, J., Reiners, T., Voß, S. (eds.), Springer, Heidelberg
    • D’Andreagiovanni, F., Mannino, C., Sassano, A.: Negative cycle separation in wireless network design. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 51–56. Springer, Heidelberg (2011)
    • (2011) INOC 2011. LNCS , vol.6701 , pp. 51-56
    • D’Andreagiovanni, F.1    Mannino, C.2    Sassano, A.3
  • 18
    • 27644543634 scopus 로고    scopus 로고
    • Ant colony optimization theory: A survey
    • Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoret. Comp. Sci. 344(2–3), 243–278 (2005)
    • (2005) Theoret. Comp. Sci , vol.344 , Issue.23 , pp. 243-278
    • Dorigo, M.1    Blum, C.2
  • 19
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • Dorigo, M., Di Caro, G., Gambardella, L. M.: Ant algorithms for discrete optimization. Artif. Life 5(2), 137–172 (1999)
    • (1999) Artif. Life , vol.5 , Issue.2 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2    Gambardella, L.M.3
  • 20
    • 0030082551 scopus 로고    scopus 로고
    • Ant system: Optimization by a colony of cooperating agents
    • Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26(1), 29–41 (1996)
    • (1996) IEEE Trans. Syst. Man Cybern. B , vol.26 , Issue.1 , pp. 29-41
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 25
    • 84943284153 scopus 로고    scopus 로고
    • Ibm, ILOG Cplex
    • Ibm, ILOG Cplex. http://www-01. ibm. com/software/integration/optimization/cplex-optimizer
  • 28
    • 0000127689 scopus 로고    scopus 로고
    • Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
    • Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. Comp.11(4), 358–369 (1999)
    • (1999) INFORMS J. Comp , vol.11 , Issue.4 , pp. 358-369
    • Maniezzo, V.1
  • 29
    • 33749470610 scopus 로고    scopus 로고
    • The network packing problem in terrestrial broadcasting
    • Mannino, C., Rossi, F., Smriglio, S.: The network packing problem in terrestrial broadcasting. Oper. Res. 54(6), 611–626 (2006)
    • (2006) Oper. Res , vol.54 , Issue.6 , pp. 611-626
    • Mannino, C.1    Rossi, F.2    Smriglio, S.3
  • 30
    • 1642618971 scopus 로고    scopus 로고
    • An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
    • Montemanni, R., Smith, D. H., Allen, S. M.: An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. Europ. J. Oper. Res.156(3), 736–751 (2004)
    • (2004) Europ. J. Oper. Res , vol.156 , Issue.3 , pp. 736-751
    • Montemanni, R.1    Smith, D.H.2    Allen, S.M.3
  • 35
    • 0001615533 scopus 로고
    • Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints
    • Wolsey, L.: Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints. Discrete Appl. Math. 29(2–3), 251–261 (1990)
    • (1990) Discrete Appl. Math , vol.29 , Issue.23 , pp. 251-261
    • Wolsey, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.