A Metaheuristics on an inventory routing problem of daily necessities

大島商船高等専門学校紀要 Volume 57 Page 11-14

published_at 2025-03

OS10057000003.pdf

624 KB

Title

日用品の輸送経路決定問題に対するメタヒューリスティック解法

A Metaheuristics on an inventory routing problem of daily necessities

Creators Ishihara Yoshiaki

Creators Xu Zhuqi

Creators Su Yuanming

Source Identifiers [PISSN] 0387-9232 [NCID] AN00031668

Creator Keywords

inventory routing problem big data daily necessities

This paper aims to propose an inventory routing problem for a transportation system of daily necessities. Recently, daily demand can be forecast by big data analysis. Daily delivery according to forecast demand increases transportation cost, and mass transportation increases inventory cost at each shop. In this paper, we propose a metaheuristics on an inventory routing problem for a transportation system of daily necessities and clarified the characteristics of this heuristics.

Resource Type departmental bulletin paper

Publishers National Institute of Technology,Oshima College

Date Issued 2025-03

Access Rights open access

Relations

[ISSN]0387-9232

[NCID]AN00031668