Route Optimization for Bus Dispatching Based on Genetic Algorithm-Ant Colony Algorithm

On account of route optimization of bus dispatching, it is proposed to use genetic ant algorithm (GAA) for solution. A mathematic model for multi-objective bus route optimization and selection under limited conditions is developed, introducing the evolutionary process of genetic variation to improve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2009 International Conference on Information Management, Innovation Management and Industrial Engineering Jg. 4; S. 18 - 21
Hauptverfasser: Minan Tang, Enen Ren, Chunyan Zhao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.12.2009
Schlagworte:
ISBN:0769538762, 9780769538761
ISSN:2155-1456
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract On account of route optimization of bus dispatching, it is proposed to use genetic ant algorithm (GAA) for solution. A mathematic model for multi-objective bus route optimization and selection under limited conditions is developed, introducing the evolutionary process of genetic variation to improve the optimization of ant colony algorithm and also the optimal decision updating and identification in the course of random search of colony to improve the optimization performance and speed up convergence, thus allowing the algorithm with randomicity and determinacy. As a result, the solving steps of the algorithm are given in details. Through comparison of the example results, the algorithm is proved to be feasible and practical for route optimization of bus dispatching.
AbstractList On account of route optimization of bus dispatching, it is proposed to use genetic ant algorithm (GAA) for solution. A mathematic model for multi-objective bus route optimization and selection under limited conditions is developed, introducing the evolutionary process of genetic variation to improve the optimization of ant colony algorithm and also the optimal decision updating and identification in the course of random search of colony to improve the optimization performance and speed up convergence, thus allowing the algorithm with randomicity and determinacy. As a result, the solving steps of the algorithm are given in details. Through comparison of the example results, the algorithm is proved to be feasible and practical for route optimization of bus dispatching.
Author Enen Ren
Chunyan Zhao
Minan Tang
Author_xml – sequence: 1
  surname: Minan Tang
  fullname: Minan Tang
  organization: Mechatron. T&R Inst., Lanzhou Jiaotong Univ., Lanzhou, China
– sequence: 2
  surname: Enen Ren
  fullname: Enen Ren
  organization: Mechatron. T&R Inst., Lanzhou Jiaotong Univ., Lanzhou, China
– sequence: 3
  surname: Chunyan Zhao
  fullname: Chunyan Zhao
  organization: Mechatron. T&R Inst., Lanzhou Jiaotong Univ., Lanzhou, China
BookMark eNpFT01LwzAYDriB6_TqxUv-QGvSt3nTHLeqszAYiHodaZdskS0pbXaYv96KgqfnkweehEx88IaQO84yzpl6qKu6rrOcMZUViFckYRKVgFJiPiGznAuR8kLglCQ_HQUCJLsmyTB8MoaAwGbk4zWco6GbLrqT-9LRBU9t6OnyPNBHN3Q6tgfn93SpB7OjY7gy3kTX0sVxH3oXD6d04SOtwjH4y795Q6ZWHwdz-4dz8v789Fa9pOvNqq4W69RxKWJqdWGFKDVHOxKGrQbZlEVpTaMKocYDO9CYt7Djo-amsDk2ucRGK94CSJiT-99dZ4zZdr076f6yFYBKcgnfkmlToQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICIII.2009.466
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EndPage 21
ExternalDocumentID 5369717
Genre orig-research
GroupedDBID 29P
6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-fa4f558a16f4f506ca37b848feb9459155d3a62c3d19451e4f26b276ba91c3373
IEDL.DBID RIE
ISBN 0769538762
9780769538761
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000275942400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2155-1456
IngestDate Wed Aug 27 02:47:43 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2009935370
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-fa4f558a16f4f506ca37b848feb9459155d3a62c3d19451e4f26b276ba91c3373
PageCount 4
ParticipantIDs ieee_primary_5369717
PublicationCentury 2000
PublicationDate 2009-Dec.
PublicationDateYYYYMMDD 2009-12-01
PublicationDate_xml – month: 12
  year: 2009
  text: 2009-Dec.
PublicationDecade 2000
PublicationTitle 2009 International Conference on Information Management, Innovation Management and Industrial Engineering
PublicationTitleAbbrev ICIII
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0063630
ssj0001967528
Score 1.4494222
Snippet On account of route optimization of bus dispatching, it is proposed to use genetic ant algorithm (GAA) for solution. A mathematic model for multi-objective bus...
SourceID ieee
SourceType Publisher
StartPage 18
SubjectTerms Ant colony optimization
bus dispatching
Cities and towns
Dispatching
genetic algorithm-ant colony algorithm
Genetic algorithms
Industrial engineering
Information management
Innovation management
Mathematical model
Mathematics
Mechatronics
multi-objective optimization
Title Route Optimization for Bus Dispatching Based on Genetic Algorithm-Ant Colony Algorithm
URI https://ieeexplore.ieee.org/document/5369717
Volume 4
WOSCitedRecordID wos000275942400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELXaigEWPlrEtzwwEhrHjhOPbaEiEpQOUHWrHMeGSDRFbYrEv-echLQDC5vPUaTEst-d7bv3ELqGCFSoxAD6SSthBi4CcNCETsw014GCeV1w6U0eg9EonE7FuIFu6loYrXWRfKZvbbO4y08Wam2Pyro-5QK2H03UDAJe1mptzlMEhL5efYPAKS90RsCj-Q6BKKHcsgtY37D8K-adX5tUbI7EFd1oEEVRyWPJLHXiluZK4XKG-__72APU2dTu4XHtlQ5RQ2dHaG-LdhCsp5qrddVGE5sUpPEzYMe8KsrEEMni_nqF71IAnLxIt8R98HcJhoeWqRpexb2Pt8Uyzd_nTi_L8QBQNPvedHbQ6_D-ZfDgVGoLTgohRO4YyYzvh5JwAw2XK0mDOGSh0bFgvqWRT6jknqIJAZtoZjweewGPpSCK0oAeo1a2yPQJwtRzTUwVkUwLRqSWPvyzsDpYnAZuwk5R247X7LMk1JhVQ3X2d_c52vUq0QaXXKBWvlzrS7SjvvJ0tbwqZsEPHzCrLw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4QTdSLP9D42x48OlnXrluPgBIWATkg4Ua6rdUlMgwME_97X8ccHLx462uzZGu67722730fQncQgYoo1oB-0kiYgYsAHNS-FTLFlRfBus659EZdr9_3x2MxqKD7shZGKZUnn6kH08zv8uNZtDRHZXWXcgHbjy20bZSzimqt9YmKgODXKe8QOOW50gj4NNciECesNu0C_nAAgIJ759cmBZ8jsUU9aAVBsGKyZIY8cUN1JXc67YP_ve4hOllX7-FB6ZeOUEWlx2h_g3gQrF7J1rqooZFJC1L4BdBjWpRlYohlcXO5wI8JQE6WJ1ziJni8GMOg4aqGR3Hj4202T7L3qdVIM9wCHE2_150n6LX9NGx1rEJvwUogiMgsLZl2XV8SrqFh80hSL_SZr1UomGuI5GMquRPRmIBNFNMODx2Ph1KQiFKPnqJqOkvVGcLUsXVIIyKZEoxIJV34ZmGUsDj17Jido5qZr8nnilJjUkzVxd_dt2i3M-x1J92g_3yJ9pxCwsEmV6iazZfqGu1EX1mymN_kK-IHP6CueA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+International+Conference+on+Information+Management%2C+Innovation+Management+and+Industrial+Engineering&rft.atitle=Route+Optimization+for+Bus+Dispatching+Based+on+Genetic+Algorithm-Ant+Colony+Algorithm&rft.au=Minan+Tang&rft.au=Enen+Ren&rft.au=Chunyan+Zhao&rft.date=2009-12-01&rft.pub=IEEE&rft.isbn=9780769538761&rft.issn=2155-1456&rft.volume=4&rft.spage=18&rft.epage=21&rft_id=info:doi/10.1109%2FICIII.2009.466&rft.externalDocID=5369717
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2155-1456&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2155-1456&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2155-1456&client=summon