{"id":"https://openalex.org/W4313166648","doi":"https://doi.org/10.1109/tits.2022.3213834","title":"An Enhanced NSGA-II for Solving Berth Allocation and Quay Crane Assignment Problem With Stochastic Arrival Times","display_name":"An Enhanced NSGA-II for Solving Berth Allocation and Quay Crane Assignment Problem With Stochastic Arrival Times","publication_year":2022,"publication_date":"2022-11-03","ids":{"openalex":"https://openalex.org/W4313166648","doi":"https://doi.org/10.1109/tits.2022.3213834"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2022.3213834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2022.3213834","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/An_Enhanced_NSGA-II_for_Solving_Berth_Allocation_and_Quay_Crane_Assignment_Problem_with_Stochastic_Arrival_Times/21433167","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101443675","display_name":"Bin Ji","orcid":"https://orcid.org/0000-0003-3452-8308"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bin Ji","raw_affiliation_strings":["School of Traffic and Transportation Engineering, Central South University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0003-3452-8308","affiliations":[{"raw_affiliation_string":"School of Traffic and Transportation Engineering, Central South University, Changsha, China","institution_ids":["https://openalex.org/I139660479"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103148147","display_name":"Huang Han","orcid":"https://orcid.org/0000-0003-4713-4391"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Han Huang","raw_affiliation_strings":["School of Traffic and Transportation Engineering, Central South University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0003-4713-4391","affiliations":[{"raw_affiliation_string":"School of Traffic and Transportation Engineering, Central South University, Changsha, China","institution_ids":["https://openalex.org/I139660479"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113017035","display_name":"Samson S. Yu","orcid":"https://orcid.org/0000-0002-2983-7344"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Samson S. Yu","raw_affiliation_strings":["School of Engineering, Deakin University, Waurn Ponds, VIC, Australia"],"raw_orcid":"https://orcid.org/0000-0002-2983-7344","affiliations":[{"raw_affiliation_string":"School of Engineering, Deakin University, Waurn Ponds, VIC, Australia","institution_ids":["https://openalex.org/I149704539"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101443675"],"corresponding_institution_ids":["https://openalex.org/I139660479"],"apc_list":null,"apc_paid":null,"fwci":7.1835,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97350182,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"24","issue":"1","first_page":"459","last_page":"473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11223","display_name":"Maritime Ports and Logistics","score":0.9998999834060669,"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.9998999834060669,"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/T12126","display_name":"Maritime Transport Emissions and Efficiency","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9914000034332275,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7270426154136658},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6532025337219238},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6247327327728271},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5945057272911072},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5799863934516907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5606233477592468},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4790428876876831},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47215816378593445},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45854759216308594},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4196368157863617},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.25476256012916565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21748113632202148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1771383285522461}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7270426154136658},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6532025337219238},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6247327327728271},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5945057272911072},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5799863934516907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5606233477592468},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4790428876876831},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47215816378593445},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45854759216308594},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4196368157863617},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.25476256012916565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21748113632202148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1771383285522461},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tits.2022.3213834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2022.3213834","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"},{"id":"pmh:oai:figshare.com:article/21433167","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/An_Enhanced_NSGA-II_for_Solving_Berth_Allocation_and_Quay_Crane_Assignment_Problem_with_Stochastic_Arrival_Times/21433167","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/21433167","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/An_Enhanced_NSGA-II_for_Solving_Berth_Allocation_and_Quay_Crane_Assignment_Problem_with_Stochastic_Arrival_Times/21433167","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2187447143","display_name":null,"funder_award_id":"2020JJ5780","funder_id":"https://openalex.org/F4320322843","funder_display_name":"Natural Science Foundation of\u00a0Hunan Province"},{"id":"https://openalex.org/G7830714978","display_name":null,"funder_award_id":"2022JJ30767","funder_id":"https://openalex.org/F4320322843","funder_display_name":"Natural Science Foundation of\u00a0Hunan Province"},{"id":"https://openalex.org/G8430088800","display_name":null,"funder_award_id":"72001216","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322843","display_name":"Natural Science Foundation of\u00a0Hunan Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W1719846953","https://openalex.org/W1859193303","https://openalex.org/W1998016704","https://openalex.org/W2004984584","https://openalex.org/W2010615442","https://openalex.org/W2016742135","https://openalex.org/W2025552319","https://openalex.org/W2031077466","https://openalex.org/W2032738706","https://openalex.org/W2047954155","https://openalex.org/W2058243068","https://openalex.org/W2058374293","https://openalex.org/W2058895080","https://openalex.org/W2059499091","https://openalex.org/W2069479298","https://openalex.org/W2072979369","https://openalex.org/W2077753211","https://openalex.org/W2082832591","https://openalex.org/W2114653571","https://openalex.org/W2126105956","https://openalex.org/W2129057129","https://openalex.org/W2141119792","https://openalex.org/W2143381319","https://openalex.org/W2153863959","https://openalex.org/W2234778357","https://openalex.org/W2342820711","https://openalex.org/W2348980703","https://openalex.org/W2501328781","https://openalex.org/W2606496334","https://openalex.org/W2781550859","https://openalex.org/W2809723281","https://openalex.org/W2906427405","https://openalex.org/W2917339392","https://openalex.org/W2917648103","https://openalex.org/W2967399330","https://openalex.org/W2968504882","https://openalex.org/W2993357586","https://openalex.org/W3042585420","https://openalex.org/W3048162581","https://openalex.org/W3089369613","https://openalex.org/W3097265777","https://openalex.org/W3119107356","https://openalex.org/W3119963181","https://openalex.org/W3128544853","https://openalex.org/W3135987480","https://openalex.org/W3148921802","https://openalex.org/W3171795563","https://openalex.org/W3191545389","https://openalex.org/W3212275275","https://openalex.org/W3214837048","https://openalex.org/W4205195203","https://openalex.org/W4225289259","https://openalex.org/W4226493245","https://openalex.org/W4229678751","https://openalex.org/W4281778693","https://openalex.org/W6811038417"],"related_works":["https://openalex.org/W2739612537","https://openalex.org/W2018662469","https://openalex.org/W2062802260","https://openalex.org/W1977335770","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"The":[0,205],"berth":[1,24],"allocation":[2],"and":[3,20,25,137,158,172,201,231,247],"quay":[4,26],"crane":[5,27],"assignment":[6],"problem":[7],"(BACAP)":[8],"is":[9,46,63,83,124,216],"an":[10,18,95,116],"important":[11],"port":[12],"operation":[13],"planning":[14],"problem.":[15],"To":[16],"obtain":[17],"effective":[19],"reliable":[21],"schedule":[22],"of":[23,38,70,161,198,214,243],"(QC),":[28],"this":[29],"study":[30],"addresses":[31],"the":[32,50,68,71,87,99,128,146,159,179,190,196,199,202,209,241,244],"BACAP":[33],"with":[34,103,111,174,226,236],"stochastic":[35,51,219],"arrival":[36,52,220],"times":[37,221],"vessels.":[39],"An":[40],"efficient":[41],"method":[42,153],"combining":[43],"scenario":[44],"generation":[45],"presented":[47],"to":[48,66,85,126,144,177,194],"simulate":[49],"times.":[53],"After":[54],"then,":[55],"a":[56,107,133,138,151],"mixed":[57],"integer":[58],"linear":[59],"programming":[60],"(MILP)":[61],"model":[62,102,110],"established,":[64],"aiming":[65],"minimize":[67],"expectation":[69],"vessels\u2019":[72],"total":[73,211],"stay":[74,212],"time":[75,213],"in":[76,131,189],"port.":[77],"A":[78],"multi-objective":[79,229],"constraint-handling":[80,238],"(MOCH)":[81],"strategy":[82,165],"adopted":[84],"reformulate":[86],"developed":[88],"model,":[89,130],"which":[90,132],"converts":[91],"constraint":[92,167],"violations":[93],"into":[94,106],"objective,":[96],"thus":[97],"transforming":[98],"single-objective":[100,181,233],"optimization":[101,109,182],"complex":[104],"constraints":[105],"dual-objective":[108,129],"only":[112],"easy-handling":[113],"constraints.":[114],"Then":[115],"enhanced":[117],"non-dominated":[118],"sorting":[119],"genetic":[120,175],"algorithm":[121,136,176],"II":[122],"(ENSGA-II)":[123],"proposed":[125,203,245],"solve":[127,178],"neighborhood":[134],"search":[135,139],"bias":[140],"mechanism":[141],"are":[142,169,192,222],"incorporated":[143,173],"strengthen":[145],"local":[147],"exploitation":[148],"capability.":[149],"Furthermore,":[150],"repair":[152],"(RM),":[154],"penalty":[155],"function":[156],"(PF)":[157],"superiority":[160,242],"feasible":[162],"solutions":[163],"(SF)":[164],"for":[166],"handling":[168],"designed":[170],"respectively":[171],"original":[180],"model.":[183],"Finally,":[184],"numerical":[185],"experiments":[186],"on":[187],"instances":[188],"literature":[191],"conducted":[193],"validate":[195],"effectiveness":[197],"MOCH":[200],"ENSGA-II.":[204],"results":[206,225],"show":[207],"that":[208],"average":[210],"vessels":[215],"reduced":[217],"when":[218],"considered.":[223],"Comparison":[224],"another":[227],"two":[228],"methods":[230,234],"three":[232],"combined":[235],"different":[237],"strategies":[239],"corroborate":[240],"ENSGA-II":[246],"MOCH.":[248]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":31},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}