{"id":"https://openalex.org/W4388534221","doi":"https://doi.org/10.1142/s1752890923500101","title":"A Simulated Annealing Algorithm for Quay Crane Scheduling and Assignment Problem Under Uncertain Conditions","display_name":"A Simulated Annealing Algorithm for Quay Crane Scheduling and Assignment Problem Under Uncertain Conditions","publication_year":2023,"publication_date":"2023-11-09","ids":{"openalex":"https://openalex.org/W4388534221","doi":"https://doi.org/10.1142/s1752890923500101"},"language":"en","primary_location":{"id":"doi:10.1142/s1752890923500101","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1752890923500101","pdf_url":null,"source":{"id":"https://openalex.org/S4210199942","display_name":"Journal of Uncertain Systems","issn_l":"1752-8909","issn":["1752-8909","1752-8917"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Uncertain Systems","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/A5093231164","display_name":"Sima Sargazi","orcid":"https://orcid.org/0009-0005-4998-8667"},"institutions":[{"id":"https://openalex.org/I180634299","display_name":"University of Sistan and Baluchestan","ror":"https://ror.org/02n43xw86","country_code":"IR","type":"education","lineage":["https://openalex.org/I180634299"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Sima Sargazi","raw_affiliation_strings":["Faculty of Mathematics, Statistics and Computer Science, University of Sistan and Baluchestan, Zahedan, Iran"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Statistics and Computer Science, University of Sistan and Baluchestan, Zahedan, Iran","institution_ids":["https://openalex.org/I180634299"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062529345","display_name":"Hamed Ahmadzade","orcid":"https://orcid.org/0000-0002-9755-2199"},"institutions":[{"id":"https://openalex.org/I180634299","display_name":"University of Sistan and Baluchestan","ror":"https://ror.org/02n43xw86","country_code":"IR","type":"education","lineage":["https://openalex.org/I180634299"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Hamed Ahmadzade","raw_affiliation_strings":["Faculty of Mathematics, Statistics and Computer Science, University of Sistan and Baluchestan, Zahedan, Iran"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Statistics and Computer Science, University of Sistan and Baluchestan, Zahedan, Iran","institution_ids":["https://openalex.org/I180634299"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050458558","display_name":"Hassan Mishmast Nehi","orcid":"https://orcid.org/0000-0002-7573-1751"},"institutions":[{"id":"https://openalex.org/I180634299","display_name":"University of Sistan and Baluchestan","ror":"https://ror.org/02n43xw86","country_code":"IR","type":"education","lineage":["https://openalex.org/I180634299"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hassan Mishmast Nehi","raw_affiliation_strings":["Faculty of Mathematics, Statistics and Computer Science, University of Sistan and Baluchestan, Zahedan, Iran"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Statistics and Computer Science, University of Sistan and Baluchestan, Zahedan, Iran","institution_ids":["https://openalex.org/I180634299"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093231165","display_name":"Jafar Sayareh","orcid":"https://orcid.org/0000-0002-2143-1841"},"institutions":[{"id":"https://openalex.org/I4210096424","display_name":"Chabahar Maritime University","ror":"https://ror.org/00rs50b76","country_code":"IR","type":"education","lineage":["https://openalex.org/I4210096424"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Jafar Sayareh","raw_affiliation_strings":["Faculty of Marine Engineering, Chabahar Maritime University, Chabahar, Iran"],"affiliations":[{"raw_affiliation_string":"Faculty of Marine Engineering, Chabahar Maritime University, Chabahar, Iran","institution_ids":["https://openalex.org/I4210096424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5062529345"],"corresponding_institution_ids":["https://openalex.org/I180634299"],"apc_list":null,"apc_paid":null,"fwci":0.6237,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74860172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"17","issue":"01","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11223","display_name":"Maritime Ports and Logistics","score":0.9997000098228455,"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.9997000098228455,"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.9926999807357788,"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.9747999906539917,"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/simulated-annealing","display_name":"Simulated annealing","score":0.7525972127914429},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6731668710708618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6684703826904297},{"id":"https://openalex.org/keywords/usable","display_name":"USable","score":0.6027466058731079},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5321468710899353},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5013389587402344},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.49516358971595764},{"id":"https://openalex.org/keywords/container","display_name":"Container (type theory)","score":0.4619489312171936},{"id":"https://openalex.org/keywords/matlab","display_name":"MATLAB","score":0.4521872103214264},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45199137926101685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43426987528800964},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4138113856315613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19322526454925537},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11604610085487366},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10960319638252258}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7525972127914429},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6731668710708618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6684703826904297},{"id":"https://openalex.org/C2780615836","wikidata":"https://www.wikidata.org/wiki/Q2471869","display_name":"USable","level":2,"score":0.6027466058731079},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5321468710899353},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5013389587402344},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.49516358971595764},{"id":"https://openalex.org/C2781018962","wikidata":"https://www.wikidata.org/wiki/Q5164884","display_name":"Container (type theory)","level":2,"score":0.4619489312171936},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.4521872103214264},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45199137926101685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43426987528800964},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4138113856315613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19322526454925537},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11604610085487366},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10960319638252258},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"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.1142/s1752890923500101","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1752890923500101","pdf_url":null,"source":{"id":"https://openalex.org/S4210199942","display_name":"Journal of Uncertain Systems","issn_l":"1752-8909","issn":["1752-8909","1752-8917"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Uncertain Systems","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":31,"referenced_works":["https://openalex.org/W608467838","https://openalex.org/W1505119482","https://openalex.org/W1968811477","https://openalex.org/W1973673038","https://openalex.org/W1986444038","https://openalex.org/W1990033027","https://openalex.org/W1994726321","https://openalex.org/W2003811609","https://openalex.org/W2024060531","https://openalex.org/W2033724226","https://openalex.org/W2040490415","https://openalex.org/W2047449665","https://openalex.org/W2058197631","https://openalex.org/W2058374293","https://openalex.org/W2067346526","https://openalex.org/W2099189023","https://openalex.org/W2106814576","https://openalex.org/W2118152326","https://openalex.org/W2159548533","https://openalex.org/W2344899315","https://openalex.org/W2485957396","https://openalex.org/W2501328781","https://openalex.org/W2577971819","https://openalex.org/W2954875143","https://openalex.org/W3041688180","https://openalex.org/W4205331178","https://openalex.org/W4206830167","https://openalex.org/W4210259099","https://openalex.org/W4234521054","https://openalex.org/W4239991171","https://openalex.org/W4292158025"],"related_works":["https://openalex.org/W2982321410","https://openalex.org/W95465806","https://openalex.org/W2392004567","https://openalex.org/W2940029036","https://openalex.org/W2756595502","https://openalex.org/W2010789764","https://openalex.org/W2187233292","https://openalex.org/W2219281195","https://openalex.org/W184826316","https://openalex.org/W4389422031"],"abstract_inverted_index":{"In":[0,74,279],"this":[1,75,247],"paper,":[2,76],"a":[3,177],"mixed":[4],"integer":[5],"programming":[6],"(MIP)":[7],"mathematical":[8],"model":[9,217,254,288],"was":[10,83,149,168],"formulated":[11],"for":[12,176,194,203],"the":[13,25,29,35,40,44,54,57,66,71,77,81,91,102,106,116,124,132,142,153,181,219,222,230,235,241,252,274,286,293],"quay":[14],"crane":[15,295],"scheduling":[16,297],"and":[17,47,89,131,165,240,244,266,271],"assignment":[18,296],"problem":[19,58,179,298],"(QCSAP)":[20],"in":[21,62,90,115,137,189,233,260,289],"container":[22,110,238],"terminals":[23,239],"with":[24,180,218,268,273],"aim":[26],"of":[27,32,43,53,56,80,93,108,127,134,139,191,206,221,229,237,246,276],"minimizing":[28],"total":[30],"cost":[31],"activities.":[33],"With":[34],"assumption":[36],"that":[37],"due":[38],"to":[39,59,64,70,101,151,209,251,285,291],"uncertain":[41,78],"nature":[42,79],"ship\u2019s":[45],"activities":[46],"operations,":[48],"we":[49],"have":[50],"considered":[51],"most":[52],"parameters":[55,82],"be":[60,99,227],"indeterminate":[61,94],"order":[63,290],"bring":[65],"optimal":[67],"solution":[68,183],"closer":[69],"real":[72,129],"world.":[73],"investigated":[84,267],"by":[85,162,172,256],"using":[86],"uncertainty":[87],"theory":[88],"form":[92],"quantities.":[95],"These":[96],"uncertainties":[97],"might":[98],"subject":[100],"conditions,":[103,120],"such":[104,128],"as":[105],"failure":[107],"cranes,":[109],"terminal":[111],"transportation":[112],"means,":[113],"congestion":[114],"dockyard,":[117],"adverse":[118],"weather":[119],"etc.":[121],"Further,":[122],"considering":[123],"large":[125],"dimensions":[126],"problems":[130],"complexity":[133],"solving":[135],"them":[136],"terms":[138,190],"processing":[140],"time,":[141],"simulated":[143],"annealing":[144],"(SA)":[145],"meta-heuristic":[146],"optimization":[147],"algorithm":[148,158,199,225],"utilized":[150],"solve":[152],"above":[154,223,294],"model.":[155],"The":[156,197,212],"proposed":[157,198,224],"has":[159,263],"been":[160,264],"coded":[161],"MATLAB":[163],"software":[164,186],"its":[166,174],"efficiency":[167],"put":[169],"on":[170],"test":[171],"comparing":[173],"results":[175],"low-dimensional":[178],"accurate":[182],"from":[184],"GAMS":[185],"is":[187,249],"compared":[188,250],"computational":[192],"times":[193],"small":[195],"sizes.":[196],"exhibited":[200],"promising":[201],"potentials":[202],"quick":[204],"approximation":[205],"usable":[207],"solutions":[208],"high-dimensional":[210],"QCSAPs.":[211],"calculations":[213],"show":[214],"that,":[215],"nondeterministic":[216],"help":[220,275],"can":[226],"one":[228],"basic":[231,253,287],"factors":[232],"increasing":[234],"productivity":[236],"main":[242],"purpose":[243],"advantage":[245],"research":[248],"presented":[255],"Tavakkoli-Moghaddam":[257],"et":[258],"al.":[259],"2009":[261],"which":[262],"analyzed":[265],"definitive":[269],"data":[270],"optimized":[272],"genetic":[277],"algorithm.":[278],"addition,":[280],"some":[281],"restrictions":[282],"were":[283],"added":[284],"make":[292],"more":[299],"practical.":[300]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}