IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v89y2019icp193-211.html
   My bibliography  Save this article

An auction-based approach for prebooked urban logistics facilities

Author

Listed:
  • Yang, Kaidi
  • Roca-Riu, Mireia
  • Menéndez, Mónica

Abstract

The proper management of urban loading/unloading facilities is crucial for both the efficiency of the logistic services and urban traffic systems. Thanks to the advances in technologies, such management can be achieved through prebooked systems. In this paper, we propose a comprehensive and unified auction-based approach to optimize the use of prebooked loading and unloading facilities, based on a previous work of the authors. The new proposed approach assigns parking spots to companies and computes the price of the service, to maximize the social welfare of the system. It has the following advantages over the previous system: (i) by employing an auction’s formulation based on the Vickrey–Clarke–Groves mechanism, the proposed system explicitly considers the heterogeneity in the penalty functions; (ii) uncertainty in the carrier arrivals due to traffic condition is handled explicitly with an online readjustment and two robust formulations.

Suggested Citation

  • Yang, Kaidi & Roca-Riu, Mireia & Menéndez, Mónica, 2019. "An auction-based approach for prebooked urban logistics facilities," Omega, Elsevier, vol. 89(C), pages 193-211.
    • Handle: RePEc:eee:jomega:v:89:y:2019:i:c:p:193-211
    DOI: 10.1016/j.omega.2018.10.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048317310757
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2018.10.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    2. Dušan Teodorović & Konstantinos Triantis & Praveen Edara & Yueqin Zhao & Snežana Mladenović, 2008. "Auction-Based Congestion Pricing," Transportation Planning and Technology, Taylor & Francis Journals, vol. 31(4), pages 399-416, March.
    3. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    4. Mulder, Judith & Dekker, Rommert, 2019. "Designing robust liner shipping schedules: Optimizing recovery actions and buffer times," European Journal of Operational Research, Elsevier, vol. 272(1), pages 132-146.
    5. Dewen Kong & Xiucheng Guo & Bo Yang & Dingxin Wu, 2016. "Analyzing the Impact of Trucks on Traffic Flow Based on an Improved Cellular Automaton Model," Discrete Dynamics in Nature and Society, Hindawi, vol. 2016, pages 1-14, September.
    6. Roca-Riu, Mireia & Fernández, Elena & Estrada, Miquel, 2015. "Parking slot assignment for urban distribution: Models and formulations," Omega, Elsevier, vol. 57(PB), pages 157-175.
    7. Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
    8. Cao, Jin & Menendez, Monica, 2015. "System dynamics of urban traffic based on its parking-related-states," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 718-736.
    9. Robert B. Noland & John W. Polak, 2002. "Travel time variability: A review of theoretical and empirical issues," Transport Reviews, Taylor & Francis Journals, vol. 22(1), pages 39-54, January.
    10. Du, Lili & Gong, Siyuan, 2016. "Stochastic Poisson game for an online decentralized and coordinated parking mechanism," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 44-63.
    11. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    12. Figliozzi, Miguel Andres, 2007. "Analysis of the efficiency of urban commercial vehicle tours: Data collection, methodology, and policy implications," Transportation Research Part B: Methodological, Elsevier, vol. 41(9), pages 1014-1032, November.
    13. Jovanović, Predrag & Kecman, Pavle & Bojović, Nebojša & Mandić, Dragomir, 2017. "Optimal allocation of buffer times to increase train schedule robustness," European Journal of Operational Research, Elsevier, vol. 256(1), pages 44-54.
    14. Zou, Bo & Kafle, Nabin & Wolfson, Ouri & Lin, Jie (Jane), 2015. "A mechanism design based approach to solving parking slot assignment in the information era," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 631-653.
    15. Ge, Qiao & Ciuffo, Biagio & Menendez, Monica, 2015. "Combining screening and metamodel-based methods: An efficient sequential approach for the sensitivity analysis of model outputs," Reliability Engineering and System Safety, Elsevier, vol. 134(C), pages 334-344.
    16. Cao, Jin & Menendez, Monica, 2018. "Quantification of potential cruising time savings through intelligent parking services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 116(C), pages 151-165.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
    2. Xiao, Haohan & Xu, Min & Wang, Shuaian, 2024. "Auction-based parking mechanisms considering withdrawal behaviors," Transport Policy, Elsevier, vol. 147(C), pages 81-93.
    3. Legros, Benjamin & Fransoo, Jan C., 2024. "Admission and pricing optimization of on-street parking with delivery bays," European Journal of Operational Research, Elsevier, vol. 312(1), pages 138-149.
    4. Mor, A. & Speranza, M.G. & Viegas, J.M., 2020. "Efficient loading and unloading operations via a booking system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    5. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    2. Amaya, Johanna & Encarnación, Trilce & Delgado-Lindeman, Maira, 2023. "Understanding Delivery Drivers’ Parking Preferences in Urban Freight Operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 176(C).
    3. Leclercq, Ludovic & Sénécat, Alméria & Mariotte, Guilhem, 2017. "Dynamic macroscopic simulation of on-street parking search: A trip-based approach," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 268-282.
    4. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    5. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    6. Cao, Jin & Menendez, Monica, 2018. "Quantification of potential cruising time savings through intelligent parking services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 116(C), pages 151-165.
    7. Zakharenko, Roman, 2016. "The time dimension of parking economics," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 211-228.
    8. Gu, Ziyuan & Safarighouzhdi, Farshid & Saberi, Meead & Rashidi, Taha H., 2021. "A macro-micro approach to modeling parking," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 220-244.
    9. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    10. Yan Chen & Peter Cramton & John A. List & Axel Ockenfels, 2021. "Market Design, Human Behavior, and Management," Management Science, INFORMS, vol. 67(9), pages 5317-5348, September.
    11. Jiang, Bowen & Fan, Zhi-Ping, 2020. "Optimal allocation of shared parking slots considering parking unpunctuality under a platform-based management approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    12. Karaliopoulos, Merkouris & Katsikopoulos, Konstantinos & Lambrinos, Lambros, 2017. "Bounded rationality can make parking search more efficient: The power of lexicographic heuristics," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 28-50.
    13. Zhang, Fangni & Lindsey, Robin & Yang, Hai & Shao, Chaoyi & Liu, Wei, 2022. "Two-sided pricing strategies for a parking sharing platform: Reselling or commissioning?," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 40-63.
    14. Ignacio Palacios-Huerta & David C. Parkes & Richard Steinberg, 2024. "Combinatorial Auctions in Practice," Journal of Economic Literature, American Economic Association, vol. 62(2), pages 517-553, June.
    15. Lamotte, Raphaël & de Palma, André & Geroliminis, Nikolas, 2017. "On the use of reservation-based autonomous vehicles for demand management," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 205-227.
    16. Stojadinović, Nikola & Bošković, Branislav & Trifunović, Dejan & Janković, Slađana, 2019. "Train path congestion management: Using hybrid auctions for decentralized railway capacity allocation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 123-139.
    17. Sayarshad, Hamid R. & Sattar, Shahram & Oliver Gao, H., 2020. "A scalable non-myopic atomic game for a smart parking mechanism," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    18. Xu, Su Xiu & Cheng, Meng & Kong, Xiang T.R. & Yang, Hai & Huang, George Q., 2016. "Private parking slot sharing," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 596-617.
    19. Iftekhar, M. S. & Tisdell, J. G., 2018. "Learning in repeated multiple unit combinatorial auctions: An experimental study," Working Papers 267301, University of Western Australia, School of Agricultural and Resource Economics.
    20. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:89:y:2019:i:c:p:193-211. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.