A study on vehicle routing and scheduling problem considering summarized delivery of products under the different feasible inventory term

Kingo Udagawa, Takahiro Ogawa, Kazuho Yoshimoto, Weerapat Sessomboom

Research output: Contribution to journalArticle


Primarily, the delivery of multiple kinds of products was done separated. However, as the consumers' needs had diversified, the distribution system also increased. This led to increasing the number of trucks and multiple trips to the same store. Because of enlarging the distribution system total cost increased. To address this problem, summarized delivery, mixing the load of deliver products to one store, is introduced. On the contrary, a realistic approach does not exist. In this paper, we utilized two new neighborhoods, and suggest a method which focuses on a feasible inventory term that would influence delivery efficiency.

Original languageEnglish
Pages (from-to)692-699
Number of pages8
JournalNippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Issue number2
Publication statusPublished - 2002 Feb
Externally publishedYes



  • New Neighborhoods' Search Method (NSM)
  • Tabu Search
  • Vehicle Routing and Scheduling Problem

ASJC Scopus subject areas

  • Mechanical Engineering

Cite this