{"id":"https://openalex.org/W4387914289","doi":"https://doi.org/10.1109/codit58514.2023.10284404","title":"Discrete Invasive Weed Optimization and Greedy Hybridization Algorithm for Home Care Multi-days Assignment Scheduling and Routing Problems","display_name":"Discrete Invasive Weed Optimization and Greedy Hybridization Algorithm for Home Care Multi-days Assignment Scheduling and Routing Problems","publication_year":2023,"publication_date":"2023-07-03","ids":{"openalex":"https://openalex.org/W4387914289","doi":"https://doi.org/10.1109/codit58514.2023.10284404"},"language":"en","primary_location":{"id":"doi:10.1109/codit58514.2023.10284404","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5048689563","display_name":"Mira Bou Saleh","orcid":"https://orcid.org/0000-0002-6980-4061"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mira Bou Saleh","raw_affiliation_strings":["Univ. Bourgogne Franche-Comté, UTBM,NIT EA 4662,Belfort,France,90010"],"affiliations":[{"raw_affiliation_string":"Univ. Bourgogne Franche-Comté, UTBM,NIT EA 4662,Belfort,France,90010","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074208099","display_name":"Olivier Grunder","orcid":"https://orcid.org/0000-0003-1726-1576"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Grunder","raw_affiliation_strings":["Univ. Bourgogne Franche-Comté, UTBM,NIT EA 4662,Belfort,France,90010"],"affiliations":[{"raw_affiliation_string":"Univ. Bourgogne Franche-Comté, UTBM,NIT EA 4662,Belfort,France,90010","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033726943","display_name":"Amir Hajjam El Hassani","orcid":"https://orcid.org/0000-0002-8470-806X"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Amir Hajjam El Hassani","raw_affiliation_strings":["Univ. Bourgogne Franche-Comté, UTBM,NIT EA 4662,Belfort,France,90010"],"affiliations":[{"raw_affiliation_string":"Univ. Bourgogne Franche-Comté, UTBM,NIT EA 4662,Belfort,France,90010","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048689563"],"corresponding_institution_ids":["https://openalex.org/I37553959"],"apc_list":null,"apc_paid":null,"fwci":0.2076,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5979415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9970999956130981,"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.9969000220298767,"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/scheduling","display_name":"Scheduling (production processes)","score":0.629234790802002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6279534101486206},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.598422646522522},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5878196954727173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5748118162155151},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.573620080947876},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5663726925849915},{"id":"https://openalex.org/keywords/overtime","display_name":"Overtime","score":0.4721427261829376},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4401315450668335},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4208022654056549},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.38140180706977844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33491355180740356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21680393815040588},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12606030702590942}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.629234790802002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6279534101486206},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.598422646522522},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5878196954727173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5748118162155151},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.573620080947876},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5663726925849915},{"id":"https://openalex.org/C2780407378","wikidata":"https://www.wikidata.org/wiki/Q667022","display_name":"Overtime","level":2,"score":0.4721427261829376},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4401315450668335},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4208022654056549},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.38140180706977844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33491355180740356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21680393815040588},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12606030702590942},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit58514.2023.10284404","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","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":13,"referenced_works":["https://openalex.org/W930342000","https://openalex.org/W1809821033","https://openalex.org/W1977040034","https://openalex.org/W1990520230","https://openalex.org/W2025148441","https://openalex.org/W2086163307","https://openalex.org/W2191596536","https://openalex.org/W2548041025","https://openalex.org/W2789035412","https://openalex.org/W2902395547","https://openalex.org/W2998919451","https://openalex.org/W3131667019","https://openalex.org/W4312491951"],"related_works":["https://openalex.org/W3110381201","https://openalex.org/W2951976120","https://openalex.org/W2983685817","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W134783735","https://openalex.org/W2365237642","https://openalex.org/W3116484972","https://openalex.org/W4232431455","https://openalex.org/W2021332829"],"abstract_inverted_index":{"This":[0],"article":[1],"formulates":[2],"a":[3,97,102,108,136,140,185],"multi-day":[4,173],"home":[5,141,174],"care":[6,142,175],"assignment":[7],"scheduling":[8],"and":[9,15,38,63,68,71,75,101,130,178],"routing":[10,179],"problem":[11,180],"in":[12,122,184],"which":[13],"workload":[14,74],"distances":[16],"are":[17,44,112],"balanced":[18],"between":[19,79],"the":[20,32,39,42,48,55,59,64,73,76,80,83,116,119,124,161,167,172],"employees.":[21,81],"Additionally,":[22],"constraints":[23],"such":[24],"as":[25,171],"lunch":[26],"breaks,":[27],"maximum":[28,33],"daily":[29],"working":[30],"hours,":[31,37,70],"number":[34,65],"of":[35,41,66,118,139,163],"overtime":[36,69],"amplitude":[40],"day":[43],"considered":[45],"when":[46],"solving":[47,91,123],"problem.":[49],"The":[50,157],"objective":[51],"is":[52,86],"to":[53,150],"satisfy":[54],"clients'":[56],"preferences,":[57],"minimize":[58],"total":[60],"distance":[61,77],"traveled":[62,78],"wasted":[67],"balance":[72],"Since":[82],"proposed":[84],"model":[85],"an":[87,151],"NP-Hard":[88],"problem,":[89],"for":[90],"large-scale":[92],"problems,":[93],"two":[94,120],"resolution":[95,165],"methods,":[96],"genetic":[98],"algorithm":[99],"approach,":[100],"discrete":[103],"invasive":[104],"weed":[105],"optimization":[106],"with":[107],"greedy":[109],"heuristic":[110],"hybridization":[111],"presented.":[113],"To":[114],"validate":[115],"efficiency":[117,162],"approaches":[121],"Home":[125],"Care":[126],"Multi-day":[127],"Assignment,":[128],"Scheduling,":[129],"Routing":[131],"Problems,":[132],"instances":[133],"inspired":[134],"by":[135],"real-life":[137],"example":[138],"center":[143],"were":[144,148],"tested.":[145],"Moreover,":[146],"they":[147],"compared":[149],"exact":[152],"mixed-integer":[153],"linear":[154],"programming":[155],"method.":[156],"optimal":[158],"results":[159],"show":[160],"our":[164],"methods;":[166],"solutions":[168],"perform":[169],"well":[170],"assignment,":[176],"scheduling,":[177],"can":[181],"be":[182],"solved":[183],"reasonable":[186],"time.":[187]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}