IDEAS home Printed from https://ideas.repec.org/a/wly/transj/v60y2021i4p339-366.html

Routing Optimization for Road Administration Vehicles with Consideration of Overloaded Truck Detour Behavior on Rural Highways

Author

Listed:
  • Jinyu Jiang
  • Zhongzhen Yang

Abstract

In response to the increasingly frequent detour behavior of overloaded trucks attempting to avoid overload inspection and punishment, this article develops a bilevel programming model to optimize the routes of road administration vehicles by simulating the capture and anticapture interaction between administration vehicles and overloaded trucks. The upper‐level model determines the optimal patrol routes of administration vehicles to maximize the number of overloaded trucks that can be captured. The lower‐level model deduces the detour routes of overloaded trucks based on their circumvention behavior relative to administration vehicles. To solve the bilevel programming model, this article proposes a heuristic algorithm combining the ant colony algorithm and the labeling algorithm. To validate the proposed model and algorithm, this article uses actual rural highway data for Guiyang, China. The result proves the feasibility and superiority of the proposed programming model and algorithm. Compared to traditional overload management techniques, considering the detour behavior of overloaded trucks in optimizing the routing of road administration vehicles improves the effectiveness of overload management by up to 1.65 times.

Suggested Citation

  • Jinyu Jiang & Zhongzhen Yang, 2021. "Routing Optimization for Road Administration Vehicles with Consideration of Overloaded Truck Detour Behavior on Rural Highways," Transportation Journal, John Wiley & Sons, vol. 60(4), pages 339-366, October.
    • Handle: RePEc:wly:transj:v:60:y:2021:i:4:p:339-366
    DOI: 10.5325/transportationj.60.4.0339
    as

    Download full text from publisher

    File URL: https://doi.org/10.5325/transportationj.60.4.0339
    Download Restriction: no
    File URL: https://libkey.io/10.5325/transportationj.60.4.0339?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
    ---><---

    References listed on IDEAS

    as
    1. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    2. Yunzhu He & Zhongzhen Yang, 2018. "Parcel Delivery by Collaborative Use of Truck Fleets and Bus‐Transit Vehicles," Transportation Journal, John Wiley & Sons, vol. 57(4), pages 399-428, November.
    3. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    4. Huang, Shan-Huen & Lin, Pei-Chun, 2010. "A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 598-611, September.
    5. Sai Shao & Wei Guan & Bin Ran & Zhengbing He & Jun Bi, 2017. "Electric Vehicle Routing Problem with Charging Time and Variable Travel Time," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-13, January.
    6. Ting, Ching-Jung & Chen, Chia-Ho, 2013. "A multiple ant colony optimization algorithm for the capacitated location routing problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 34-44.
    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. Zhen Wang & Jiazhen Huo & Jasmine Siu Lee Lam, 2025. "The vehicle routing programming of municipal solid waste collection under cognitive uncertainty," Transportation Journal, John Wiley & Sons, vol. 64(1), January.

    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. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    2. Niakan, Farzad & Rahimi, Mohammad, 2015. "A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 80(C), pages 74-94.
    3. Zhou, Yu & Meng, Qiang & Ong, Ghim Ping, 2022. "Electric Bus Charging Scheduling for a Single Public Transport Route Considering Nonlinear Charging Profile and Battery Degradation Effect," Transportation Research Part B: Methodological, Elsevier, vol. 159(C), pages 49-75.
    4. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    5. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    6. Zhen Wang & Jiazhen Huo & Jasmine Siu Lee Lam, 2025. "The vehicle routing programming of municipal solid waste collection under cognitive uncertainty," Transportation Journal, John Wiley & Sons, vol. 64(1), January.
    7. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency Relief Routing Models for Injured Victims Considering Equity and Priority," Post-Print hal-02879681, HAL.
    8. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    9. Saha, Subrata & Chatterjee, Debajyoti & Sarkar, Biswajit, 2021. "The ramification of dynamic investment on the promotion and preservation technology for inventory management through a modified flower pollination algorithm," Journal of Retailing and Consumer Services, Elsevier, vol. 58(C).
    10. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    11. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.
    12. Zhang, Ruijuan & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    13. Mauricianot Randriamihaja & Felana Angella Ihantamalala & Feno H. Rafenoarimalala & Karen E Finnegan & Luc Rakotonirina & Benedicte Razafinjato & Matthew H. Bonds & Michelle V. Evans & Andres Garchito, 2024. "Combining OpenStreetMap mapping and route optimization algorithms to inform the delivery of community health interventions at the last mile," PLOS Digital Health, Public Library of Science, vol. 3(11), pages 1-21, November.
    14. Xue Han & Peixin Zhao & Qingchun Meng & Shengnan Yin & Di Wan, 2020. "Optimal scheduling of airport ferry vehicles based on capacity network," Annals of Operations Research, Springer, vol. 295(1), pages 163-182, December.
    15. Fagui Liu & Lvshengbiao Wang & Mengke Gui & Yang Zhang & Yulin Lan & Chengqi Lai & Boyuan Zhu, 2023. "A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window," Journal of Heuristics, Springer, vol. 29(2), pages 269-311, June.
    16. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    17. Zühal Kartal & Mohan Krishnamoorthy & Andreas T. Ernst, 2019. "Heuristic algorithms for the single allocation p-hub center problem with routing considerations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 99-145, March.
    18. Mariusz Izdebski & Marianna Jacyna, 2021. "An Efficient Hybrid Algorithm for Energy Expenditure Estimation for Electric Vehicles in Urban Service Enterprises," Energies, MDPI, vol. 14(7), pages 1-23, April.
    19. Shima Azizi & Özge Aygül & Brenton Faber & Sharon Johnson & Renata Konrad & Andrew C. Trapp, 2023. "Select, route and schedule: optimizing community paramedicine service delivery with mandatory visits and patient prioritization," Health Care Management Science, Springer, vol. 26(4), pages 719-746, December.
    20. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.

    More about this item

    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:wly:transj:v:60:y:2021:i:4:p:339-366. 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: Wiley Content Delivery (email available below). General contact details of provider: .

    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.