Optimization Approach for Multi-Stork Inventory Routing Problem

Abstract:

Article Preview

Inventory routing problem is one of the key issues to achieve integrated management of logistics. Solving this problem effectively, we can improve vehicle utilization, and reduce distribution costs. This paper, concerning the problem in inventory routing of multi-variety, multi-vendor to multi-customers, proposed heuristic algorithm based on greedy rules. The core strategy of the algorithm is to choose circularly the current lowest unit cost routine ---Hamilton delivery routes. Simulation shows that the algorithm reduces the unloaded ratio of truck, raises the efficiency of truck delivery and saves transport costs.

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Edited by:

Feng Xiong

Pages:

1637-1640

DOI:

10.4028/www.scientific.net/AMR.268-270.1637

Citation:

J. C. Lei et al., "Optimization Approach for Multi-Stork Inventory Routing Problem", Advanced Materials Research, Vols. 268-270, pp. 1637-1640, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.