IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v161y2022ics1366554522000722.html
   My bibliography  Save this article

Data-driven optimization: A flexible route pricing method for Non-Truck Operating Common Carriers

Author

Listed:
  • Chen, Xiaojing
  • Li, Feng
  • Jiang, Jiehui
  • Jia, Bin
  • Lim, Andrew
  • Wu, Jianjun

Abstract

This paper investigates a data-driven flexible pricing method for Non-Truck Operating Common Carriers (NTOCCs). Different route price intervals are provided based on the data cleaning, mining and clustering of an NTOCC. Furthermore, an innovative data-driven flexible pricing method based on a two-category (category-I and category-II) phased payment strategy is presented to systematically improve the empirical pricing process between NTOCCs and freight carriers. The method includes grabbing order, planning, bargaining, transportation and evaluation stages. First, category-I and category-II (pricing) strategies are proposed for the profit management of NTOCCs. The application of the two strategies is identified by a data-driven route price prediction model. Second, considering the loss risk of NTOCCs, the loss deposit (pre-penalty) is introduced for unpunctual cargo delivery in every category pricing strategy. Moreover, every category strategy includes two phases (phase-I and phase-II). In phase-I (planning stage), the paired pricing references are explored based on the predicted route price, bi-level and interval bi-level programming models; loss deposit intervals are developed for planning bargaining references for NTOCCs. In phase-II (evaluation stage), the references for the loss deposit/phase-II payment are formulated by evaluating the unpunctual cargo delivery. Additionally, in the systematic research, numerical experiments show the necessity of new features’ formulation and the good performance of route price prediction, indicate that the historical data set can be matched with two strategies, and verify that the data-driven flexible pricing method can effectively contribute to the profit management of NTOCCs. Several managerial insights are presented to solve the unbalance development of NTOCCs in different provinces and the implementation difficulties of the innovative pricing method.

Suggested Citation

  • Chen, Xiaojing & Li, Feng & Jiang, Jiehui & Jia, Bin & Lim, Andrew & Wu, Jianjun, 2022. "Data-driven optimization: A flexible route pricing method for Non-Truck Operating Common Carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    • Handle: RePEc:eee:transe:v:161:y:2022:i:c:s1366554522000722
    DOI: 10.1016/j.tre.2022.102678
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554522000722
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2022.102678?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. Wayne F. Bialas & Mark H. Karwan, 1984. "Two-Level Linear Programming," Management Science, INFORMS, vol. 30(8), pages 1004-1020, August.
    2. R A Russell & T L Urban, 2008. "Vehicle routing with soft time windows and Erlang travel times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1220-1228, September.
    3. Liu, Weihua & Yan, Xiaoyu & Li, Xiang & Wei, Wanying, 2020. "The impacts of market size and data-driven marketing on the sales mode selection in an Internet platform based supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    4. Yu-Ang Du & Huihua Chen, 2021. "Research on the Route Pricing Optimization Model of the Car-Free Carrier Platform Based on the BP Neural Network Algorithm," Complexity, Hindawi, vol. 2021, pages 1-10, June.
    5. Xiao, Haohan & Xu, Meng & Yang, Hai, 2020. "Pricing strategies for shared parking management with double auction approach: Differential price vs. uniform price," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    6. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    7. Yu Zhang & Zhenzhen Zhang & Andrew Lim & Melvyn Sim, 2021. "Robust Data-Driven Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 69(2), pages 469-485, March.
    8. Ayşe Kocabıyıkoğlu & Ioana Popescu & Catalina Stefanescu, 2014. "Pricing and Revenue Management: The Value of Coordination," Management Science, INFORMS, vol. 60(3), pages 730-752, March.
    9. Christophe Croux & Catherine Dehon, 2010. "Influence functions of the Spearman and Kendall correlation measures," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 19(4), pages 497-515, November.
    10. Wang, Judith Y.T. & Ehrgott, Matthias, 2013. "Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 342-360.
    11. Xie, Litian & Olszewski, Piotr, 2011. "Modelling the effects of road pricing on traffic using ERP traffic data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(6), pages 512-522, July.
    12. Small, Kenneth A., 2001. "The Value of Pricing," University of California Transportation Center, Working Papers qt0rm449sx, University of California Transportation Center.
    13. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    14. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    15. Ma, Hong & Cheang, Brenda & Lim, Andrew & Zhang, Lei & Zhu, Yi, 2012. "An investigation into the vehicle routing problem with time windows and link capacity constraints," Omega, Elsevier, vol. 40(3), pages 336-347.
    16. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2001. "A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network," Transportation Science, INFORMS, vol. 35(4), pages 345-358, November.
    17. Ding, Xiaohui & Chen, Caihua & Li, Chongshou & Lim, Andrew, 2021. "Product demand estimation for vending machines using video surveillance data: A group-lasso method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    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. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    2. Yu, Bin & Shan, Wenxuan & Sheu, Jiuh-Biing & Diabat, Ali, 2022. "Branch-and-price for a combined order selection and distribution problem in online community group-buying of perishable products," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 341-373.
    3. Budnitzki, Alina, 2014. "Computation of the optimal tolls on the traffic network," European Journal of Operational Research, Elsevier, vol. 235(1), pages 247-251.
    4. Bo Zeng, 2020. "A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1128-1142, October.
    5. Sinha, Ankur & Malo, Pekka & Deb, Kalyanmoy, 2017. "Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping," European Journal of Operational Research, Elsevier, vol. 257(2), pages 395-411.
    6. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    7. Tan, Zhijia & Yang, Hai & Guo, Renyong, 2014. "Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 16-31.
    8. Chi Xie & Xing Wu & Stephen Boyles, 2019. "Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account," Annals of Operations Research, Springer, vol. 273(1), pages 279-310, February.
    9. Judith Y. T. Wang & Richard D. Connors, 2018. "Urban Growth, Transport Planning, Air Quality and Health: A Multi-Objective Spatial Analysis Framework for a Linear Monocentric City," Networks and Spatial Economics, Springer, vol. 18(4), pages 839-874, December.
    10. M. Rouhani, Omid, 2014. "Road pricing: An overview," MPRA Paper 59662, University Library of Munich, Germany.
    11. Yu Zhang & Zhenzhen Zhang & Andrew Lim & Melvyn Sim, 2021. "Robust Data-Driven Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 69(2), pages 469-485, March.
    12. Li, Hongqi & Wang, Feilong & Zhan, Zhuopeng, 2024. "Drone routing problem with swarm synchronization," European Journal of Operational Research, Elsevier, vol. 314(2), pages 477-495.
    13. Omid M. Rouhani, 2016. "Next Generations of Road Pricing: Social Welfare Enhancing," Sustainability, MDPI, vol. 8(3), pages 1-15, March.
    14. 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.
    15. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    16. Steimetz, Seiji S.C. & Brownstone, David, 2005. "Estimating commuters' "value of time" with noisy data: a multiple imputation approach," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 865-889, December.
    17. Bahram Alidaee & Haibo Wang & Lutfu S. Sua, 2023. "The Last-Mile Delivery of Heavy, Bulky, Oversized Products: Literature Review and Research Agenda," Logistics, MDPI, vol. 7(4), pages 1-16, December.
    18. Bhat, Chandra R. & Sardesai, Rupali, 2006. "The impact of stop-making and travel time reliability on commute mode choice," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 709-730, November.
    19. Kraus, Marvin, 2003. "A new look at the two-mode problem," Journal of Urban Economics, Elsevier, vol. 54(3), pages 511-530, November.
    20. Avinadav, Tal & Levy, Priel, 2023. "The effect of an uncertain commission rate on the decisions of a capital-constrained developer," Operations Research Perspectives, Elsevier, vol. 11(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:eee:transe:v:161:y:2022:i:c:s1366554522000722. 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/600244/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.