{"id":"https://openalex.org/W7129345399","doi":"https://doi.org/10.1109/icipw68931.2025.11386325","title":"An Optimal Framework for Airport Luggage Stacking Utilizing Graphbased Representation and Optimization","display_name":"An Optimal Framework for Airport Luggage Stacking Utilizing Graphbased Representation and Optimization","publication_year":2025,"publication_date":"2025-09-14","ids":{"openalex":"https://openalex.org/W7129345399","doi":"https://doi.org/10.1109/icipw68931.2025.11386325"},"language":null,"primary_location":{"id":"doi:10.1109/icipw68931.2025.11386325","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icipw68931.2025.11386325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Image Processing Workshops (ICIPW)","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/A5056714285","display_name":"Miaohong Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100005","display_name":"Silicon Technologies (United States)","ror":"https://ror.org/013qwzt07","country_code":"US","type":"company","lineage":["https://openalex.org/I4210100005"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Miaohong Shi","raw_affiliation_strings":["Reconova Technologies Co., Ltd,China"],"affiliations":[{"raw_affiliation_string":"Reconova Technologies Co., Ltd,China","institution_ids":["https://openalex.org/I4210100005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056714285"],"corresponding_institution_ids":["https://openalex.org/I4210100005"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76177736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.40220001339912415,"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/T12176","display_name":"Optimization and Packing Problems","score":0.40220001339912415,"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.27230000495910645,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.05550000071525574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stacking","display_name":"Stacking","score":0.8475000262260437},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.656499981880188},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5734000205993652},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.539900004863739},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5242999792098999},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49729999899864197},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4839000105857849},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.423799991607666}],"concepts":[{"id":"https://openalex.org/C33347731","wikidata":"https://www.wikidata.org/wiki/Q285210","display_name":"Stacking","level":2,"score":0.8475000262260437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7044000029563904},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.656499981880188},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5734000205993652},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.539900004863739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.526199996471405},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5242999792098999},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49729999899864197},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.3961000144481659},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.38659998774528503},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33070001006126404},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.3012999892234802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2948000133037567},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27570000290870667},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.26579999923706055},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icipw68931.2025.11386325","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icipw68931.2025.11386325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Image Processing Workshops (ICIPW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1776713878","https://openalex.org/W1976705858","https://openalex.org/W2024060531","https://openalex.org/W2076844946","https://openalex.org/W2101057470","https://openalex.org/W2294762224","https://openalex.org/W2341112116","https://openalex.org/W2949817882","https://openalex.org/W3116564952","https://openalex.org/W3138622452","https://openalex.org/W4390168735"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"Graph-Based":[5],"Evolutionary":[6],"Stacking":[7],"Optimization":[8],"(GESO),":[9],"a":[10,36,85],"novel":[11],"framework":[12],"that":[13,89],"couples":[14],"graph":[15,38,86,106],"modeling":[16],"and":[17,31,64,76,101],"evolutionary":[18,55],"computation":[19],"to":[20],"optimize":[21],"luggage":[22,29],"stacking.":[23],"Unlike":[24],"conventional":[25],"approaches,":[26],"GESO":[27,79,96],"represents":[28],"items":[30],"their":[32],"spatial":[33],"relationships":[34],"as":[35,61],"directed":[37],"with":[39,82],"stabilityaware":[40],"edges,":[41],"enabling":[42],"flexible,":[43],"fine-grained":[44],"control":[45],"over":[46],"stacking":[47,73,99],"configurations.":[48],"Dimensional":[49],"clustering":[50],"enables":[51],"coarse-grained":[52],"optimization,":[53],"where":[54],"operators":[56],"perform":[57],"graph-level":[58],"transformations":[59],"such":[60],"subtree":[62],"swaps":[63],"edge":[65],"rewiring.":[66],"A":[67],"multi-objective":[68],"fitness":[69],"function":[70],"jointly":[71],"optimizes":[72],"density,":[74],"balance,":[75],"structural":[77],"stability.":[78],"integrates":[80],"seamlessly":[81],"ABHS":[83],"via":[84],"traversal":[87],"module":[88],"generates":[90],"executable":[91],"loading":[92],"sequences.":[93],"Experiments":[94],"show":[95],"achieves":[97],"superior":[98],"performance":[100],"real-time":[102],"efficiency":[103],"through":[104],"CUDA-accelerated":[105],"kernels,":[107],"making":[108],"it":[109],"well-suited":[110],"for":[111],"dynamic,":[112],"large-scale":[113],"logistics":[114],"optimization.":[115]},"counts_by_year":[],"updated_date":"2026-02-19T06:27:42.648592","created_date":"2026-02-18T00:00:00"}