Multi-product multi-vehicle inventory routing problem with vehicle compatibility and site dependency: A case study in the restaurant chain industry

研究成果: Article査読

抄録

We study an inventory routing problem (IRP) for the restaurant chain. We proposed a model a multi-product multi-vehicle IRP (MMIRP) with multi-compatibility and site-dependency (MMIRP-MCSD). The problem was formulated as a mixed integer programming (MIP). This model is difficult to solve because it is a problem that integrates MMIRP, a multi-compartment vehicle routing problem (MCVRP), and a site dependent VRP (SDVRP), each of which is difficult even by itself. Therefore, in this study, we proposed three-stage Math Heuristics based on the cluster-first and route-second method. In the numerical experiment, verification was performed using actual data, and knowledge on the decision making of the optimum vehicle type was obtained.

本文言語English
ページ(範囲)351-362
ページ数12
ジャーナルUncertain Supply Chain Management
9
2
DOI
出版ステータスPublished - 2021

ASJC Scopus subject areas

  • Management Information Systems
  • Business and International Management
  • Strategy and Management
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research

フィンガープリント 「Multi-product multi-vehicle inventory routing problem with vehicle compatibility and site dependency: A case study in the restaurant chain industry」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル