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

Parking slot assignment for urban distribution: Models and formulations

Author

Listed:
  • Roca-Riu, Mireia
  • Fernández, Elena
  • Estrada, Miquel

Abstract

A key element to enhance urban distribution is the adequate management of parking space, particularly for loading and unloading operations. An in-advance booking system able to be adjusted to users needs can be a very useful tool for city councils. Such a tool should be fed with criteria for allocating requests to time slots. In this paper we discuss alternative criteria for the parking slot assignment problem for urban distribution and we propose the use of mathematical programming formulations to model them. Several models are proposed, analyzed and compared among them. Extensive computational experience is presented with a detailed analysis and comparison, which provides quantitative indicators of the quality of each of the proposed models.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jomega:v:57:y:2015:i:pb:p:157-175
    DOI: 10.1016/j.omega.2015.04.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048315000845
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2015.04.010?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. Rosenhead, Jonathan, 1981. "Operational research in urban planning," Omega, Elsevier, vol. 9(4), pages 345-364.
    2. Yin, Yunqiang & Cheng, T.C.E. & Hsu, Chou-Jung & Wu, Chin-Chia, 2013. "Single-machine batch delivery scheduling with an assignable common due window," Omega, Elsevier, vol. 41(2), pages 216-225.
    3. A Bolat, 2001. "Models and a genetic algorithm for static aircraft-gate assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1107-1120, October.
    4. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    5. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    6. Gerra, M.J. & Ross, M.S., 1973. "An interactive city planning model," Omega, Elsevier, vol. 1(6), pages 747-755, December.
    7. Narciso, Mercedes E. & Piera, Miquel A., 2015. "Robust gate assignment procedures from an airport management perspective," Omega, Elsevier, vol. 50(C), pages 82-95.
    8. Alberto Caprara & Laura Galli & Paolo Toth, 2011. "Solution of the Train Platforming Problem," Transportation Science, INFORMS, vol. 45(2), pages 246-257, May.
    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. Marko Mladenović & Thierry Delot & Gilbert Laporte & Christophe Wilbaut, 2020. "The parking allocation problem for connected vehicles," Journal of Heuristics, Springer, vol. 26(3), pages 377-399, June.
    2. 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.
    3. 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).
    4. Wanjie Hu & Jianjun Dong & Bon-gang Hwang & Rui Ren & Zhilong Chen, 2019. "A Scientometrics Review on City Logistics Literature: Research Trends, Advanced Theory and Practice," Sustainability, MDPI, vol. 11(10), pages 1-27, May.
    5. 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.
    6. 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).
    7. 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. Skorupski, Jacek & Żarów, Piotr, 2021. "Dynamic management of aircraft stand allocation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    2. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    3. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    4. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    5. Yunqiang Yin & Doudou Li & Dujuan Wang & T. C. E. Cheng, 2021. "Single-machine serial-batch delivery scheduling with two competing agents and due date assignment," Annals of Operations Research, Springer, vol. 298(1), pages 497-523, March.
    6. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    7. Tao, Liangyan & Liu, Sifeng & Xie, Naiming & Javed, Saad Ahmed, 2021. "Optimal position of supply chain delivery window with risk-averse suppliers: A CVaR optimization approach," International Journal of Production Economics, Elsevier, vol. 232(C).
    8. Jingliu Xu & Zhimei Wang & Shangjun Yao & Jiarong Xue, 2022. "Train Operations Organization in High-Speed Railway Station Considering Variable Configuration," Sustainability, MDPI, vol. 14(4), pages 1-17, February.
    9. Alberto Caprara & Laura Galli & Sebastian Stiller & Paolo Toth, 2014. "Delay-Robust Event Scheduling," Operations Research, INFORMS, vol. 62(2), pages 274-283, April.
    10. Kleijnen, J.P.C., 1977. "Operations research and computers," Other publications TiSEM a32ddec4-cafb-4dfa-93f6-6, Tilburg University, School of Economics and Management.
    11. Chen, Shih-Hsin & Chen, Min-Chih, 2013. "Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems," International Journal of Production Economics, Elsevier, vol. 141(1), pages 24-33.
    12. Yin, Yunqiang & Cheng, Shuenn-Ren & Cheng, T.C.E. & Wang, Du-Juan & Wu, Chin-Chia, 2016. "Just-in-time scheduling with two competing agents on unrelated parallel machines," Omega, Elsevier, vol. 63(C), pages 41-47.
    13. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    14. Dujuan Wang & Yunqiang Yin & T.C.E. Cheng, 2017. "A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 41-63, February.
    15. Yang, Dar-Li & Lai, Chien-Jung & Yang, Suh-Jenq, 2014. "Scheduling problems with multiple due windows assignment and controllable processing times on a single machine," International Journal of Production Economics, Elsevier, vol. 150(C), pages 96-103.
    16. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    17. Jaw‐Yeh Chen & Sheng‐Fuu Lin, 2002. "Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(8), pages 760-780, December.
    18. Lu, Gongyuan & Ning, Jia & Liu, Xiaobo & Nie, Yu (Marco), 2022. "Train platforming and rescheduling with flexible interlocking mechanisms: An aggregate approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    19. Rajnish Kumar & Goutam Sen & Samarjit Kar & Manoj Kumar Tiwari, 2018. "Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach," Interfaces, INFORMS, vol. 48(6), pages 510-528, November.
    20. Sels, P. & Dewilde, T. & Cattrysse, D. & Vansteenwegen, P., 2016. "Reducing the passenger travel time in practice by the automated construction of a robust railway timetable," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 124-156.

    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:57:y:2015:i:pb:p:157-175. 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.