{"id":"https://openalex.org/W2610436186","doi":"https://doi.org/10.1109/skima.2016.7916232","title":"Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique","display_name":"Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2610436186","doi":"https://doi.org/10.1109/skima.2016.7916232","mag":"2610436186"},"language":"en","primary_location":{"id":"doi:10.1109/skima.2016.7916232","is_oa":false,"landing_page_url":"https://doi.org/10.1109/skima.2016.7916232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","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/A5050586278","display_name":"Thepparit Sinthamrongruk","orcid":null},"institutions":[{"id":"https://openalex.org/I868834043","display_name":"University of the West of Scotland","ror":"https://ror.org/04w3d2v20","country_code":"GB","type":"education","lineage":["https://openalex.org/I868834043"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thepparit Sinthamrongruk","raw_affiliation_strings":["Artificial Intelligence, University of the west of Scotland, Paisley, UK"],"affiliations":[{"raw_affiliation_string":"Artificial Intelligence, University of the west of Scotland, Paisley, UK","institution_ids":["https://openalex.org/I868834043"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046025661","display_name":"Keshav Dahal","orcid":"https://orcid.org/0000-0003-1789-893X"},"institutions":[{"id":"https://openalex.org/I868834043","display_name":"University of the West of Scotland","ror":"https://ror.org/04w3d2v20","country_code":"GB","type":"education","lineage":["https://openalex.org/I868834043"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Keshav Dahal","raw_affiliation_strings":["Artificial Intelligence, University of the west of Scotland, Paisley, UK"],"affiliations":[{"raw_affiliation_string":"Artificial Intelligence, University of the west of Scotland, Paisley, UK","institution_ids":["https://openalex.org/I868834043"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050586278"],"corresponding_institution_ids":["https://openalex.org/I868834043"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23933831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"218","issue":null,"first_page":"274","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9911999702453613,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9521999955177307,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7302834987640381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6681877374649048},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5874693393707275},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5765413045883179},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5699653029441833},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5444804430007935},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5264039039611816},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4970305263996124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3994492292404175},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24702614545822144},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1937503218650818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19346490502357483},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.17000317573547363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14106065034866333},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.0839097797870636},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0821819007396698}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7302834987640381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6681877374649048},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5874693393707275},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5765413045883179},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5699653029441833},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5444804430007935},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5264039039611816},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4970305263996124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3994492292404175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24702614545822144},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1937503218650818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19346490502357483},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.17000317573547363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14106065034866333},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0839097797870636},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0821819007396698},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/skima.2016.7916232","is_oa":false,"landing_page_url":"https://doi.org/10.1109/skima.2016.7916232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/af38b5f4-e641-404f-9c38-8a5bfd5cc4de","is_oa":false,"landing_page_url":"https://research-portal.uws.ac.uk/en/publications/af38b5f4-e641-404f-9c38-8a5bfd5cc4de","pdf_url":null,"source":{"id":"https://openalex.org/S4306402572","display_name":"The UWS Academic Portal (University of the West of Scotland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I868834043","host_organization_name":"University of the West of Scotland","host_organization_lineage":["https://openalex.org/I868834043"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sinthamrongruk, T & Dahal, K 2017, Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique. in 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016 . IEEE, pp. 274-280, 2016 10th International conference on software; knowledge, information management & applications, Chengdu, China, 15/12/16. https://doi.org/10.1109/SKIMA.2016.7916232","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W33107395","https://openalex.org/W50748466","https://openalex.org/W832004699","https://openalex.org/W1504625725","https://openalex.org/W1565012712","https://openalex.org/W1699895247","https://openalex.org/W2014395398","https://openalex.org/W2020847624","https://openalex.org/W2044050331","https://openalex.org/W2051662438","https://openalex.org/W2054755453","https://openalex.org/W2055531560","https://openalex.org/W2064104291","https://openalex.org/W2125140534","https://openalex.org/W2156653667","https://openalex.org/W2161160262","https://openalex.org/W2169641440","https://openalex.org/W2239205424","https://openalex.org/W2741867212","https://openalex.org/W3023540311","https://openalex.org/W4252618966","https://openalex.org/W6664251600","https://openalex.org/W6741885602"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W3005108979","https://openalex.org/W2913191894","https://openalex.org/W4389782626","https://openalex.org/W4376138746"],"abstract_inverted_index":{"Shortest":[0],"path":[1,40,176],"finding":[2,177],"has":[3,41],"been":[4],"a":[5,157],"challenging":[6],"task":[7,110],"in":[8,76,174],"most":[9],"of":[10,21,33,50,130],"the":[11,19,24,29,34,45,80,102,122,131,162,171],"complex":[12],"multipath":[13],"scenarios.":[14,25],"The":[15,48,84,118],"complexity":[16],"rises":[17],"with":[18,79,92,107,149],"introduction":[20],"constraints":[22],"to":[23,28,54,58,100,115,141,161,170],"Healthcare":[26],"service":[27,46],"patient":[30,109],"is":[31,53,112,139],"one":[32],"real":[35],"world":[36],"problems":[37],"where":[38],"travelling":[39,61,75],"significant":[42],"impact":[43],"on":[44],"time.":[47,152],"purpose":[49],"this":[51],"research":[52],"develop":[55],"new":[56],"approach":[57,86],"solve":[59],"multiple":[60],"salesman":[62],"problem":[63],"(MTSP)":[64],"for":[65],"healthcare":[66,70],"staff":[67],"members":[68],"offering":[69],"services":[71],"at":[72],"patients":[73],"homes":[74],"different":[77,159],"routes":[78],"minimum":[81],"total":[82],"cost.":[83],"proposed":[85],"uses":[87],"Genetic":[88],"Algorithm":[89],"(GA)":[90],"combined":[91,123],"Constructive":[93,134],"Scheduling,":[94],"Local":[95],"Search,":[96],"and":[97],"Adaptive":[98,154],"Technique":[99],"increase":[101],"efficiency.":[103],"A":[104],"case":[105],"study":[106],"45":[108],"locations":[111],"generated":[113],"according":[114],"referenced":[116],"work.":[117],"result":[119],"shows":[120,156],"that":[121,129],"algorithms":[124],"explore":[125],"improved":[126,147],"solution":[127],"than":[128],"traditional":[132,163,172],"GA.":[133,164],"Scheduling":[135],"using":[136],"K-mean":[137],"algorithm":[138],"applied":[140],"generate":[142],"initial":[143],"chromosome":[144],"which":[145],"provides":[146],"results":[148],"acceptable":[150],"computational":[151],"Also,":[153],"GA":[155],"few":[158],"solutions":[160],"All":[165],"these":[166],"approaches":[167],"are":[168],"beneficial":[169],"method":[173],"shortest":[175],"problems.":[178]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}