{"id":"https://openalex.org/W2766302048","doi":"https://doi.org/10.1504/ijcsm.2017.10008813","title":"Separated vehicle scheduling optimisation for container trucking transportation based on hybrid quantum evolutionary algorithm","display_name":"Separated vehicle scheduling optimisation for container trucking transportation based on hybrid quantum evolutionary algorithm","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2766302048","doi":"https://doi.org/10.1504/ijcsm.2017.10008813","mag":"2766302048"},"language":"en","primary_location":{"id":"doi:10.1504/ijcsm.2017.10008813","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcsm.2017.10008813","pdf_url":null,"source":{"id":"https://openalex.org/S84141356","display_name":"International Journal of Computing Science and Mathematics","issn_l":"1752-5055","issn":["1752-5055","1752-5063"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computing Science and Mathematics","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/A5011107721","display_name":"Jianfeng Dai","orcid":"https://orcid.org/0000-0002-8747-7586"},"institutions":[{"id":"https://openalex.org/I4210147759","display_name":"Zhejiang Institute of Mechanical and Electrical Engineering","ror":"https://ror.org/055gyn525","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210147759"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianfeng Dai","raw_affiliation_strings":["Department of Computer Engineering, Zhejiang Institute of Mechanical and Electrical Engineering, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Zhejiang Institute of Mechanical and Electrical Engineering, Hangzhou, China","institution_ids":["https://openalex.org/I4210147759"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082429626","display_name":"Zheng Wang","orcid":"https://orcid.org/0000-0001-8305-0676"},"institutions":[{"id":"https://openalex.org/I4210147759","display_name":"Zhejiang Institute of Mechanical and Electrical Engineering","ror":"https://ror.org/055gyn525","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210147759"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zheng Wang","raw_affiliation_strings":["Department of Computer Engineering, Zhejiang Institute of Mechanical and Electrical Engineering, Hangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Zhejiang Institute of Mechanical and Electrical Engineering, Hangzhou, China","institution_ids":["https://openalex.org/I4210147759"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210147759"],"apc_list":null,"apc_paid":null,"fwci":0.2968,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66355556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"5","first_page":"405","last_page":"405"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11223","display_name":"Maritime Ports and Logistics","score":0.9664000272750854,"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/T11223","display_name":"Maritime Ports and Logistics","score":0.9664000272750854,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9571999907493591,"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.9308000206947327,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7308781147003174},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.648356556892395},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5338080525398254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5058419704437256},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.49211782217025757},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4546844959259033},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4236191511154175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17900100350379944}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7308781147003174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.648356556892395},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5338080525398254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5058419704437256},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.49211782217025757},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4546844959259033},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4236191511154175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17900100350379944},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijcsm.2017.10008813","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcsm.2017.10008813","pdf_url":null,"source":{"id":"https://openalex.org/S84141356","display_name":"International Journal of Computing Science and Mathematics","issn_l":"1752-5055","issn":["1752-5055","1752-5063"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computing Science and Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2477876258","https://openalex.org/W2099222495","https://openalex.org/W4385571797","https://openalex.org/W1511852063","https://openalex.org/W4378499136","https://openalex.org/W3125825306","https://openalex.org/W2080708212","https://openalex.org/W2043126582","https://openalex.org/W2020279610","https://openalex.org/W2887328214"],"abstract_inverted_index":{"To":[0,19,35,46,59],"optimise":[1],"the":[2,37,61,64,76,91,95,109],"trucking":[3],"problem":[4],"with":[5],"time":[6],"windows,":[7],"a":[8,23,40,50,101],"multi-objective":[9],"mathematical":[10],"programming":[11],"model":[12],"was":[13,32,44,57,71,87],"established":[14],"for":[15],"separated":[16],"vehicle":[17,96],"scheduling.":[18],"compute":[20],"Pareto":[21,65],"solutions,":[22,66],"phased":[24],"optimal":[25],"algorithm":[26,104],"based":[27,53,99],"on":[28,54,100],"hybrid":[29],"quantum":[30,102],"evolution":[31],"put":[33],"forward.":[34],"enhance":[36],"convergence":[38],"rate,":[39],"greedy":[41],"repair":[42],"operator":[43,70],"designed.":[45,72],"avoid":[47],"premature":[48],"convergence,":[49],"neighbourhood":[51],"search":[52],"node":[55],"switching":[56],"performed.":[58],"maintain":[60],"dispersion":[62],"of":[63,75,111],"an":[67],"adaptive":[68],"grid":[69],"The":[73],"effectiveness":[74],"proposed":[77],"method":[78,98],"compared":[79],"to":[80],"previous":[81],"scheduling":[82,97],"modes":[83],"and":[84,113],"other":[85],"algorithms":[86],"verified":[88],"experimentally.":[89],"For":[90],"same":[92],"transport":[93],"capacity,":[94],"evolutionary":[103],"can":[105],"greatly":[106],"reduce":[107],"both":[108],"number":[110],"vehicles":[112],"cost.":[114]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}