A Study on Vehicle Routing Scheduling Problem under Limited Number of Berths

Masanobu Uesugi, Takashi Irohara*, Kazuho Yoshimoto

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

研究成果: Article査読

抄録

At present, it is important problem to reduce transportation cost for most of corporation. In recently, most of customer have specifying time to be served by transportation companies, and it is important for the companies to keep it. Because both reducing cost and improving quality of services are hoped by many transportation companies. Thus, one of the best ways to keep the time window is better scheduling of trucks. And useless waiting time and running time can be reduced. But these are made difficult by following two things. 1 : Time window of customers. 2 : Limited number of berths. Particularly in case of multi route service, 2 is very important. And it is very difficult to solve VRP under limited number of berths. So how to make schedules including both 1 and 2 is needed very much. But there is no research until now. Moreover by making these, it can be easy to work at depot. For these reasons, in this research I develop how to solve Vehicle Routing Scheduling Problem under Limited Number of Berths.

本文言語English
ページ(範囲)3345-3350
ページ数6
ジャーナルNihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
67
662
DOI
出版ステータスPublished - 2001
外部発表はい

ASJC Scopus subject areas

  • 材料力学
  • 機械工学
  • 産業および生産工学

フィンガープリント

「A Study on Vehicle Routing Scheduling Problem under Limited Number of Berths」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル