首页 | 本学科首页   官方微博 | 高级检索  
     


Decomposing inventory routing problems with approximate value functions
Authors:Alejandro Toriello  George Nemhauser  Martin Savelsbergh
Affiliation:1. Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California 90089;2. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332;3. CSIRO Mathematics, Informatics and Statistics, North Ryde, New South Wales 1670, Australia
Abstract:We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010
Keywords:inventory routing  mixed‐integer program  approximate dynamic program
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号