Skip to main content

2017 | OriginalPaper | Buchkapitel

Experiments on Neighborhood Combination Strategies for Bi-objective Unconstrained Binary Quadratic Programming Problem

verfasst von : Li-Yuan Xue, Rong-Qiang Zeng, Wei An, Qing-Xian Wang, Ming-Sheng Shang

Erschienen in: Parallel Architecture, Algorithm and Programming

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Local search is known to be a highly effective metaheuristic framework for solving a number of classical combinatorial optimization problems, which strongly depends on the characteristics of neighborhood structure. In this paper, we integrate the neighborhood combination strategies into the hypervolume-based multi-objective local search algorithm, in order to deal with the bi-objective unconstrained binary quadratic programming problem. The experimental results show that certain combinations are superior to others. The performance analysis sheds lights on the ways to further improvements.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
More information about the benchmark instances of UBQP can be found on this website: http://​www.​soften.​ktu.​lt/​-gintaras/​ubqopits.​html.
 
2
More information about the performance assessment package can be found on this website: http://​www.​tik.​ee.​ethz.​ch/​pisa/​assessment.​html.
 
Literatur
1.
Zurück zum Zitat Basseur, M., Liefooghe, A., Le, K., Burke, E.: The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18(2), 263–296 (2012)CrossRef Basseur, M., Liefooghe, A., Le, K., Burke, E.: The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18(2), 263–296 (2012)CrossRef
2.
Zurück zum Zitat Basseur, M., Zeng, R.-Q., Hao, J.-K.: Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8), 1917–1929 (2012)CrossRef Basseur, M., Zeng, R.-Q., Hao, J.-K.: Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8), 1917–1929 (2012)CrossRef
3.
Zurück zum Zitat Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-objective Problems. Genetic and Evolutionary Computation. Springer, New York (2007). doi:10.1007/978-0-387-36797-2 MATH Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-objective Problems. Genetic and Evolutionary Computation. Springer, New York (2007). doi:10.​1007/​978-0-387-36797-2 MATH
4.
Zurück zum Zitat Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58–81 (2014)MathSciNetCrossRefMATH Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58–81 (2014)MathSciNetCrossRefMATH
5.
Zurück zum Zitat Liefooghe, A., Verel, S., Hao, J.-K.: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Appl. Soft Comput. 16, 10–19 (2014)CrossRef Liefooghe, A., Verel, S., Hao, J.-K.: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Appl. Soft Comput. 16, 10–19 (2014)CrossRef
6.
Zurück zum Zitat Liefooghe, A., Verel, S., Paquete, L., Hao, J.-K.: Experiments on local search for bi-objective unconstrained binary quadratic programming. In: Proceedings of the 8th International Conference on Evolutionary Multi-criterion Optimization (EMO 2015), Guimãres, Portugal, pp. 171–186 (2015) Liefooghe, A., Verel, S., Paquete, L., Hao, J.-K.: Experiments on local search for bi-objective unconstrained binary quadratic programming. In: Proceedings of the 8th International Conference on Evolutionary Multi-criterion Optimization (EMO 2015), Guimãres, Portugal, pp. 171–186 (2015)
7.
Zurück zum Zitat Lü, Z., Glover, F., Hao, J.-K.: Neighborhood combination for unconstrained binary quadratic problems. In: Proceedings of the 8th Metaheuristics International Conference (MIC 2009), pp. 281–287 (2009) Lü, Z., Glover, F., Hao, J.-K.: Neighborhood combination for unconstrained binary quadratic problems. In: Proceedings of the 8th Metaheuristics International Conference (MIC 2009), pp. 281–287 (2009)
8.
Zurück zum Zitat Lü, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207, 1254–1262 (2010)MathSciNetCrossRefMATH Lü, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207, 1254–1262 (2010)MathSciNetCrossRefMATH
9.
Zurück zum Zitat Wang, Y., Lü, Z., Glover, F., Hao, J.-K.: Probabilistic grasp-tabu search algorithms for the UBQP problem. Comput. Oper. Res. 40, 3100–3107 (2013)MathSciNetCrossRefMATH Wang, Y., Lü, Z., Glover, F., Hao, J.-K.: Probabilistic grasp-tabu search algorithms for the UBQP problem. Comput. Oper. Res. 40, 3100–3107 (2013)MathSciNetCrossRefMATH
10.
Zurück zum Zitat Wang, Y., Lü, Z.P., Glover, F., Hao, J.K.: Backbone guided tabu search for solving the ubqp problem. J. Heuristics 19, 679–695 (2013)CrossRef Wang, Y., Lü, Z.P., Glover, F., Hao, J.K.: Backbone guided tabu search for solving the ubqp problem. J. Heuristics 19, 679–695 (2013)CrossRef
12.
Zurück zum Zitat Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. Evol. Comput. 3, 257–271 (1999)CrossRef Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. Evol. Comput. 3, 257–271 (1999)CrossRef
Metadaten
Titel
Experiments on Neighborhood Combination Strategies for Bi-objective Unconstrained Binary Quadratic Programming Problem
verfasst von
Li-Yuan Xue
Rong-Qiang Zeng
Wei An
Qing-Xian Wang
Ming-Sheng Shang
Copyright-Jahr
2017
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-6442-5_42

Neuer Inhalt