{"id":"https://openalex.org/W2535475809","doi":"https://doi.org/10.1109/icaict.2014.7035916","title":"Solving the bi-dimensional two-way number partitioning problem with heuristic algorithms","display_name":"Solving the bi-dimensional two-way number partitioning problem with heuristic algorithms","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2535475809","doi":"https://doi.org/10.1109/icaict.2014.7035916","mag":"2535475809"},"language":"en","primary_location":{"id":"doi:10.1109/icaict.2014.7035916","doi":"https://doi.org/10.1109/icaict.2014.7035916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icaict.2014.7035916","pdf_url":null,"source":{"id":"https://openalex.org/S7407087188","display_name":"IEEE International Conference on Application of Information and Communication Technologies (AICT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5060555775","display_name":"Mehmet Hac\u0131beyo\u011flu","orcid":"https://orcid.org/0000-0003-1830-8516","observed_orcids":["https://orcid.org/0000-0003-1830-8516"]},"institutions":[{"id":"https://openalex.org/I4210107659","display_name":"Necmettin Erbakan University","ror":"https://ror.org/013s3zh21","country_code":"TR","type":"education","lineage":["https://openalex.org/I4210107659"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Mehmet Hacibeyoglu","raw_affiliation_strings":["Department of Computer Engineering, Necmettin Erbakan University, Konya, TURKEY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Necmettin Erbakan University, Konya, TURKEY","institution_ids":["https://openalex.org/I4210107659"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027613216","display_name":"Vahit Tongur","orcid":"https://orcid.org/0000-0001-5419-7839","observed_orcids":["https://orcid.org/0000-0001-5419-7839"]},"institutions":[{"id":"https://openalex.org/I4210107659","display_name":"Necmettin Erbakan University","ror":"https://ror.org/013s3zh21","country_code":"TR","type":"education","lineage":["https://openalex.org/I4210107659"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Vahit Tongur","raw_affiliation_strings":["Department of Computer Engineering, Necmettin Erbakan University, Konya, TURKEY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Necmettin Erbakan University, Konya, TURKEY","institution_ids":["https://openalex.org/I4210107659"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068139508","display_name":"Kemal Alaykiran","orcid":"https://orcid.org/0000-0003-0113-8784","observed_orcids":["https://orcid.org/0000-0003-0113-8784"]},"institutions":[{"id":"https://openalex.org/I4210107659","display_name":"Necmettin Erbakan University","ror":"https://ror.org/013s3zh21","country_code":"TR","type":"education","lineage":["https://openalex.org/I4210107659"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Kemal Alaykiran","raw_affiliation_strings":["Department of Industrial Engineering, Necmettin Erbakan University, Konya, TURKEY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Necmettin Erbakan University, Konya, TURKEY","institution_ids":["https://openalex.org/I4210107659"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210107659"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8910999894142151,"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.8910999894142151,"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.08720000088214874,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.7450000047683716},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.7689999938011169},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9739999771118164},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.8679999709129333},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"bin packing","score":0.5950000286102295},{"id":"https://openalex.org/keywords/two-dimensional-bin-packing","display_name":"two-dimensional bin packing","score":0.5270000100135803}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57012540102005},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.564886212348938},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5540027618408203},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5262426733970642},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.5199660062789917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.507538914680481},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4211730659008026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40811342000961304},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.14396163821220398},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icaict.2014.7035916","doi":"https://doi.org/10.1109/icaict.2014.7035916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icaict.2014.7035916","pdf_url":null,"source":{"id":"https://openalex.org/S7407087188","display_name":"IEEE International Conference on Application of Information and Communication Technologies (AICT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W46240799","https://openalex.org/W1566860901","https://openalex.org/W1596439539","https://openalex.org/W2090865599","https://openalex.org/W2128193809","https://openalex.org/W2129511955","https://openalex.org/W2157300811","https://openalex.org/W2483031229","https://openalex.org/W6721836249"],"related_works":["https://openalex.org/W46240799","https://openalex.org/W2090865599","https://openalex.org/W7097649664","https://openalex.org/W1596439539","https://openalex.org/W2204911212","https://openalex.org/W1967199665","https://openalex.org/W1592067092","https://openalex.org/W1998703189","https://openalex.org/W2787953921","https://openalex.org/W3028860924"],"abstract_inverted_index":{"The":[0,34,42,55,100],"two-way":[1,35,44,86],"number":[2,36,45,52,87],"partitioning":[3,37,46,53,88],"problem":[4,38,39,47],"is":[5,40,48,64,92,103],"to":[6],"divide":[7],"set":[8],"of":[9,17,23,51,68,71],"numbers":[10,24,73],"into":[11],"two":[12,59,80],"subsets.":[13],"As":[14],"a":[15,49,104],"result":[16],"the":[18,21,62,66,69,72],"dividing":[19],"process":[20],"sums":[22],"in":[25],"subsets":[26],"must":[27],"be":[28],"as":[29,32],"nearly":[30],"equal":[31],"possible.":[33],"NP-complete.":[41],"bi-dimensional":[43,85],"kind":[50],"problem.":[54,89],"sets":[56],"have":[57],"only":[58],"coordinates":[60],"and":[61,95,114],"aim":[63],"minimized":[65],"differences":[67],"sum":[70],"for":[74,83],"both":[75],"coordinates.":[76],"This":[77],"work":[78],"presents":[79],"heuristic":[81],"algorithm":[82,91,107],"solving":[84],"Fist":[90],"best":[93],"known":[94],"most":[96],"used":[97],"greedy":[98],"algorithm.":[99],"other":[101],"one":[102],"novel":[105],"genetic":[106],"approach.":[108],"These":[109],"algorithms":[110],"are":[111],"analyzed,":[112],"implemented":[113],"tested":[115],"on":[116],"randomly":[117],"different":[118],"20":[119],"datasets.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-10-28T00:00:00"}