{"id":"https://openalex.org/W2892588918","doi":"https://doi.org/10.15439/2018f26","title":"A Graph-Theoretic Approach to the Train Marshalling Problem","display_name":"A Graph-Theoretic Approach to the Train Marshalling Problem","publication_year":2018,"publication_date":"2018-09-26","ids":{"openalex":"https://openalex.org/W2892588918","doi":"https://doi.org/10.15439/2018f26","mag":"2892588918"},"language":"en","primary_location":{"id":"doi:10.15439/2018f26","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2018f26","pdf_url":"https://annals-csis.org/proceedings/2018/drp/pdf/26.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2018/drp/pdf/26.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047464344","display_name":"Jens D\u00f6rpinghaus","orcid":"https://orcid.org/0000-0003-0245-7752"},"institutions":[{"id":"https://openalex.org/I4210098248","display_name":"Fraunhofer Institute for Algorithms and Scientific Computing","ror":"https://ror.org/00trw9c49","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210098248","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens D\u00f6rpinghaus","raw_affiliation_strings":["Fraunhofer Institute for Algorithms and Scientific Computing, Schloss Birlinghoven, Sankt Augustin, Germany"],"affiliations":[{"raw_affiliation_string":"Fraunhofer Institute for Algorithms and Scientific Computing, Schloss Birlinghoven, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I4210098248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5097571950","display_name":"Schrader Rainer","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schrader Rainer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047464344"],"corresponding_institution_ids":["https://openalex.org/I4210098248"],"apc_list":null,"apc_paid":null,"fwci":0.4922,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.58710562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"15","issue":null,"first_page":"227","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.9704999923706055,"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/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.9704999923706055,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9650999903678894,"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/T11223","display_name":"Maritime Ports and Logistics","score":0.9438999891281128,"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/marshalling","display_name":"Marshalling","score":0.9630870819091797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6645919680595398},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5059811472892761},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4992959499359131},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4373282790184021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2249944806098938},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13464152812957764},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10281500220298767}],"concepts":[{"id":"https://openalex.org/C206019424","wikidata":"https://www.wikidata.org/wiki/Q373671","display_name":"Marshalling","level":2,"score":0.9630870819091797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6645919680595398},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5059811472892761},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4992959499359131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4373282790184021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2249944806098938},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13464152812957764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10281500220298767}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.15439/2018f26","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2018f26","pdf_url":"https://annals-csis.org/proceedings/2018/drp/pdf/26.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:99b4b0e4c72c49edb3d62d366c49bbde","is_oa":true,"landing_page_url":"https://doaj.org/article/99b4b0e4c72c49edb3d62d366c49bbde","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 15, Pp 227-231 (2018)","raw_type":"article"},{"id":"pmh:oai:publica.fraunhofer.de:publica/407227","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/407227","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":{"id":"doi:10.15439/2018f26","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2018f26","pdf_url":"https://annals-csis.org/proceedings/2018/drp/pdf/26.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2892588918.pdf","grobid_xml":"https://content.openalex.org/works/W2892588918.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W2087830409","https://openalex.org/W2152750316","https://openalex.org/W2260243894","https://openalex.org/W2534499764","https://openalex.org/W2596256509","https://openalex.org/W2785782878","https://openalex.org/W2851960868"],"related_works":["https://openalex.org/W3151494037","https://openalex.org/W2037598996","https://openalex.org/W2391817034","https://openalex.org/W2479275014","https://openalex.org/W2029145332","https://openalex.org/W4295093499","https://openalex.org/W2613283881","https://openalex.org/W2000749863","https://openalex.org/W1985498722","https://openalex.org/W2121340930"],"abstract_inverted_index":{"Rearranging":[0],"cars":[1,25,47],"of":[2,26,35,62,89],"an":[3,80],"incoming":[4,24],"train":[5,19,28,114],"in":[6],"a":[7,11,27,32,67,94],"hump":[8],"yard":[9],"is":[10,57,77],"widely":[12],"discussed":[13],"topic.":[14],"We":[15,65,92],"focus":[16],"on":[17,103],"the":[18,23,44,49,60,99,109,113],"marshalling":[20,115],"problem":[21,101],"where":[22],"are":[29],"distributed":[30],"to":[31,42,58,78,97],"certain":[33],"number":[34,61],"sorting":[36,63],"tracks.":[37,64],"When":[38],"pulled":[39],"out":[40],"again":[41],"build":[43],"outgoing":[45],"train,":[46],"sharing":[48],"same":[50],"destination":[51],"should":[52],"appear":[53],"consecutively.":[54],"The":[55,75],"goal":[56],"minimize":[59],"suggest":[66],"graph-theoretic":[68],"approach":[69],"for":[70,112],"this":[71],"N":[72],"P-complete":[73],"problem.":[74,116],"idea":[76],"partition":[79],"associated":[81],"directed":[82],"graph":[83],"into":[84],"what":[85],"we":[86],"call":[87],"pseudochains":[88],"minimum":[90],"length.":[91],"describe":[93],"greedy-type":[95],"heuristic":[96],"solve":[98],"partitioning":[100],"which,":[102],"random":[104],"instances,":[105],"performs":[106],"better":[107],"than":[108],"known":[110],"heuristics":[111]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}