A non-myopic dynamic inventory routing and pricing problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 109, Issue , 2018, Pages 83-98

  Sayarshad, Hamid R ^a   Gao, H Oliver ^a  

^a Cornell University   (United States)

Author keywords

Dynamic inventory routing; Dynamic pricing; Infinite horizon look ahead; Inventory management; Markov decision processes; Queuing systems

Indexed keywords

COSTS; INVENTORY CONTROL; QUEUEING THEORY; SALES;

DYNAMIC INVENTORY ROUTING; DYNAMIC PRICING; INFINITE HORIZONS; INFINITE-HORIZON LOOK-AHEAD; INVENTORY MANAGEMENT; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; MARKOV DECISION PROCESSES; QUEUING SYSTEMS; SOCIAL WELFARE;

MARKOV PROCESSES;

INVENTORY; MARKOV CHAIN; PRICE DYNAMICS; TRANSPORTATION ECONOMICS; WELFARE ECONOMICS;

EID: 85034049842     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2017.11.005     Document Type: Article

References (63)

1. Adelman, D., A price-directed approach to stochastic inventory/routing. Oper. Res. 52 (2004), 499–514.
2. Amiri-Aref, M., Klibi, W., Zied Babai, M., The multi-sourcing location inventory problem with stochastic demand. Eur. J. Oper. Res., 2017, 1–16.
3. Assunção, J.L., Meyer, R.J., The rational effect of price promotions on sales and consumption. Manage. Sci. 39:5 (1993), 517–535.
4. Bell, D.R., Iyer, G., Padmanabhan, V., Price competition under stockpiling and flexible consumption. J. Mark. Res. 39:3 (2002), 292–303.
5. Bell, W., Dalberto, L., Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Mack, R., Prutzman, P., Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13 (1983), 4–23.
6. Bertazzi, L., Bosco, A., Guerriero, F., Laganà, D., A stochastic inventory routing problem with stock-out. Transport. Res. Part C: Emerg. Technol. 27 (2013), 89–107.
7. Blattberg, R.C., Eppen, G.D., Lieberman, J., A theoretical and empirical evaluation of price deals for consumer nondurables. J. Market. 45:1 (1981), 116–129.
8. Chan, L.M.A., Simchi-Levi, D., Probabilistic analyses and algorithms for three-level distribution systems. Manage. Sci. 44 (1998), 1562–1576.
9. Chow, J.Y.J., Sayarshad, H.R., Symbiotic network design strategies in the presence of coexisting transportation networks. Transport. Res. Part B: Methodol. 62 (2014), 13–34.
10. Chow, J.Y.J., Sayarshad, H.R., Reference policies for non-myopic sequential network design and timing problems. Networks Spatial Econ. 16:4 (2015), 1183–1209.
11. Christiansen, M., Nygreen, B., A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. 81 (1998), 357–378.
12. Christiansen, M., Nygreen, B., Modelling path flows for a combined ship routing and inventory management problem. Ann. Oper. Res. 82 (1998), 391–412.
13. Christofides, N., 1976. Worst-case analysis of a new heuristic for the traveling salesman problem. Management Sciences Research Report No. 388, Carnegie-Mellon University, Pittsburgh, PA.
14. Coelho, L.C., Cordeau, J.F., Laporte, G., Thirty years of inventory routing. Transport. Sci. 48 (2014), 1–19.
15. Contardo, C., Morency, C., Rousseau, L.M., Balancing a Dynamic Public Bike-Sharing System. 2012, CIRRELT.
16. Cortés, C.E., Sáez, D., Núñez, A., Muñoz-Carpintero, D., Hybrid adaptive predictive control for a dynamic pickup and delivery problem. Transport. Sci. 43:1 (2009), 27–42.
17. Dror, M., Modeling vehicle routing with uncertain demands as a stochastic program: properties of the corresponding solution. Eur. J. Oper. Res. 64:3 (1993), 432–441.
18. Dror, M., Laporte, G., Trudeau, P., Vehicle routing with stochastic demands: Properties and solution frameworks. Transport. Sci. 23:3 (1989), 166–176.
19. Figliozzi, M.A., Mahmassani, H.S., Jaillet, P., Pricing in dynamic vehicle routing problems. Transport. Sci. 41:3 (2007), 302–318.
20. Gao, H.O., Niemeier, D.A., Using functional data analysis of diurnal ozone and NOx cycles to inform transportation emissions control. Transp. Res. Part D 13 (2008), 221–238.
21. Greenblatt, J.B., Shaheen, S., Automated vehicles, on-demand mobility, and environmental impacts. Curr. Sustain. Renew. Energy Rep. 2 (2015), 74–81.
22. Gross, D., Harris, C.M., Fundamentals of Queueing Theory. 3rd ed., 1998, John Wiley & Sons, New York.
23. Ho, T.H., Tang, C.S., Bell, D.R., Rational shopping behavior and the option value of variable pricing. Manage. Sci. 44:12 (1998), S145–S160.
24. Howard, R.A., Dynamic Probabilistic Systems, Vol. II: Semi-Markov and Decision Processes. 1971, Wiley Interscience.
25. Hyytiä, E., Penttinen, A., Sulonen, R., Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives. Comput. Oper. Res. 39:12 (2012), 3021–3030.
26. Ichoua, S., Gendreau, M., Potvin, J.Y., Exploiting knowledge about future demands for real-time vehicle dispatching. Transport. Sci. 40:2 (2006), 211–225.
27. Jaillet, P., Bard, J.F., Huang, L., Dror, M., Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transport. Sci. 36 (2002), 292–300.
28. Jeuland, A.P., Narasimhan, C., Dealing—temporary price cuts—by seller as a buyer discrimination mechanism. J. Bus. 58:3 (1985), 295–308.
29. Kaminsky, P., Simchi-Levi, D., Production and distribution lot sizing in a two stage supply chain. IEE Trans. 35:11 (2003), 1065–1075.
30. Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P., The stochastic inventory routing problem with direct deliveries. Transport. Sci. 36 (2002), 94–118.
31. Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P., Dynamic programming approximations for a stochastic inventory routing problem. Transport. Sci. 38 (2004), 42–70.
32. Knudsen, N.C., Individual and social optimization in a multi-server queue with a general cost–benefit structure’. Econometrica 40:3 (1972), 515–528.
33. Kunreuther, H., Richard, J.F., Optimal pricing and inventory decisions for non-seasonal items. Econometrica 39:1 (1971), 173–175.
34. Lau, A.H.L., Lau, H.S., Effects of a demand-curve's shape on the optimal solutions of a multi-echelon inventory/pricing model. Eur. J. Oper. Res. 147 (2003), 530–548.
35. Liu, S.C., Chen, J.R., A heuristic method for the inventory routing and pricing problem in a supply chain. Expert Syst. Appl. 38 (2011), 1447–1456.
36. Liu, Y.L., Ge, Y.E., Gao, H.O., Improving estimates of transportation emissions: modeling hourly truck traffic using period-based car volume data. Transp. Res. Part D 26 (2014), 32–41.
37. Mendelson, H., Whang, S., Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38:5 (1990), 870–883.
38. Minkoff, A.S., A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Oper. Res. 41 (1993), 77–90.
39. Mitrović-Minić, S., Krishnamurti, R., Laporte, G., Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp. Res. Part B 38:8 (2004), 669–685.
40. Nachiappan, S.P., Jawahar, N., A genetic algorithm for optimal operating parameters of VMI system in a two-echelon supply chain. Eur. J. Oper. Res. 182 (2007), 1433–1452.
41. Naor, P., The regulation of queue size by levying tolls. Econometrica 37:1 (1969), 15–24.
42. Novoa, C., Storer, R., An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196:2 (2009), 509–515.
43. Powell, W.B., A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transport. Sci. 30:3 (1996), 195–219.
44. Powell, W.B., Approximate Dynamic Programming: Solving the Curses of Dimensionality. 2nd ed., 2011, John Wiley and Sons, New York.
45. Psaraftis, H.N., Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61:1 (1995), 143–164.
46. Rao, V.R., Handbook of Pricing Research in Marketing. 2009, E-Elgar.
47. Raviv, T., Tzur, M., Forma, I.A., Static repositioning in a bike-sharing system: models and solution approaches. EURO J. Transport. Logist. 2:3 (2013), 187–229.
48. Sayarshad, H.R., Using bees algorithm for material handling equipment planning in manufacturing systems. Int. J. Adv. Manuf. Technol. 48 (2010), 1009–1018.
49. Sayarshad, H.R., Smart Transit Dynamic Optimization and Informatics. PhD Dissertation, 2015, Ryerson University, Toronto.
50. Sayarshad, H.R., Chow, J.Y.J., A scalable non-myopic dynamic dial-a-ride and pricing problem. Transp. Res. Part B 81 (2015), 539–554.
51. Sayarshad, H.R., Chow, J.Y.J., Survey and empirical evaluation of nonhomogeneous arrival process models with taxi data. J. Adv. Transport. 50:7 (2016), 1275–1294.
52. Sayarshad, H.R., Chow, J.Y.J., Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problem. Transp. Res. Part E 10:6 (2017), 60–77.
53. Sayarshad, H.R., Tavassoli, S., Zhao, F., A multi-periodic optimization formulation for bike planning and bike utilization. Appl. Math. Model. 36:10 (2012), 4944–4951.
54. Schwarz, M., Sauer, C., Daduna, H., Kulik, R., Szekli, R., M/M/1 Queueing systems with inventory. Queueing Syst. 54 (2006), 55–78.
55. Secomandi, N., A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49:5 (2001), 796–802.
56. Spivey, M.Z., Powell, W.B., The dynamic assignment problem. Transport. Sci. 38:4 (2004), 399–419.
57. Thomas, B.W., White, C.C. III, Anticipatory route selection. Transport. Sci. 38:4 (2004), 473–487.
58. Ulmer, M.W., Goodson, J.C., Thomas, B.W., Mattfeld, D.C., 2017. Route-based Markov Decision Processes for Dynamic Vehicle Routing Problems. Working Paper.
59. Virtamo, J., 2004. Lecture notes on Markov decision processes. 38.141 Teletraffic theory.
60. Wilson, N.H.M., 1969. A Prototype Dial-a-Bus System, CARS (Computer Aided Routing System): MIT report R59-53.
61. Wolff, R.W., Stochastic Modeling and the Theory of Queues. 1989, Prentice Hall, Englewood Cliffs, NJ.
62. Zhang, D., Yu, C., Desai, J., Lau, H.Y.K., Srivathsan, S., 2016. A time-space network flow approach to dynamic repositioning in bicycle sharing systems. Transport. Res. Part B: Methodol. https://doi.org/10.1016/j.trb.2016.12.006.
63. Zhang, R., Pavone, M., Control of robotic mobility-on-demand systems: a queueing-theoretical perspective. Int. J. Robot. Res. 35:1–3 (2016), 186–203.