VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS AND PATH CHOICE

• Ali Gul Qureshi

  Faculty of Engineering, Kyoto University

• Sideney Schreiner

  Faculty of Engineering, Kyoto University

• Taniguchi Eiichi

  Faculty of Engineering, Kyoto University

• Yamada Tadashi

  Faculty of Engineering, Kyoto University

抄録

 This paper presents an integration of an efficient path choice model that considers the drivers' perception and effects of various network related attributes (such as tolled/un-tolled road, restrictions for trucks), and an exact solution approach for the Vehicle Routing and scheduling with Soft Time Windows (VRPSTW) based on the Dantzig-Wolfe decomposition (commonly known as the column generation). It was found that the average cost overrun under such integrated planning approach is significantly less as compared to the planning approach based on commonly used pure shortest path algorithms without considering the network attributes or the truck drivers' perception.

収録刊行物

• 土木計画学研究・論文集

  土木計画学研究・論文集 27 (0), 767-777, 2010

  公益社団法人 土木学会

キーワード

• logistics planning
• logistics
• path choice
• soft time windows

詳細情報

• CRID: 1390001204638595584
• NII論文ID: 130006275261
• DOI: 10.2208/journalip.27.767
• ISSN: 18848303
• ISSN: 09134034
• Web Site: https://www.jstage.jst.go.jp/article/journalip1984/27/0/27_767/_pdf
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可