skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

Multiobjective Multidepot Capacitated Arc Routing Optimization Based on Hybrid Algorithm

Journal of advanced transportation, 2022-06, Vol.2022, p.1-13 [Peer Reviewed Journal]

Copyright © 2022 Liang Wu. ;COPYRIGHT 2022 Hindawi Limited ;Copyright © 2022 Liang Wu. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 0197-6729 ;EISSN: 2042-3195 ;DOI: 10.1155/2022/1846681

Full text available

Citations Cited by
  • Title:
    Multiobjective Multidepot Capacitated Arc Routing Optimization Based on Hybrid Algorithm
  • Author: Wu, Liang
  • Yuan, Zhenzhou ; Zhenzhou Yuan
  • Subjects: Algorithms ; Carbon ; Chromosomes ; Cluster analysis ; Clustering ; Dijkstra's algorithm ; Genetic algorithms ; Integer programming ; Mathematical models ; Mathematical optimization ; Neighborhoods ; Optimization ; Roads ; Traffic ; Vehicles
  • Is Part Of: Journal of advanced transportation, 2022-06, Vol.2022, p.1-13
  • Description: The multidepot capacitated arc routing problem (CARP) is investigated with the hybrid optimization algorithm of the Dijkstra algorithm and genetic algorithm. The complex multidepot CARP is transformed into multiple single depot CARP by systematic clustering analysis. After completing the system clustering, the Dijkstra algorithm is used to adjust the boundary arc locally and merge it to a reasonable depot, while in the genetic algorithm, the structure of the chromosome is reset to use the path as the way of real coding, and the elite selection is used to decode to obtain the optimal path optimization scheme. Finally, Lanzhou road network data as experimental data, through Matlab to achieve the practicability of the algorithm in sprinkler applications. The results show that the improved genetic algorithm can successfully solve the multi-segment CARP with a certain road network scale, ensuring the correctness and feasibility of the algorithm. In addition, the efficiency of the algorithm in the later iteration is basically controlled at about 0.5 seconds, indicating that the efficiency of the algorithm is worth identifying.
  • Publisher: London: Hindawi
  • Language: English
  • Identifier: ISSN: 0197-6729
    EISSN: 2042-3195
    DOI: 10.1155/2022/1846681
  • Source: ProQuest Central
    DOAJ Directory of Open Access Journals
Back to results list
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY (84-028) 37 755 057 Feedback
19 Nguyen Huu Tho St. Dist.7, HCM thuvien@tdtu.edu.vn

Copyright © 2017 INSPIRE LIBRARY - TON DUC THANG UNIVERSITY

Searching Remote Databases, Please Wait