{"id":"https://openalex.org/W2062149705","doi":"https://doi.org/10.1002/(sici)1097-024x(199607)26:7<851::aid-spe38>3.0.co;2-a","title":"Hybrid Genetic Algorithms for a Rostering Problem","display_name":"Hybrid Genetic Algorithms for a Rostering Problem","publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W2062149705","doi":"https://doi.org/10.1002/(sici)1097-024x(199607)26:7<851::aid-spe38>3.0.co;2-a","mag":"2062149705"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-024x(199607)26:7<851::aid-spe38>3.0.co;2-a","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-024x(199607)26:7<851::aid-spe38>3.0.co;2-a","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","raw_type":"journal-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/A5078254963","display_name":"Angelo Monfroglio","orcid":"https://orcid.org/0009-0000-1458-2951"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Monfroglio","raw_affiliation_strings":["Om Institute of Technology, Via Beldi 19, 28068 Romentino, Italy(e-mail: mc0797\u00a9mclink.it)","Om Institute of Technology, Via Beldi 19, 28068 Romentino, Italy(e\u2010mail: mc0797\u00a9mclink.it)"],"affiliations":[{"raw_affiliation_string":"Om Institute of Technology, Via Beldi 19, 28068 Romentino, Italy(e-mail: mc0797\u00a9mclink.it)","institution_ids":[]},{"raw_affiliation_string":"Om Institute of Technology, Via Beldi 19, 28068 Romentino, Italy(e\u2010mail: mc0797\u00a9mclink.it)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078254963"],"corresponding_institution_ids":[],"apc_list":{"value":4220,"currency":"USD","value_usd":4220},"apc_paid":null,"fwci":1.1515,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.78981127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"26","issue":"7","first_page":"851","last_page":"862"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","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"}},"topics":[{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9922999739646912,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9894999861717224,"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/computer-science","display_name":"Computer science","score":0.5987682342529297},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.594327986240387},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5246034860610962},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48030251264572144},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46336835622787476},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4429682791233063},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.440945029258728},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4282936453819275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20839062333106995},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1317097246646881}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5987682342529297},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.594327986240387},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5246034860610962},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48030251264572144},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46336835622787476},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4429682791233063},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.440945029258728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4282936453819275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20839062333106995},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1317097246646881},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-024x(199607)26:7<851::aid-spe38>3.0.co;2-a","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-024x(199607)26:7<851::aid-spe38>3.0.co;2-a","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3204654320","https://openalex.org/W2114062695"],"abstract_inverted_index":{"Hybrid":[0],"Genetic":[1],"Algorithms":[2],"are":[3,133],"described":[4],"for":[5,92,193,208],"a":[6,28,38,45,63,79,104,108,113,157,185,227,247,251],"large-size":[7,186],"real-life":[8],"rostering":[9],"problem":[10,238],"(railway":[11],"workers'":[12,59,164],"job":[13,33,48,60],"scheduling":[14],"and":[15,51,73,111,151,211],"roster":[16,194],"optimization).":[17],"The":[18,125,167],"new":[19],"algorithm":[20,40,65,82,110],"uses":[21,44],"an":[22,240],"order-based":[23],"representation":[24],"which":[25,43],"encodes":[26],"as":[27],"chromosome":[29],"the":[30,54,58,67,88,93,101,118,122,139,162,170,198,203,206,214,218,237,244],"list":[31],"of":[32,103,112,121,127,148,169,205,217,246],"units":[34,49],"to":[35,57,86,116,191,201,212,235],"schedule.":[36],"First,":[37],"greedy":[39,109],"is":[41,84,173,200,226],"considered,":[42],"randomly":[46],"generated":[47],"list,":[50],"satisfies":[52],"only":[53],"constraints":[55],"pertaining":[56],"contract.":[61],"Then,":[62],"genetic":[64,81,95],"optimizes":[66],"global":[68,215],"roster,":[69],"minimizing":[70],"its":[71],"length":[72],"achieving":[74],"some":[75],"desired":[76],"homogenizations.":[77],"Finally,":[78],"second":[80,114],"(GA)":[83],"used":[85],"find":[87],"best":[89],"parameter":[90,119],"values":[91,120],"first":[94,123],"algorithm.":[96],"Thus,":[97],"this":[98,225],"work":[99,155],"investigates":[100],"use":[102,233],"GA":[105,115],"together":[106],"with":[107,138],"optimize":[117,202],"GA.":[124],"results":[126,141],"significant":[128],"tests":[129],"on":[130,142,184,250],"real":[131],"data":[132,172],"reported.":[134],"They":[135],"compare":[136],"favourably":[137],"known":[140],"Rostering":[143,159],"Problems,":[144],"both":[145],"in":[146,243],"terms":[147],"execution":[149,241],"time":[150,242],"solution":[152],"accuracy.":[153],"This":[154],"considers":[156],"practical":[158],"Problem":[160],"concerning":[161],"Railway":[163],"rosters":[165],"optimization.":[166],"size":[168],"input":[171],"very":[174,228],"challenging:":[175],"about":[176],"1000":[177],"duties":[178],"(i.e.":[179],"job-units":[180],"called":[181],"\u2018links\u2019)":[182],"based":[183],"city":[187],"location;":[188],"125":[189],"days":[190],"consider":[192],"optimization":[195],"(summer":[196],"rostering);":[197],"goal":[199],"structure":[204],"working-turn":[207],"any":[209],"worker,":[210],"minimize":[213],"cost":[216],"rosters.":[219],"It":[220],"should":[221],"be":[222],"emphasised":[223],"that":[224],"large":[229],"problem:":[230],"we":[231],"will":[232],"GAs":[234],"solve":[236],"within":[239],"order":[245],"few":[248],"minutes":[249],"common":[252],"workstation.":[253]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}