publication . Report . Article . 2015

The delivery dispatching problem with time windows for urban consolidation centers

W.J.A. van Heeswijk; Martijn R.K. Mes; Johannes M.J. Schutten;
Open Access English
  • Published: 01 Jan 2015
  • Country: Netherlands
This paper addresses the dispatching problem faced by an urban consolidation center. The center receives orders according to a stochastic arrival process and dispatches them in batches for the last-mile distribution. The operator of the center aims to find the cost-minimizing consolidation policy, depending on the orders at hand, preannounced orders, and stochastic arrivals. We present this problem as a variant of the delivery dispatching problem that includes dispatch windows and define a corresponding Markov decision model. Larger instances of the problem suffer from intractably large state-, outcome-, and action spaces. We propose an approximate dynamic progr...
Persistent Identifiers
free text keywords: METIS-316452, IR-104010, Transportation, Mathematical optimization, Sampling (statistics), Bellman equation, Linear programming, Integer, Urban consolidation, Engineering, business.industry, business, Decision problem, Operator (computer programming), Dynamic programming
Related Organizations
30 references, page 1 of 2

Bertazzi, L., Bosco, A., Guerriero, F., and Lagana, D. (2013). A stochastic inventory routing problem with stock-out. Transportation Research Part C: Emerging Technologies, 27:89{107.

Bookbinder, J. H., Cai, Q., and He, Q.-M. (2011). Shipment consolidation by private carrier: the discrete time and discrete quantity case. Stochastic Models, 27(4):664{686.

Burger, M. and Repisky, J. (2012). Problems of linear least square regression. Proceedings in ARSA-Advanced Research in Scienti c Areas, 1(1):257{262.

Cai, Q., He, Q.-M., and Bookbinder, J. H. (2014). A tree-structured markovian model of the shipment consolidation process. Stochastic Models, 30(4):521{553.

Cetinkaya, S. (2005). Coordination of inventory and shipment consolidation decisions: A review of premises, models, and justi cation. In Applications of supply chain management and e-commerce research, pages 3{51. Springer.

Cetinkaya, S. and Bookbinder, J. H. (2003). Stochastic models for the dispatch of consolidated shipments. Transportation Research Part B: Methodological, 37(8):747{768.

Chang, H. S., Hu, J., Fu, M. C., and Marcus, S. I. (2013). Simulation-based algorithms for Markov decision processes. Springer Science & Business Media.

Coelho, L. C., Cordeau, J.-F., and Laporte, G. (2014). Thirty years of inventory routing. Transportation Science, 48(1):1{19.

Coelho, L. C., Laporte, G., and Cordeau, J.-F. (2012). Dynamic and stochastic inventory-routing. Technical Report CIRRELT 2012-37. CIRRELT.

Daganzo, C. F. (1984). The distance traveled to visit n points with a maximum of c stops per vehicle: An analytic model and an application. Transportation Science, 18(4):331{350. [OpenAIRE]

Figliozzi, M. A. (2009). Planning approximations to the average length of vehicle routing problems with time window constraints. Transportation Research Part B: Methodological, 43(4):438{447.

Higginson, J. K. and Bookbinder, J. H. (1995). Markovian decision processes in shipment consolidation. Transportation Science, 29(3):242{255.

Lium, A.-G., Crainic, T. G., and Wallace, S. W. (2009). A study of demand stochasticity in service network design. Transportation Science, 43(2):144{157. [OpenAIRE]

Meng, Q., Wang, T., and Wang, S. (2012). Short-term liner ship eet planning with container transshipment and uncertain container shipment demand. European Journal of Operational Research, 223(1):96{105.

Minko , A. S. (1993). A markov decision model and decomposition heuristic for dynamic vehicle dispatching. Operations Research, 41(1):77{90.

30 references, page 1 of 2
Any information missing or wrong?Report an Issue