IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v322y2023i1d10.1007_s10479-022-05029-z.html
   My bibliography  Save this article

Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers’ collaboration networks

Author

Listed:
  • Aghdas Badiee

    (Iran University of Science and Technology)

  • Hamed Kalantari

    (Iran University of Science and Technology)

  • Chefi Triki

    (University of Kent)

Abstract

One of the key issues in transportation systems is allocating shipping orders to the most appropriate drivers in the shortest time and with the maximum profit. Many studies were carried out in the transportation service procurement process for allocating orders, but none of them considered driver-to-driver interactions and applied information diffusion concepts as a framework to maximize the profit, due to the lack of a framework to model the interactions. In this paper, we present a weighted drivers’ collaboration network to form the interactions. To predict the behavior of drivers, a new community detection algorithm is developed to extract communities and their leaders in terms of the speed and power of receiving and diffusing shipping orders. In addition, we present a profit maximization model that utilizes the information diffusion power of community leaders. The results show the model is able to allocate shipping orders to the most suitable drivers in the shortest possible time and with the highest profit. To demonstrate the performance of the developed algorithm, we present a numerical example. Finally, a case study is applied to solve the optimization problem. The results show that the optimized behavior of companies in allocating orders to drivers is based on their risk level, reputation, and the average number of their customers.

Suggested Citation

  • Aghdas Badiee & Hamed Kalantari & Chefi Triki, 2023. "Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers’ collaboration networks," Annals of Operations Research, Springer, vol. 322(1), pages 345-383, March.
    • Handle: RePEc:spr:annopr:v:322:y:2023:i:1:d:10.1007_s10479-022-05029-z
    DOI: 10.1007/s10479-022-05029-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05029-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-05029-z?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. M Rekik & S Mellouli, 2012. "Reputation-based winner determination problem for combinatorial transportation procurement auctions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(10), pages 1400-1409, October.
    2. Triki, Chefi & Oprea, Simona & Beraldi, Patriza & Crainic, Teodor Gabriel, 2014. "The stochastic bid generation problem in combinatorial transportation auctions," European Journal of Operational Research, Elsevier, vol. 236(3), pages 991-999.
    3. Lim, Andrew & Qin, Hu & Xu, Zhou, 2012. "The freight allocation problem with lane cost balancing constraint," European Journal of Operational Research, Elsevier, vol. 217(1), pages 26-35.
    4. Lee, Chi-Guhn & Kwon, Roy H. & Ma, Zhong, 2007. "A carrier's optimal bid generation problem in combinatorial auctions for transportation procurement," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 173-191, March.
    5. Zhang, Bo & Yao, Tao & Friesz, Terry L. & Sun, Yuqi, 2015. "A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 16-31.
    6. Bo Zhang & Hongwei Ding & Hongbo Li & Wei Wang & Tao Yao, 2014. "A Sampling-Based Stochastic Winner Determination Model for Truckload Service Procurement," Networks and Spatial Economics, Springer, vol. 14(2), pages 159-181, June.
    7. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    8. Yang, Fang & Huang, Yao-Huei & Li, Jun, 2019. "Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    9. R. Jothi Basu & Nachiappan Subramanian & Naoufel Cheikhrouhou, 2015. "Review of Full Truckload Transportation Service Procurement," Transport Reviews, Taylor & Francis Journals, vol. 35(5), pages 599-621, September.
    10. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    11. Andrew Lim & Fan Wang & Zhou Xu, 2006. "A Transportation Problem with Minimum Quantity Commitment," Transportation Science, INFORMS, vol. 40(1), pages 117-129, February.
    12. Ma, Zhong & Kwon, Roy H. & Lee, Chi-Guhn, 2010. "A stochastic programming winner determination model for truckload procurement under shipment uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(1), pages 49-60, January.
    13. Yang, Fang & Huang, Yao-Huei, 2020. "Linearization technique with superior expressions for centralized planning problem with discount policy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 542(C).
    14. Hu, Qian & Zhang, Zhenzhen & Lim, Andrew, 2016. "Transportation service procurement problem with transit time," Transportation Research Part B: Methodological, Elsevier, vol. 86(C), pages 19-36.
    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. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    2. Fang Yang & Yao-Huei Huang, 2021. "An optimization approach for winner determination problem considering transportation cost discounts," Journal of Global Optimization, Springer, vol. 80(3), pages 711-728, July.
    3. Dellbrügge, Marius & Brilka, Tim & Kreuz, Felix & Clausen, Uwe, 2022. "Auction design in strategic freight procurement," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Jahn, Carlos & Blecker, Thorsten & Ringle, Christian M. (ed.), Changing Tides: The New Role of Resilience and Sustainability in Logistics and Supply Chain Management – Innovative Approaches for the Shift to a New , volume 33, pages 295-325, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    4. Izdebski, Mariusz & Jacyna-Gołda, Ilona & Gołda, Paweł, 2022. "Minimisation of the probability of serious road accidents in the transport of dangerous goods," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    5. Yang, Fang & Huang, Yao-Huei, 2020. "Linearization technique with superior expressions for centralized planning problem with discount policy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 542(C).
    6. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2021. "Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 204-229.
    7. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2015. "Demand clustering in freight logistics networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 36-51.
    8. Zhang, Juliang & Xiang, Jie & Cheng, T.C. Edwin & Hua, Guowei & Chen, Cheng, 2019. "An optimal efficient multi-attribute auction for transportation procurement with carriers having multi-unit supplies," Omega, Elsevier, vol. 83(C), pages 249-260.
    9. Remli, Nabila & Amrouss, Amine & El Hallaoui, Issmail & Rekik, Monia, 2019. "A robust optimization approach for the winner determination problem with uncertainty on shipment volumes and carriers’ capacity," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 127-148.
    10. Zhang, Li-Hao & Liu, Chunxiao & Zhang, Cheng & Wang, Shanshan, 2023. "Upstream encroachment and downstream outsourcing in competing shipping supply chains," International Journal of Production Economics, Elsevier, vol. 255(C).
    11. R. Jothi Basu & Nachiappan Subramanian & Angappa Gunasekaran & P. L. K. Palaniappan, 2017. "Influence of non-price and environmental sustainability factors on truckload procurement process," Annals of Operations Research, Springer, vol. 250(2), pages 363-388, March.
    12. Zhang, Bo & Yao, Tao & Friesz, Terry L. & Sun, Yuqi, 2015. "A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 16-31.
    13. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    14. Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
    15. Sun, Jiasen & Li, Guo & Xu, Su Xiu & Dai, Wei, 2019. "Intermodal transportation service procurement with transaction costs under belt and road initiative," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 31-48.
    16. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
    17. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    18. Jothi Basu, R. & Bai, Ruibin & Palaniappan, PL.K., 2015. "A strategic approach to improve sustainability in transportation service procurement," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 74(C), pages 152-168.
    19. Wang, Junjin & Liu, Jiaguo & Zhang, Xin, 2020. "Service purchasing and market-entry problems in a shipping supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    20. Yang, Fang & Huang, Yao-Huei & Li, Jun, 2019. "Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).

    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:spr:annopr:v:322:y:2023:i:1:d:10.1007_s10479-022-05029-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.