Skip to main content

A Rolling Horizon Auction Mechanism and Virtual Pricing of Shipping Capacity for Urban Consolidation Centers

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9335))

Abstract

A number of cities around the world have adopted urban consolidation centers (UCCs) to address challenges of last-mile deliveries. At the UCC, goods are consolidated based on their destinations prior to their deliveries into city centers. Typically, a UCC owns a fleet of eco-friendly vehicles to carry out such deliveries. Shippers/carriers that make use of the UCC’s service hence no longer need to be restricted by time-window and vehicle-type regulations. As a result, they retain the ability to deploy large trucks for the economies of scale from the source to the UCC which is located outside the city center. Furthermore, the resources which would otherwise be spent in the city center can then be utilized for other purposes. With possibly tighter regulation and thinning profit margin in near future, requests for UCC’s services will become more and more common, and there is a need for a market mechanism to allocate UCC’s resources to provide sustainable services for shippers/carriers in a win-win fashion. An early work of our research team (Handoko et al., 2014) proposed a profit-maximizing auction mechanism for the use of UCC’s last-mile delivery service. In this paper, we extend this work with an idea of rolling horizon to give bidders more flexibility in competing for the UCC’s resources in advance. In particular, it addresses the needs of many shippers/carriers to be able both plan deliveries weeks ahead and at the same time bid for the UCC’s service at the last minute. Under our rolling horizon framework, the capacity of the same truck is up for bid in several successive auctions. To allocate truck capacities among these auctions under future demand uncertainty, we propose a virtual pricing mechanism which makes use of Target-oriented Robust Optimization techniques.

C. Wang—This work was done when the author was a research scientist at Singapore Management University, supported by the A*STAR’s Thematic Schematic Research Programme on Collaborative Urban Logistics under grant number 1224200002.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Adida, E., Perakis, G.: A nonlinear continuous time optimal control model of dynamic pricing and inventory control with no backorders. Naval Research Logistics 54(7), 767–795 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Agarwal, R., Ergun, Ö.: Network design and allocation mechanisms for carrier alliances in liner shipping. Operations Research 58(6), 1726–1742 (2010)

    Article  MATH  Google Scholar 

  • Bitran, G., Caldentey, R.: An overview of pricing models for revenue management. Manufacturing & Service Operations Management 5(3), 203–229 (2003)

    Article  Google Scholar 

  • Caplice, C., Sheffi, Y.: Combinatorial auctions for truckload transportation. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions, chapter 21, pp. 539–571. MIT Press (2006)

    Google Scholar 

  • Chand, S., Hsu, V.N., Sethi, S.: Forecast, solution, and rolling horizons in operations management problems: A classified bibliography. Manufacturing & Service Operations Management 4(1), 25–43 (2002)

    Article  Google Scholar 

  • Chen, W., Sim, M.: Goad-driven optimization. Operation Research 57(2), 342–357 (2009)

    Article  MATH  Google Scholar 

  • Elmaghraby, W., Keskinocak, P.: Dynamic pricing in the presence of inventory considerations: Research overview, current practices, and future directions. Management Science 49(10), 1287–1309 (2003)

    Article  MATH  Google Scholar 

  • Handoko, D., Nguyen, D.T., Lau, H.C.: An auction mechanism for the last-mile deliveries via urban consolidation centre. In: Proceedings of 2014 IEEE International Conference on Automation Science and Engineering, Taipei, Taiwan, pp. 607–612 (2014)

    Google Scholar 

  • Ledyard, J.O., Olson, M., Porter, D., Swanson, J.A., Torma, D.P.: The first use of a combined-value auction for transportation services. Interfaces 32(5), 4–12 (2002)

    Article  Google Scholar 

  • Lee, C.-G., Kwon, R.H., Ma, Z.: A carriers optimal bid generation problem in combinatorial auctions for transportation procurement. Transportation Research Part E: Logistics and Transportation Review 43(2), 173–191 (2007)

    Article  Google Scholar 

  • Mula, J., Poler, R., García-Sabater, J.P., Lario, F.C.: Models for production planning under uncertainty: A review. International Journal of Production Economics 103(1), 271–285 (2006)

    Article  Google Scholar 

  • Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling 12(4), 417–431 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Özener, O.Ö., Ergun, Ö.: Allocating costs in a collaborative transportation procurement network. Transportation Science 42(2), 146–165 (2008)

    Article  Google Scholar 

  • Quak, H., Tavasszy, L.: Customized solutions for sustainable city logistics: the viability of urban freight consolidation centres. In: van Nunen, J.A.E.E., Huijbregts, P., Rietveld, P. (eds.) Transitions Towards Sustainable Mobility, chapter 12, pp. 213–233. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  • Sethi, S., Sorger, G.: A theory of rolling horizon decision making. Annals of Operations Research 29(1), 387–415 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  • Song, J., Regan, A.: Combinatorial auctions for transportation service procurement: The carrier perspective, Technical report, University of California Transportation Center (2003)

    Google Scholar 

  • van Duin, J.H.R., Tavasszy, L.A., Taniguchi, E.: Real time simulation of auctioning and re-scheduling processes in hybrid freight markets. Transportation Research Part B: Methodological 41(9), 1050–1066 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, C., Lau, H.C., Lim, Y.F. (2015). A Rolling Horizon Auction Mechanism and Virtual Pricing of Shipping Capacity for Urban Consolidation Centers. In: Corman, F., Voß, S., Negenborn, R. (eds) Computational Logistics. ICCL 2015. Lecture Notes in Computer Science(), vol 9335. Springer, Cham. https://doi.org/10.1007/978-3-319-24264-4_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24264-4_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24263-7

  • Online ISBN: 978-3-319-24264-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics