A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem

Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is considered as a unified model for a variety of combinatorial optimization problems. Recently, a multi-objective UBQP (mUBQP) is defined and a set of mU...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2013 Sixth International Conference on Advanced Computational Intelligence (ICACI) S. 281 - 286
Hauptverfasser: Ying Zhou, Jiahai Wang, Jian Yin
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2013
Schlagworte:
Benchmark testing
Optimization
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is considered as a unified model for a variety of combinatorial optimization problems. Recently, a multi-objective UBQP (mUBQP) is defined and a set of mUBQP instances is proposed. This paper proposes a directional-biased tabu search algorithm (DTS) for mUBQP problem. In the beginning of the search, DTS optimizes the problem for each objective function to obtain extreme solutions. If extreme solution for one objective function cannot be further improved, the search gradually changes the direction and optimizes the problem along the new directions. The proposed algorithm is tested on 50 mUBQP benchmark instances, and experimental results show that DTS can obtain better solutions than the previous state-of-the-art algorithm for the mUBQP cases.
AbstractList Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is considered as a unified model for a variety of combinatorial optimization problems. Recently, a multi-objective UBQP (mUBQP) is defined and a set of mUBQP instances is proposed. This paper proposes a directional-biased tabu search algorithm (DTS) for mUBQP problem. In the beginning of the search, DTS optimizes the problem for each objective function to obtain extreme solutions. If extreme solution for one objective function cannot be further improved, the search gradually changes the direction and optimizes the problem along the new directions. The proposed algorithm is tested on 50 mUBQP benchmark instances, and experimental results show that DTS can obtain better solutions than the previous state-of-the-art algorithm for the mUBQP cases.
Author Jiahai Wang
Jian Yin
Ying Zhou
Author_xml – sequence: 1
  surname: Ying Zhou
  fullname: Ying Zhou
  organization: Dept. of Comput. Sci., Sun Yat-sen Univ., Guangzhou, China
– sequence: 2
  surname: Jiahai Wang
  fullname: Jiahai Wang
  email: wjiahai@hotmail.com
  organization: Dept. of Comput. Sci., Sun Yat-sen Univ., Guangzhou, China
– sequence: 3
  surname: Jian Yin
  fullname: Jian Yin
  organization: Dept. of Comput. Sci., Sun Yat-sen Univ., Guangzhou, China
BookMark eNotkMtOwzAURI0EC1r4Adj4BxLsOI6dZRXxqFSpG1hX16_UKLFbx0Hi70lFVzObMzqaFboNMViEnigpKSXty7bbdNuyIpSVjaglp-IGrWjdCNawmrJ7dN5g45PV2ccAQ6E8TNbgDGrGk4WkjxiGPiafjyN2MeFxHrIvovq-ID8Wz0HHMOUEPiyc8gHSLz7PYBJkr_EpxT7BOPrQX7oa7PiA7hwMk3285hp9vb1-dh_Fbv--6O4KTyuWC6MlFQ542wJnriFUK1FrLlXNODcKGi0VYW3FqGiJI4a5SgK00taKu0pItkbP_7veWns4JT8uaofrC-wPF7hZhQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICACI.2013.6748517
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1467363413
9781467363433
9781467363419
146736343X
EndPage 286
ExternalDocumentID 6748517
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i123t-dc817fa599a53f601cb74c58b4355dba6c8b039231790f0d3f28aa98e4b5f2783
IEDL.DBID RIE
IngestDate Thu Jun 29 18:38:03 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i123t-dc817fa599a53f601cb74c58b4355dba6c8b039231790f0d3f28aa98e4b5f2783
PageCount 6
ParticipantIDs ieee_primary_6748517
PublicationCentury 2000
PublicationDate 20131001
PublicationDateYYYYMMDD 2013-10-01
PublicationDate_xml – month: 10
  year: 2013
  text: 20131001
  day: 01
PublicationDecade 2010
PublicationTitle 2013 Sixth International Conference on Advanced Computational Intelligence (ICACI)
PublicationTitleAbbrev ICACI
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.5447646
Snippet Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0-1 function. It is a well known NP-hard problem and is considered...
SourceID ieee
SourceType Publisher
StartPage 281
SubjectTerms Benchmark testing
Optimization
Title A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem
URI https://ieeexplore.ieee.org/document/6748517
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELXaioEJUIv4lgdG3CaNHdtjVVHRpeoAUrfKn1BEG1oSfj9nJxQhsbBFVmJLd1benfNeHkK3FkrioVSMpLmjhOYuIcqzlHidJ9ZTFXxRotkEn83EYiHnLXS318I45yL5zPXDZfyWbwtThaOyQTDGYClvozbnea3V-tbBJHIwHY_G00DWyvrNjb8cUyJgTI7-t9Qx6v0o7_B8jyknqOU2XbQd4Rp54rEd9LKAPBaXSle43qhYvT0X0OW_rDHUoDiSBEmhX-uXGQboClVgMIOA53RU4OJtpWzIvsENRWsNC-LGX6aHnib3j-MH0lglkBVAT0msESn3ikkIe-ahyTKaU8OEhmqIWa1yI3SShWKOy8QnNvNDoZQUjmrmg9nGKepsio07Q5in0EHRbCipzmnqHMxInfJa-IwaL9k56oZwLd_rv2Esm0hd_D18iQ5DRmr62xXqlLvKXaMD81muPnY3MYVfU2Kh4g
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNGTGjD-tgePFjbWbuuREAlEJBww4Ub6UzHCBDf_fttuYky8eFuarU3ea_a9133fPoBbZUviDuMUh7EmmMQ6wNzQEBsRB8oQ7nxRvNlEMh6nsxmb1OBuq4XRWnvymW65S_8tX2WycEdlbWeMQcNkB3YpIZ2gVGt9K2EC1h72ur2ho2tFrerWX54pHjL6h_9b7AiaP9o7NNmiyjHU9KoB6y4qsccf3Nlu1mKPQjkXBSq3KuJvz5nt81-WyFahyNMEcSZey9cZsuDl6kBnB2GfE16Di9YFVy7_ElUkraVdEFUOM0146t9PewNcmSXghQWfHCuZhonhlNnAR8a2WVIkRNJU2HqIKsFjmYogcuVcwgITqMh0Us5ZqomgxtltnEB9la30KaAktD0UiTqMiJiEWtsZieZGpCYi0jB6Bg0Xrvl7-T-MeRWp87-Hb2B_MH0czUfD8cMFHLjslGS4S6jnm0JfwZ78zBcfm2ufzi_oaaUp
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2013+Sixth+International+Conference+on+Advanced+Computational+Intelligence+%28ICACI%29&rft.atitle=A+directional-biased+tabu+search+algorithm+for+multi-objective+unconstrained+binary+quadratic+programming+problem&rft.au=Ying+Zhou&rft.au=Jiahai+Wang&rft.au=Jian+Yin&rft.date=2013-10-01&rft.pub=IEEE&rft.spage=281&rft.epage=286&rft_id=info:doi/10.1109%2FICACI.2013.6748517&rft.externalDocID=6748517