A performance evaluation of the half-exchange gas cylinder replenishment strategy and a metaheuristic algorithm with postponement decision-making for its online scheduling problem

• Item type: SIG Technical Reports(1)
• 公開日: 2024-12-02
• タイトル: A performance evaluation of the half-exchange gas cylinder replenishment strategy and a metaheuristic algorithm with postponement decision-making for its online scheduling problem
• タイトル / 言語: en
• タイトル: A performance evaluation of the half-exchange gas cylinder replenishment strategy and a metaheuristic algorithm with postponement decision-making for its online scheduling problem
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Graduate School of Informatics, Nagoya University
• 著者所属: Toho Liquefied Gas Co., Ltd.
• 著者所属: Toho Gas Co., Ltd.
• 著者所属: Graduate School of Informatics, Nagoya University
• 著者所属: Tokyo University of Science
• 著者所属: Tokyo University of Marine Science and Technology
• 著者所属: Graduate School of Informatics, Nagoya University
• 著者所属: Graduate School of Informatics, Nagoya University
• 著者所属(英): en
• 著者所属(英): Graduate School of Informatics, Nagoya University
• 著者所属(英): en
• 著者所属(英): Toho Liquefied Gas Co., Ltd.
• 著者所属(英): en
• 著者所属(英): Toho Gas Co., Ltd.
• 著者所属(英): en
• 著者所属(英): Graduate School of Informatics, Nagoya University
• 著者所属(英): en
• 著者所属(英): Tokyo University of Science
• 著者所属(英): en
• 著者所属(英): Tokyo University of Marine Science and Technology
• 著者所属(英): en
• 著者所属(英): Graduate School of Informatics, Nagoya University
• 著者所属(英): en
• 著者所属(英): Graduate School of Informatics, Nagoya University
• 著者名: Hang, Dong; Hiroki, Iwata; Tatsuro, Wakahara; Yosuke, Takada; Yannan, Hu; Hideki, Hashimoto; Hirotaka, Ono; Mutsunori, Yagiura
• 著者名(英): Hang, Dong; Hiroki, Iwata; Tatsuro, Wakahara; Yosuke, Takada; Yannan, Hu; Hideki, Hashimoto; Hirotaka, Ono; Mutsunori, Yagiura
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: In rural areas in Japan, gas companies usually allocate each of their clients two or more liquid petroleum gas cylinders, one half for daily use and the other half for safety stock, and they exchange the daily use cylinders shortly after they are exhausted, which is called the half-exchange strategy. This paper focuses on scheduling gas cylinder replenishment for such a gas company. First, we evaluate the performance of this strategy, by comparing it to an all-exchange strategy, and we also observe how its efficiency changes when the widths of exchange intervals (i.e., the span of days within which a gas replenishment visit should take place) are changed. Second, we generate one-day replenishment schedules daily by solving its online scheduling problem. Because the model to be solved each day is a multi-period vehicle routing problem focusing on a relatively short planning period, there are clients whose replenishment interval exceeds the last day of that period. In such cases, we must decide whether the replenishment should be postponed to the next period or performed in the current period. A cost function is introduced to quantify the inconvenience caused by a postponement. This function is determined by analyzing how postponement affects solutions obtained by solving an offline problem. The function is then used in a metaheuristic algorithm to solve this problem under a rolling horizon framework. We conduct simulation experiments on instances generated by emulating real-world data and observe how different margins of error in predicting the amount of remaining gas and the length of the planning horizon affect the solution.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: In rural areas in Japan, gas companies usually allocate each of their clients two or more liquid petroleum gas cylinders, one half for daily use and the other half for safety stock, and they exchange the daily use cylinders shortly after they are exhausted, which is called the half-exchange strategy. This paper focuses on scheduling gas cylinder replenishment for such a gas company. First, we evaluate the performance of this strategy, by comparing it to an all-exchange strategy, and we also observe how its efficiency changes when the widths of exchange intervals (i.e., the span of days within which a gas replenishment visit should take place) are changed. Second, we generate one-day replenishment schedules daily by solving its online scheduling problem. Because the model to be solved each day is a multi-period vehicle routing problem focusing on a relatively short planning period, there are clients whose replenishment interval exceeds the last day of that period. In such cases, we must decide whether the replenishment should be postponed to the next period or performed in the current period. A cost function is introduced to quantify the inconvenience caused by a postponement. This function is determined by analyzing how postponement affects solutions obtained by solving an offline problem. The function is then used in a metaheuristic algorithm to solve this problem under a rolling horizon framework. We conduct simulation experiments on instances generated by emulating real-world data and observe how different margins of error in predicting the amount of remaining gas and the length of the planning horizon affect the solution.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN10505667
• 書誌情報: 研究報告数理モデル化と問題解決（MPS）; 巻 2024-MPS-151, 号 4, p. 1-6, 発行日 2024-12-02
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8833
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会