{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T06:02:54Z","timestamp":1766210574578,"version":"3.48.0"},"reference-count":11,"publisher":"Information Processing Society of Japan","issue":"0","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Processing"],"published-print":{"date-parts":[[2025]]},"DOI":"10.2197\/ipsjjip.33.1010","type":"journal-article","created":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T22:09:11Z","timestamp":1765750151000},"page":"1010-1019","source":"Crossref","is-referenced-by-count":0,"title":["Transportation Problem on a Tree Using Two-way Trips"],"prefix":"10.2197","volume":"33","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[{"name":"Kanazawa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Ichi","family":"Nakano","sequence":"additional","affiliation":[{"name":"Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1012","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Al-Khayyal, F. and Hwang, S.-J.: Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: Applications and model, <i>Eur. J. Oper. Res.<\/i>, Vol.176, No.1, pp.106-130 (2007).","DOI":"10.1016\/j.ejor.2005.06.047"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Appa, G.: The transportation problem and its variants, <i>Journal of the Operational Research Society<\/i>, Vol.24, No.1, pp.79-99 (1973).","DOI":"10.1057\/jors.1973.10"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Asano, T.: A new transportation problem on a graph with sending and bringing-back operations, Uehara, R., Hong, S.-H. and Nandy, S.C. (Eds), <i>WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021<\/i>, <i>Lecture Notes in Computer Science<\/i>, Vol.12635, pp.13-24, Springer (2021).","DOI":"10.1007\/978-3-030-68211-8_2"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Asano, T.: Minimizing maximum unmet demand by transportations between adjacent nodes characterized by supplies and demands, <i>International Journal of Foundations of Computer Science<\/i>, Vol.34, No.7, pp.693-714 (2023).","DOI":"10.1142\/S0129054123420054"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Asano, T.: Transportation problem allowing sending and bringing back, <i>International Journal of Foundations of Computer Science<\/i>, Vol.34, No.5, pp.487-505 (2023).","DOI":"10.1142\/S0129054122500289"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Braekers, K., Ramaekers, K. and Van Nieuwenhuyse, I.: The vehicle routing problem: State of the art classification and review, <i>Comput. Ind. Eng.<\/i>, Vol.99, pp.300-313 (2016).","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D\u00edaz-Parra, O., Ruiz-Vanoye, J.A., Loranca, B.B., Fuentes-Penna, A. and Barrera-C\u00e1mara, R.A.: A survey of transportation problems, <i>Journal of Applied Mathematics<\/i>, pp.1-17 (2014).","DOI":"10.1155\/2014\/848129"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Fagerholt, K.: Optimal fleet design in a ship routing problem, <i>International Transactions in Operational Research<\/i>, Vol.6, No.5, pp.453-464 (1999).","DOI":"10.1016\/S0969-6016(99)00010-6"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Hern\u00e1ndez-P\u00e9rez, H., Gonz\u00e1lez, J.J.S. and Santos-Hern\u00e1ndez, B.: Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem, <i>Comput. Oper. Res.<\/i>, Vol.97, pp.1-17 (2018).","DOI":"10.1016\/j.cor.2018.04.016"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Orlin, J.B.: Max flows in o(nm) time, or better, Boneh, D., Roughgarden, T. and Feigenbaum, J. (Eds.), <i>Symposium on Theory of Computing Conference, STOC&apos;13<\/i>, pp.765-774, ACM (2013).","DOI":"10.1145\/2488608.2488705"},{"key":"11","unstructured":"[11] Toth, P. and Vigo, D. (Eds.): <i>The Vehicle Routing Problem<\/i>, <i>SIAM monographs on discrete mathematics and applications<\/i>, Vol.9, SIAM (2002)."}],"container-title":["Journal of Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/33\/0\/33_1010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T03:53:16Z","timestamp":1766202796000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/33\/0\/33_1010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":11,"journal-issue":{"issue":"0","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.2197\/ipsjjip.33.1010","relation":{},"ISSN":["1882-6652"],"issn-type":[{"type":"electronic","value":"1882-6652"}],"subject":[],"published":{"date-parts":[[2025]]}}}