MULTI-PERIOD INVENTORY VEHICLE ROUTING PROBLEM.

被引：0

作者：

Kubo, Mikio ^{[1
]}

Kasugai, Hiroshi ^{[1
]}

机构：

[1] Waseda Univ, Tokyo, Jpn, Waseda Univ, Tokyo, Jpn

来源：

Waseda Daigaku Rikogaku Kenkyusho Hokoku/Bulletin of Science and Engineering Research Laboratory, | 1987年 / 118期

关键词：

MATHEMATICAL PROGRAMMING - MATHEMATICAL TECHNIQUES - Algorithms - VEHICLES;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

This paper develops an extended model of the classical vehicle routing problem which considers both routing and inventory costs (These costs are assumed time-dependent) and determines the optimal trade-off between these costs. Authors first formulate this problem by a mathematical programming model and an algorithm is derived using Benders' decomposition principle. This algorithm requires exact solutions and dual prices of the traveling salesman problem (TSP) using cutting plane technique. Furthermore three approximate algorithms are developed via polyhedral approximation of the TSP sub-problem. Numerical experiences show these approximate algorithms give good solutions.

引用

页码：19 / 26