IDEAS home Printed from https://ideas.repec.org/a/ibn/ijbmjn/v15y2021i5p147.html
   My bibliography  Save this article

Research on Online Car-Hailing Scheduling Problem Based on Resource Allocation

Author

Listed:
  • Rongyuan Chen
  • Geng Qian
  • Zhixiong He
  • Yuanxing Shi
  • Minmin Hu

Abstract

In recent years, with the rapid development of Internet technology, various online car-hailing platforms (Uber, DiDi, CaoCao, etc.) have swept the world. The convenient and fast information exchange of "Internet +" greatly alleviates the information obstruction caused by the space-time deviation between passengers and drivers in the traditional taxi system, and becomes a powerful tool to improve the efficiency of the taxi market. In order to improve the utilization of resource allocation, this paper designs a model based on the vehicle's empty driving distance, and uses the Hungarian solution to obtain the shortest vehicle's empty driving distance to optimize the resource allocation problem. Then, according to the position coordinates and the travel route of the vehicle, the vehicle information of eleven times a day is calculated, and it is found that the result obtained by the algorithm is ideal；At the same time, we design the subsidy pricing model and its scheme. Finally, we make a systematic summary of the research content of this paper and look forward to the possible research directions in the future.

Suggested Citation

  • Rongyuan Chen & Geng Qian & Zhixiong He & Yuanxing Shi & Minmin Hu, 2021. "Research on Online Car-Hailing Scheduling Problem Based on Resource Allocation," International Journal of Business and Management, Canadian Center of Science and Education, vol. 15(5), pages 147-147, July.
    • Handle: RePEc:ibn:ijbmjn:v:15:y:2021:i:5:p:147
    as

    Download full text from publisher

    File URL: http://www.ccsenet.org/journal/index.php/ijbm/article/download/0/0/42526/44369
    Download Restriction: no
    File URL: http://www.ccsenet.org/journal/index.php/ijbm/article/view/0/42526
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    2. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.
    Full references (including those not matched with items on IDEAS)

    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. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    2. Masoud, Neda & Jayakrishnan, R., 2017. "A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 218-236.
    3. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    4. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    5. Tafreshian, Amirmahdi & Masoud, Neda, 2022. "A truthful subsidy scheme for a peer-to-peer ridesharing market with incomplete information," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 130-161.
    6. Chen, Shijie & Rahman, Md Hishamur & Marković, Nikola & Siddiqui, Muhammad Imran Younus & Mohebbi, Matthew & Sun, Yanshuo, 2024. "Schedule negotiation with ADA paratransit riders under value of time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    7. Benavent, Enrique & Corberán, Ángel & Laganà, Demetrio & Vocaturo, Francesca, 2019. "The periodic rural postman problem with irregular services on mixed graphs," European Journal of Operational Research, Elsevier, vol. 276(3), pages 826-839.
    8. Horner, Hannah & Pazour, Jennifer & Mitchell, John E., 2021. "Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    9. Sapan Tiwari & Neema Nassir & Patricia Sauri Lavieri, 2024. "Review and Classification of Objectives in Dynamic Dial-a-Ride Systems: A Triple Bottom Line Approach of Sustainability," Sustainability, MDPI, vol. 16(13), pages 1-30, July.
    10. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Wu, Weitiao & Liu, Ronghui & Jin, Wenzhou, 2016. "Designing robust schedule coordination scheme for transit networks with safety control margins," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 495-519.
    12. Zhong, Lin & Zhang, Kenan & (Marco) Nie, Yu & Xu, Jiuping, 2020. "Dynamic carpool in morning commute: Role of high-occupancy-vehicle (HOV) and high-occupancy-toll (HOT) lanes," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 98-119.
    13. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    14. Nourinejad, Mehdi & Ramezani, Mohsen, 2020. "Ride-Sourcing modeling and pricing in non-equilibrium two-sided markets," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 340-357.
    15. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    16. Bian, Zheyong & Liu, Xiang & Bai, Yun, 2020. "Mechanism design for on-demand first-mile ridesharing," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 77-117.
    17. Sunghi An & Daisik Nam & R. Jayakrishnan & Soongbong Lee & Michael G. McNally, 2021. "A Study of the Factors Affecting Multimodal Ridesharing with Choice-Based Conjoint Analysis," Sustainability, MDPI, vol. 13(20), pages 1-14, October.
    18. Yu, Xiaojuan & van den Berg, Vincent A.C. & Verhoef, Erik T., 2019. "Carpooling with heterogeneous users in the bottleneck model," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 178-200.
    19. Lei, Chao & Jiang, Zhoutong & Ouyang, Yanfeng, 2020. "Path-based dynamic pricing for vehicle allocation in ridesharing systems with fully compliant drivers," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 60-75.
    20. Fu, Yulan & Wang, Chenlan & Liu, Tian-Liang & Huang, Hai-Jun, 2021. "Parking management in the morning commute problem with ridesharing," Research in Transportation Economics, Elsevier, vol. 90(C).

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    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:ibn:ijbmjn:v:15:y:2021:i:5:p:147. 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    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.