{"id":"https://openalex.org/W2547693469","doi":"https://doi.org/10.1109/gol.2016.7731707","title":"Multi-Objective Sectoring and Balancing Algorithm","display_name":"Multi-Objective Sectoring and Balancing Algorithm","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2547693469","doi":"https://doi.org/10.1109/gol.2016.7731707","mag":"2547693469"},"language":"en","primary_location":{"id":"doi:10.1109/gol.2016.7731707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gol.2016.7731707","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 3rd International Conference on Logistics Operations Management (GOL)","raw_type":"proceedings-article"},"type":"article","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/A5023405464","display_name":"Tarik Chargui","orcid":"https://orcid.org/0000-0002-8579-2566"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tarik Chargui","raw_affiliation_strings":["RSAID Laboratory, National School of Applied Sciences, Tetouan, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RSAID Laboratory, National School of Applied Sciences, Tetouan, Morocco","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003978035","display_name":"Mohamed Reghioui","orcid":"https://orcid.org/0000-0002-5248-4612"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohamed Reghioui","raw_affiliation_strings":["RSAID Laboratory, National School of Applied Sciences, Tetouan, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RSAID Laboratory, National School of Applied Sciences, Tetouan, Morocco","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15896366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9972000122070312,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6868720054626465},{"id":"https://openalex.org/keywords/centroid","display_name":"Centroid","score":0.6782272458076477},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.6285094022750854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5818797945976257},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5518402457237244},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5358605980873108},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5301405191421509},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5185868740081787},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4899884760379791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43222886323928833},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4300847053527832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30311381816864014},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13411974906921387}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6868720054626465},{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.6782272458076477},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.6285094022750854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5818797945976257},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5518402457237244},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5358605980873108},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5301405191421509},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5185868740081787},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4899884760379791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43222886323928833},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4300847053527832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30311381816864014},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13411974906921387},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/gol.2016.7731707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gol.2016.7731707","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 3rd International Conference on Logistics Operations Management (GOL)","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":8,"referenced_works":["https://openalex.org/W1977401236","https://openalex.org/W1997188340","https://openalex.org/W2000358470","https://openalex.org/W2025299767","https://openalex.org/W2108753073","https://openalex.org/W2127218421","https://openalex.org/W2606395562","https://openalex.org/W6678914141"],"related_works":["https://openalex.org/W2381926679","https://openalex.org/W2121543990","https://openalex.org/W2402800040","https://openalex.org/W2000020320","https://openalex.org/W3038204311","https://openalex.org/W2186101196","https://openalex.org/W3039354370","https://openalex.org/W2387908128","https://openalex.org/W2133920285","https://openalex.org/W2981254835"],"abstract_inverted_index":{"This":[0],"is":[1,38,52,78,82,100],"a":[2,5,13],"description":[3],"of":[4,15,44,58,62,68],"Multi-Objective":[6],"Sectoring":[7],"and":[8,27,71],"Balancing":[9],"Algorithm":[10],"which":[11,81,107],"distributes":[12],"set":[14],"points":[16],"in":[17,46,85,111],"order":[18,112],"to":[19,39,53,102,113],"obtain":[20,114],"several":[21],"sectors":[22],"(clusters)":[23],"that":[24],"are":[25],"compact":[26,115],"balanced.":[28],"The":[29,75,97,123],"objective":[30,77,87],"function":[31],"contains":[32],"two":[33],"objectives,":[34],"the":[35,41,49,55,66,69,79,86,95,104,119],"first":[36],"one":[37,51],"balance":[40,54],"potential":[42],"(sum":[43,61],"potentials":[45],"each":[47,59],"cluster),":[48],"second":[50],"total":[56],"distance":[57],"cluster":[60,70],"euclidean":[63],"distances":[64],"between":[65],"centroid":[67],"all":[72],"its":[73],"customers).":[74],"third":[76],"compactness,":[80],"not":[83],"represented":[84],"function,":[88],"but,":[89],"it":[90],"will":[91,108],"be":[92,109],"kept":[93],"during":[94],"algorithm.":[96],"sweep":[98],"heuristic":[99],"used":[101],"build":[103],"initial":[105],"solution":[106],"enhanced":[110],"clusters":[116],"before":[117],"performing":[118],"local":[120],"search":[121],"procedure.":[122],"algorithm":[124],"gives":[125],"good":[126],"results":[127],"on":[128],"real":[129],"instances":[130],"within":[131],"limited":[132],"time.":[133]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}