{"id":"https://openalex.org/W4417307723","doi":"https://doi.org/10.2197/ipsjjip.33.1010","title":"Transportation Problem on a Tree Using Two-way Trips","display_name":"Transportation Problem on a Tree Using Two-way Trips","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4417307723","doi":"https://doi.org/10.2197/ipsjjip.33.1010"},"language":"en","primary_location":{"id":"doi:10.2197/ipsjjip.33.1010","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1010","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1010/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1010/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038413661","display_name":"Tetsuo Asano","orcid":"https://orcid.org/0000-0002-4741-0467"},"institutions":[{"id":"https://openalex.org/I10091056","display_name":"Kanazawa University","ror":"https://ror.org/02hwp6a56","country_code":"JP","type":"education","lineage":["https://openalex.org/I10091056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tetsuo Asano","raw_affiliation_strings":["Kanazawa University"],"affiliations":[{"raw_affiliation_string":"Kanazawa University","institution_ids":["https://openalex.org/I10091056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014607132","display_name":"Shin-ichi Nakano","orcid":"https://orcid.org/0000-0003-2368-6183"},"institutions":[{"id":"https://openalex.org/I165735259","display_name":"Gunma University","ror":"https://ror.org/046fm7598","country_code":"JP","type":"education","lineage":["https://openalex.org/I165735259"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shin-Ichi Nakano","raw_affiliation_strings":["Gunma University"],"affiliations":[{"raw_affiliation_string":"Gunma University","institution_ids":["https://openalex.org/I165735259"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038413661"],"corresponding_institution_ids":["https://openalex.org/I10091056"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51299162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"0","first_page":"1010","last_page":"1019"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.42260000109672546,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.42260000109672546,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.3046000003814697,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05719999969005585,"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/tree","display_name":"Tree (set theory)","score":0.6815999746322632},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6337000131607056},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.6158999800682068},{"id":"https://openalex.org/keywords/carry","display_name":"Carry (investment)","score":0.5030999779701233},{"id":"https://openalex.org/keywords/warehouse","display_name":"Warehouse","score":0.4440000057220459},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3718999922275543}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7509999871253967},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6815999746322632},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6337000131607056},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.6158999800682068},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.5030999779701233},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.47859999537467957},{"id":"https://openalex.org/C50416739","wikidata":"https://www.wikidata.org/wiki/Q181623","display_name":"Warehouse","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39969998598098755},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.3257000148296356},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.26840001344680786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2197/ipsjjip.33.1010","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1010","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1010/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.2197/ipsjjip.33.1010","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1010","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1010/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417307723.pdf","grobid_xml":"https://content.openalex.org/works/W4417307723.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1975435416","https://openalex.org/W1983383464","https://openalex.org/W2030665787","https://openalex.org/W2042453802","https://openalex.org/W2262276395","https://openalex.org/W2801120890","https://openalex.org/W3131542862","https://openalex.org/W4233282113","https://openalex.org/W4317401807","https://openalex.org/W4382284586"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"a":[3,30,57,63,68,73,100,162,167],"transportation":[4,65],"problem.":[5],"Inventory":[6],"or":[7,131,164],"demand":[8],"quantities":[9],"for":[10,157],"various":[11],"commodities":[12,46,71,83],"are":[13,23],"specified":[14],"at":[15,50,59],"each":[16,60],"warehouse.":[17,87],"Warehouses":[18],"and":[19,27,62,79],"roads":[20],"connecting":[21],"them":[22],"represented":[24],"as":[25],"nodes":[26],"edges":[28],"of":[29,42,95,103,106,118,161,170],"graph,":[31],"respectively.":[32],"We":[33,55,113,151],"use":[34],"many":[35],"vehicles,":[36],"moving":[37],"around":[38],"only":[39],"locally":[40],"instead":[41],"globally":[43],"to":[44,47,75,85],"carry":[45],"fulfill":[48,110],"demands":[49],"warehouses":[51],"by":[52],"visiting":[53],"neighbors.":[54],"assume":[56],"vehicle":[58,69],"node":[61],"two-way":[64,104],"in":[66,143,166],"which":[67],"carries":[70],"from":[72],"warehouse":[74,78],"an":[76,154],"adjacent":[77],"then":[80,139],"brings":[81],"other":[82],"back":[84],"the":[86,93,116,119,134,159],"In":[88],"this":[89],"scenario":[90],"we":[91],"consider":[92],"problem":[94,120],"deciding":[96,158],"whether":[97,124],"there":[98],"is":[99,129,137,141,149],"single":[101],"round":[102],"transportations":[105],"those":[107],"vehicles":[108],"that":[109,115],"all":[111],"demands.":[112],"show":[114],"hardness":[117],"heavily":[121],"depends":[122],"on":[123],"some":[125],"finite":[126],"loading":[127,135],"capacity":[128,136],"assumed":[130],"not.":[132],"If":[133],"unbounded":[138],"it":[140,148],"solved":[142],"linear":[144],"time,":[145],"but":[146],"otherwise":[147],"NP-complete.":[150],"also":[152],"present":[153],"efficient":[155],"algorithm":[156],"feasibility":[160],"tree":[163],"pseudotree":[165],"special":[168],"case":[169],"one":[171],"commodity.":[172]},"counts_by_year":[],"updated_date":"2026-03-12T06:13:28.667946","created_date":"2025-12-14T00:00:00"}