12th IMHRC Proceedings (Gardanne, France – 2012)
Document Type
Research Paper
Publication Date
2012
Abstract
In this paper, we address a one-to-many distribution network inventory routing problem over an infinite planning horizon. Each retailer has an independent, random demand, and the distribution center uses capacitated vehicles for routing delivery. The demand at each retailer is relatively small compared to the vehicle capacity. A novel mathematical model is given to simultaneously decide the optimal routing tours to retailers and routing frequencies of each route. Several heuristics are developed to solve large scale instances of the problem.
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
Publication Title
Progress in Material Handling Research: 2012
Recommended Citation
Askin, Ronald and Xia, Mingjun, "Hybrid Heuristics for Infinite Period Inventory Routing Problem" (2012). 12th IMHRC Proceedings (Gardanne, France – 2012). 1.
https://digitalcommons.georgiasouthern.edu/pmhr_2012/1
Included in
Industrial Engineering Commons, Operational Research Commons, Operations and Supply Chain Management Commons
Comments
Paper 1