Indexability and index heuristics for a simple class of inventory routing problems

Operations Research

Volumn 57, Issue 2, 2009, Pages 314-326

  Archibald, T W ^a   Black, D P ^b   Glazebrook, K D ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b LANCASTER UNIVERSITY MANAGEMENT SCHOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERISATION; CLOSED FORMS; DECISION MAKERS; HOLDING COSTS; INDEX HEURISTICS; INDEXABILITY; INVENTORY HOLDINGS; INVENTORY LEVELS; INVENTORY ROUTING PROBLEMS; LA-GRANGIAN RELAXATIONS; NUMERICAL STUDIES; REAL-VALUED FUNCTIONS; RESTLESS BANDITTI; ROUTING PROBLEMS; VENDOR-MANAGED INVENTORIES;

HEURISTIC METHODS;

LOCATION;

EID: 65349150629     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0505     Document Type: Article

References (18)

1. Ansell, P. S., K. D. Glazebrook, J. Nino-Mora, M. O'Keeffe. 2003. Whittle's index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57 21-39.
2. Barnes-Schuster, D., Y. Bassok. 1997. Direct shipping and the dynamic single-depot/multi-retailer system. Eur. J. Oper. Res. 101 509-518.
3. Federgruen, A., D. Simchi-Levi. 1995. Analysis of vehicle routing and inventory-routing problems. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8, Chapter 4. North-Holland, Amsterdam, 297-373.
4. Gittins, J. C. 1979. Bandit processes and dynamic allocation indices(with discussion). J. Roy. Statist. Soc. B41 148-177.
5. Gittins, J. C. 1989. Multi-Armed Bandit Allocation Indices. Wiley, Chichester, UK.
6. Glazebrook, K. D., C. Kirkbride. 2007. Dynamic routing to heterogeneous collections of unreliable servers. Queueing Systems 55 9-25.
7. Glazebrook, K. D., C. Kirkbride, D. Ruiz-Hernandez. 2006. Spinning plates and squad systems-Policies for bi-directional restless bandits. Adv. Appl. Probab. 38 95-115.
8. Glazebrook, K. D., H. M. Mitchell, P. S. Ansell. 2005. Index policies for the maintenance of a collection of machines by a set of repairmen. Eur. J. Oper. Res. 165 267-284.
9. Glazebrook, K. D., J. Nino-Mora, P. S. Ansell. 2002. Index policies for a class of discounted restless bandits. Adv. Appl. Probab. 34 754-774.
10. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36 94-118.
11. Mahajan, A. D. Teneketzis. 2008. Multi-armed bandit problems. A. Hero, D. Castanon, D. Cochran, K. Kastella, eds. Foundations and Applications of Sensor Management, Springer, 121-151.
12. Nino-Mora, J. 2001. Restless bandits, partial conservation laws and index- ability. Adv. Appl. Probab. 33 76-98.
13. Niño-Mora, J. 2002. Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Math. Programming 93 361-413.
14. Papadimitriou, C. H., J. N. Tsitsiklis. 1999. The complexity of optimal queueing network control. Math. Oper. Res. 24 293-305.
15. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York.
16. Weber, R. R. G. Weiss. 1990. On an index policy for restless bandits. J. Appl. Probab. 27 637-648.
17. Weber, R. R., G. Weiss. 1991. Addendum to "On an index policy for restless bandits." Adv. Appl. Probab. 23 429-430.
18. Whittle, P. 1988. Restless bandits: Activity allocation in a changing world. J. Gani, ed. A Celebration of Applied Probability(J. Appl. Probab. Spec. 25A), Applied Probab. Trust, Sheffield, UK, 287-298.