Optimal berth reservation problem under flexible time slot system

Shunichi Ohmori*, Kazuho Yoshimoto, Choosak Pornsing, Noppakun Sangkhiew

*この研究の対応する著者

研究成果: Article査読

抄録

Traditional method of setting a reservation frame for each truck, which is used in many distribution centers, does not consider the delay in the arrival time of the truck, and the waiting time tends to increase. To solve this problem, a method for setting the reservation time frame for multiple trucks was proposed. The behavior in each reservation frame was modeled as an M/M/k type queue, and the expected stay time in the system was derived. The optimal truck berth reservation frame was determined for each supplier, which was formulated as 0-1 integer programming with an objective function of minimizing the sum of expected stay times. In the numerical experiments, a data set based on a survey conducted by the authors was created and its effectiveness was verified in the real world. The effects of the transportation unit and the number of berths were also considered.

本文言語English
ジャーナルScience, Engineering and Health Studies
15
出版ステータスPublished - 2021

ASJC Scopus subject areas

  • 一般

フィンガープリント

「Optimal berth reservation problem under flexible time slot system」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル