{"id":"https://openalex.org/W2027291512","doi":"https://doi.org/10.4304/jnw.8.5.1027-1034","title":"Model and Algorithm for Routing and Scheduling Problem in Hazardous Materials Transportation Network","display_name":"Model and Algorithm for Routing and Scheduling Problem in Hazardous Materials Transportation Network","publication_year":2013,"publication_date":"2013-05-30","ids":{"openalex":"https://openalex.org/W2027291512","doi":"https://doi.org/10.4304/jnw.8.5.1027-1034","mag":"2027291512"},"language":"en","primary_location":{"id":"doi:10.4304/jnw.8.5.1027-1034","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jnw.8.5.1027-1034","pdf_url":null,"source":{"id":"https://openalex.org/S189188848","display_name":"Journal of Networks","issn_l":"1796-2056","issn":["1796-2056"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Networks","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/A5103283859","display_name":"Xiaoyan Shen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaoyan Shen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102643086","display_name":"Chenjiang Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chenjiang Xie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110632025","display_name":"Haoxue Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haoxue Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101917740","display_name":"Zhaowen Qiu","orcid":"https://orcid.org/0000-0001-8979-6049"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhaowen Qiu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3092,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.89322823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"8","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11357","display_name":"Risk and Safety Analysis","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T11357","display_name":"Risk and Safety Analysis","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T10809","display_name":"Occupational Health and Safety Research","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/3614","display_name":"Radiological and Ultrasound Technology"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12945","display_name":"Quality Function Deployment in Product Design","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.9020768404006958},{"id":"https://openalex.org/keywords/hazardous-waste","display_name":"Hazardous waste","score":0.5996975898742676},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5987161993980408},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.553189218044281},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5123029947280884},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44667360186576843},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4448888301849365},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.43393510580062866},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3780047297477722},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.37548887729644775},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34901273250579834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3357548415660858},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17724844813346863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9020768404006958},{"id":"https://openalex.org/C22507642","wikidata":"https://www.wikidata.org/wiki/Q1069369","display_name":"Hazardous waste","level":2,"score":0.5996975898742676},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5987161993980408},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.553189218044281},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5123029947280884},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44667360186576843},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4448888301849365},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.43393510580062866},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3780047297477722},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.37548887729644775},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34901273250579834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3357548415660858},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17724844813346863},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jnw.8.5.1027-1034","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jnw.8.5.1027-1034","pdf_url":null,"source":{"id":"https://openalex.org/S189188848","display_name":"Journal of Networks","issn_l":"1796-2056","issn":["1796-2056"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Networks","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":28,"referenced_works":["https://openalex.org/W204348808","https://openalex.org/W2000783039","https://openalex.org/W2010792738","https://openalex.org/W2013874229","https://openalex.org/W2019870562","https://openalex.org/W2024859223","https://openalex.org/W2027171254","https://openalex.org/W2045474339","https://openalex.org/W2050234905","https://openalex.org/W2054533251","https://openalex.org/W2066145367","https://openalex.org/W2067231044","https://openalex.org/W2077907477","https://openalex.org/W2077913478","https://openalex.org/W2085338135","https://openalex.org/W2092499098","https://openalex.org/W2115623096","https://openalex.org/W2121438552","https://openalex.org/W2368496565","https://openalex.org/W2372427360","https://openalex.org/W2375306723","https://openalex.org/W2580904752","https://openalex.org/W6608347253","https://openalex.org/W6657320730","https://openalex.org/W6666960215","https://openalex.org/W6670117438","https://openalex.org/W6671462379","https://openalex.org/W6732653779"],"related_works":["https://openalex.org/W1503780849","https://openalex.org/W164591511","https://openalex.org/W2968920050","https://openalex.org/W1540139279","https://openalex.org/W1567845959","https://openalex.org/W2102301225","https://openalex.org/W188937797","https://openalex.org/W2386594175","https://openalex.org/W2484270531","https://openalex.org/W622357916"],"abstract_inverted_index":{"To":[0],"reduce":[1],"the":[2,52,60,75,83,93,97,102,108,112,117,131,138,150,155],"risks":[3],"associated":[4],"with":[5,21,88],"hazardous":[6,30],"materials":[7,31],"transportation":[8,32,145,152],"by":[9,115],"optimizing":[10],"routes":[11],"and":[12,18,25,45,74,133,140,147],"delivery":[13],"schedules,":[14],"a":[15,37,66,123],"multiobjective":[16],"routing":[17,139],"scheduling":[19,141],"program":[20,42,142],"multiple":[22,56],"time":[23,26,57,91],"windows":[24,58],"varying":[27],"attributes":[28],"in":[29,143],"network":[33],"is":[34,43,72,80,105,126],"studied.":[35],"First,":[36],"mathematical":[38],"model":[39,53,71,132],"for":[40,54,70,154],"this":[41],"proposed":[44],"two":[46],"punishing":[47],"functions":[48],"are":[49],"introduced":[50],"to":[51,81,106,128],"converting":[55],"into":[59],"penalty":[61],"variables":[62],"of":[63,78,85],"model.":[64],"Second,":[65],"two-step":[67],"solving":[68],"algorithm":[69,79,134],"developed,":[73],"first":[76],"step":[77,104],"find":[82],"set":[84,114],"non-dominated":[86,113],"paths":[87,153],"specific":[89],"departure":[90],"from":[92,111],"origin":[94],"based":[95],"on":[96],"improved":[98],"dynamic":[99],"programming":[100],"method,":[101],"second":[103],"identify":[107,149],"optimal":[109,151],"alternatives":[110],"using":[116],"grey":[118],"correlation":[119],"analysis":[120],"method.":[121],"Finally,":[122],"case":[124],"study":[125],"given":[127],"show":[129],"that":[130],"can":[135,148],"effectively":[136],"solve":[137],"hazmat":[144],"network,":[146],"decision":[156],"maker.":[157]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}