{"id":"https://openalex.org/W2065192130","doi":"https://doi.org/10.1109/nabic.2014.6921849","title":"A hybrid Harmony search algorithm with variable neighbourhood search for the bin-packing problem","display_name":"A hybrid Harmony search algorithm with variable neighbourhood search for the bin-packing problem","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2065192130","doi":"https://doi.org/10.1109/nabic.2014.6921849","mag":"2065192130"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2014.6921849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2014.6921849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087976149","display_name":"Mauro Castelli","orcid":"https://orcid.org/0000-0002-8793-1451"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Mauro Castelli","raw_affiliation_strings":["ISEGI, Universidade Nova de Lisboa, 1070-312 Lisbon, Portugal","ISEGI, Universidade Nova de Lisboa 1070-312 Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISEGI, Universidade Nova de Lisboa, 1070-312 Lisbon, Portugal","institution_ids":["https://openalex.org/I83558840"]},{"raw_affiliation_string":"ISEGI, Universidade Nova de Lisboa 1070-312 Lisbon, Portugal","institution_ids":["https://openalex.org/I83558840"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056916227","display_name":"Leonardo Vanneschi","orcid":"https://orcid.org/0000-0003-4732-3328"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Leonardo Vanneschi","raw_affiliation_strings":["ISEGI, Universidade Nova de Lisboa, 1070-312 Lisbon, Portugal","ISEGI, Universidade Nova de Lisboa 1070-312 Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISEGI, Universidade Nova de Lisboa, 1070-312 Lisbon, Portugal","institution_ids":["https://openalex.org/I83558840"]},{"raw_affiliation_string":"ISEGI, Universidade Nova de Lisboa 1070-312 Lisbon, Portugal","institution_ids":["https://openalex.org/I83558840"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83558840"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/harmony-search","display_name":"Harmony search","score":0.9142913818359375},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.8914371132850647},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.589243471622467},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.565379798412323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5614374279975891},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.546583354473114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5431001782417297},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.5430353283882141},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4571435749530792},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.4362425208091736},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4260377883911133},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.42488011717796326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32108819484710693},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.26965567469596863},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.18147164583206177},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.16489723324775696},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15482544898986816},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.06078380346298218}],"concepts":[{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.9142913818359375},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8914371132850647},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.589243471622467},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.565379798412323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5614374279975891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.546583354473114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5431001782417297},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.5430353283882141},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4571435749530792},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.4362425208091736},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4260377883911133},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.42488011717796326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32108819484710693},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.26965567469596863},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.18147164583206177},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.16489723324775696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15482544898986816},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.06078380346298218},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2014.6921849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2014.6921849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W90213227","https://openalex.org/W1972380204","https://openalex.org/W1993885071","https://openalex.org/W2010334716","https://openalex.org/W2017450662","https://openalex.org/W2048319749","https://openalex.org/W2058653357","https://openalex.org/W2066671865","https://openalex.org/W2093189214","https://openalex.org/W2112496246","https://openalex.org/W2126554879","https://openalex.org/W2131235969","https://openalex.org/W2144946856","https://openalex.org/W2159000073","https://openalex.org/W3134267570","https://openalex.org/W4230573295","https://openalex.org/W4230935448","https://openalex.org/W7062417688"],"related_works":["https://openalex.org/W2038437572","https://openalex.org/W2074850178","https://openalex.org/W76601469","https://openalex.org/W2971368033","https://openalex.org/W4235035380","https://openalex.org/W2213753232","https://openalex.org/W753174556","https://openalex.org/W2800405684","https://openalex.org/W2377361903","https://openalex.org/W2065192130"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,16,27,33,44],"hybrid":[4],"Harmony":[5],"Search":[6],"algorithm":[7,23,58],"for":[8],"the":[9,37,50,54,67],"bin-packing":[10,13,68],"problem.":[11,20],"The":[12,21,56],"problem":[14,69],"is":[15,72],"well-known":[17],"NP-Hard":[18],"optimization":[19],"proposed":[22],"(called":[24],"BPHS)":[25],"combines":[26],"harmony":[28],"search":[29,47],"algorithm,":[30],"that":[31],"employs":[32],"tournament":[34],"selection":[35],"in":[36],"generation":[38],"of":[39,53,66],"new":[40],"candidate":[41],"solutions,":[42],"with":[43],"variable":[45],"neighbourhood":[46],"to":[48,63,74],"improve":[49],"exploitation":[51],"ability":[52],"algorithm.":[55],"BPHS":[57],"has":[59],"been":[60],"successfully":[61],"applied":[62],"different":[64],"instances":[65],"and":[70],"it":[71],"able":[73],"find":[75],"optimal":[76],"or":[77],"near-optimal":[78],"solutions.":[79]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}