IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v10y2018i11p4120-d181749.html
   My bibliography  Save this article

Genetic Algorithm for Optimizing Routing Design and Fleet Allocation of Freeway Service Overlapping Patrol

Author

Listed:
  • Xiuqiao Sun

    (School of Transportation Science and Engineering, Harbin Institute of Technology, Harbin 150001, China)

  • Jian Wang

    (School of Management, Harbin Institute of Technology, Harbin 150001, China)

  • Weitiao Wu

    (School of Civil and Transportation Engineering, South China University of Technology, Guangzhou 510641, China)

  • Wenjia Liu

    (School of Management, Harbin Institute of Technology, Harbin 150001, China)

Abstract

The freeway service patrol problem involves patrol routing design and fleet allocation on freeways that would help transportation agency decision-makers when developing a freeway service patrols program and/or altering existing route coverage and fleet allocation. Based on the actual patrol process, our model presents an overlapping patrol model and addresses patrol routing design and fleet allocation in a single integrated model. The objective is to minimize the overall average incident response time. Two strategies—overlapping patrol and non-overlapping patrol—are compared in our paper. Matrix encoding is applied in the genetic algorithm (GA), and to maintain population diversity and avoid premature convergence, a niche strategy is incorporated into the traditional genetic algorithm. Meanwhile, an elitist strategy is employed to speed up the convergence. Using numerical experiments conducted based on data from the Sioux Falls network, we clearly show that: overlapping patrol strategy is superior to non-overlapping patrol strategy; the GA outperforms the simulated annealing (SA) algorithm; and the computational efficiency can be improved when LINGO software is used to solve the problem of fleet allocation.

Suggested Citation

  • Xiuqiao Sun & Jian Wang & Weitiao Wu & Wenjia Liu, 2018. "Genetic Algorithm for Optimizing Routing Design and Fleet Allocation of Freeway Service Overlapping Patrol," Sustainability, MDPI, vol. 10(11), pages 1-15, November.
    • Handle: RePEc:gam:jsusta:v:10:y:2018:i:11:p:4120-:d:181749
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/10/11/4120/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/10/11/4120/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sun, Xiuqiao & Wang, Jian, 2018. "Routing design and fleet allocation optimization of freeway service patrol: Improved results using genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 205-216.
    2. Dewil, R. & Vansteenwegen, P. & Cattrysse, D. & Van Oudheusden, D., 2015. "A minimum cost network flow model for the maximum covering and patrol routing problem," European Journal of Operational Research, Elsevier, vol. 247(1), pages 27-36.
    3. Yafeng Yin, 2008. "A Scenario-based Model for Fleet Allocation of Freeway Service Patrols," Networks and Spatial Economics, Springer, vol. 8(4), pages 407-417, December.
    4. Yafeng Yin, 2006. "Optimal Fleet Allocation of Freeway Service Patrols," Networks and Spatial Economics, Springer, vol. 6(3), pages 221-234, September.
    5. Chatterjee, Sangit & Carrera, Cecilia & Lynch, Lucy A., 1996. "Genetic algorithms and traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 93(3), pages 490-510, September.
    6. Keskin, Burcu B. & Li, Shirley (Rong) & Steil, Dana & Spiller, Sarah, 2012. "Analysis of an integrated maximum covering and patrol routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 215-232.
    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. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    2. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    3. Chen, Xinyuan & Wu, Shining & Liu, Yannick & Wu, Weiwei & Wang, Shuaian, 2022. "A patrol routing problem for maritime Crime-Fighting," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    4. Freeman, Nickolas K. & Keskin, Burcu B. & Çapar, İbrahim, 2018. "Attractive orienteering problem with proximity and timing interactions," European Journal of Operational Research, Elsevier, vol. 266(1), pages 354-370.
    5. Kaan Ozbay & Cem Iyigun & Melike Baykal-Gursoy & Weihua Xiao, 2013. "Probabilistic programming models for traffic incident management operations planning," Annals of Operations Research, Springer, vol. 203(1), pages 389-406, March.
    6. Yuchen Luo & Bruce Golden & Rui Zhang, 2023. "The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1286-1307, November.
    7. Sukanya Samanta & Goutam Sen & Soumya Kanti Ghosh, 2022. "A literature review on police patrolling problems," Annals of Operations Research, Springer, vol. 316(2), pages 1063-1106, September.
    8. Timothy J. Surendonk & Paul A. Chircop, 2020. "On the computational complexity of the patrol boat scheduling problem with complete coverage," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 289-299, June.
    9. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    10. Tang, Jinjun & Yang, Yifan & Qi, Yong, 2018. "A hybrid algorithm for Urban transit schedule optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 745-755.
    11. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    12. Tschernutter, Daniel & Feuerriegel, Stefan, 2025. "Data-driven dynamic police patrolling: An efficient Monte Carlo tree search," European Journal of Operational Research, Elsevier, vol. 321(1), pages 177-191.
    13. Carter, Arthur E. & Ragsdale, Cliff T., 2006. "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 175(1), pages 246-257, November.
    14. Zhou, Li & Yang, Xin & Wang, Huan & Wu, Jianjun & Chen, Lei & Yin, Haodong & Qu, Yunchao, 2020. "A robust train timetable optimization approach for reducing the number of waiting passengers in metro systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
    15. Stefano Starita & M. Paola Scaparra & Jesse R. O’Hanley, 2017. "A dynamic model for road protection against flooding," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 74-88, January.
    16. Gustavo Erick Anaya Fuentes & Eva Selene Hernández Gress & Juan Carlos Seck Tuoh Mora & Joselito Medina Marín, 2018. "Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-20, August.
    17. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    18. Marina Baltar & Victor Abreu & Glaydston Ribeiro & Laura Bahiense, 2021. "Multi-objective model for the problem of locating tows for incident servicing on expressways," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 58-77, April.
    19. Dewil, R. & Vansteenwegen, P. & Cattrysse, D. & Van Oudheusden, D., 2015. "A minimum cost network flow model for the maximum covering and patrol routing problem," European Journal of Operational Research, Elsevier, vol. 247(1), pages 27-36.
    20. Arlen Guar�n & Andr�s Ram�rez Hassan & Juan G. Villegas, 2015. "Fast reaction police units in Medell�n: A budget-constrained maximal homicide covering location approach," Borradores de Economia 13874, Banco de la Republica.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:gam:jsusta:v:10:y:2018:i:11:p:4120-:d:181749. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.