A hybrid enhanced artificial bee colony algorithm (HEABC) is proposed for solving the problem of bus network design. The algorithm is intended to reduce the weighted sum of the number of transfers and the total travel time of the users through restructured bus routes and new frequencies without increased fleet sizes. The HEABC relies mainly on the enhanced artificial bee colony algorithm to determine the route structure, and the frequency is determined by the frequency-setting heuristic during the fitness evaluation. For an illustration of its performance, the HEABC was compared with a hybrid generic algorithm and a variant of the HEABC. The results indicated that the HEABC could produce better solutions than the other two algorithms could. Moreover, the HEABC could produce a design that was better than the existing design for maximum intermediate stops, total travel time, number of transfers, maximum headway, and total fuel cost. The design should be acceptable to the public and to bus operators.
Get full access to this article
View all access options for this article.
References
1.
DesaulniersG., and HickmanM.Public Transit. In Handbooks in Operation Research and Management Science (BaruhantC. and LaporteG., eds.), Vol. 14, Elsevier, Amsterdam, Netherlands, 2007, pp. 69–120.
2.
GuihaireV., and HaoJ. K.Transit Network Design and Scheduling: A Global Review. Transportation Research Part A, Vol. 42, No. 10, 2008, pp. 1251–1273.
3.
MurrayA. T.A Coverage Model for Improving Public Transit System Accessibility and Expanding Access. Annals of Operations Research, Vol. 123, No. 1–4, 2003, pp. 143–156.
4.
GuanJ.F., YangH., and WirasingheS. C.Simultaneous Optimization of Transit Line Configuration and Passenger Line Assignment. Transportation Research Part B, Vol. 40, No. 10, 2003, pp. 885–902.
5.
WanQ.K., and LoH. K.A Mixed Integer Formulation for Multiple-Route Transit Network Design. Journal of Mathematical Modelling and Algorithms, Vol. 2, No. 4, 2003, pp. 299–308.
6.
LownesN.E., and MachemehlR. B.Exact and Heuristic Methods for Public Transit Circulator Design. Transportation Research Part B, Vol. 44, No. 2, 2010, pp. 309–318.
7.
PattnaikS.B., MohanS., and TomV. M.Urban Bus Transit Network Design Using Genetic Algorithm. Journal of Transportation Engineering, Vol. 124, No. 4, 1998, pp. 368–375.
8.
BielliM., CaramiaM., and CarotenutoP.Genetic Algorithms in Bus Network Optimization. Transportation Research Part C, Vol. 10, No. 1, 2003, pp. 19–34.
9.
TomV.M., and MohanS.Transit Route Network Design Using Frequency Coded Genetic Algorithm. Journal of Transportation Engineering, Vol. 129, No. 2, 2003, pp. 186–195.
10.
SzetoW.Y., and WuY. Z.A Simultaneous Bus Route Design and Frequency Setting Problem for Tin Shui Wai, Hong Kong. European Journal of Operational Research, Vol. 209, No. 2, 2010, pp. 141–155.
11.
FanW., and MachemehlR.Optimal Transit Route Network Design Problem with Variable Transit Demand: Genetic Algorithm Approach. Journal of Transportation Engineering, Vol. 132, No. 1, 2006, pp. 40–51.
12.
FanW., and MachemehlR.Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem. Journal of Transportation Engineering, Vol. 132, No. 2, 2006, pp. 122–132.
13.
ZhaoF., and ZengX.Simulated Annealing-Genetic Algorithm for Transit Network Optimization. Journal of Computing in Civil Engineering, Vol. 20, No. 1, 2006, pp. 57–68.
14.
ZhaoF., UbakaI., and GanA.Transit Network Optimization: Minimizing Transfers and Maximizing Service Coverage with an Integrated Simulated Annealing and Tabu Search Method. In Transportation Research Record: Journal of the Transportation Research Board, No. 1923, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 180–188.
15.
ZhaoF., and ZengX. G.Optimization of User and Operator Cost for Large-Scale Transit Network. Journal of Transportation Engineering, Vol. 33, No. 4, 2007, pp. 240–251.
16.
YangZ., YuB., and ChengC.A Parallel Ant Colony Algorithm for Bus Network Optimization. Computer Aided Civil and Environmental Engineering, Vol. 22, No. 1, 2005, pp. 44–55.
17.
CiprianiE., GoriS., and PetreliM.Transit Network Design: A Procedure and an Application to a Large Urban Area. Transportation Research Part A, Vol. 20, No. 1, 2012, pp. 3–14.
18.
KepaptsoglouK., and KarlaftisM.Transit Route Network Design Problem: Review. Journal of Transportation Engineering, Vol. 135, No. 8, 2009, pp. 491–505.
19.
KarabogaD.An Idea Based on Honey Bee Swarm for Numerical Optimization.Technical report TR06. Erciyes University, Kayseri, Turkey, 2005.
20.
KarabogaD.A New Design Method Based on Artificial Bee Colony Algorithm for Digital IIR Filters. Journal of the Franklin Institute, Vol. 346, No. 4, 2009, pp. 328–348.
21.
SinghA.An Artificial Bee Colony Algorithm for the Leaf-Constrained Minimum Spanning Tree Problem. Applied Soft Computing, Vol. 9, No. 2, 2009, pp. 625–631.
22.
SzetoW.Y., WuY.Z., and HoS. C.An Artificial Bee Colony Algorithm for the Capacitated Vehicle Routing Problem. European Journal of Operational Research, Vol. 215, No. 1, 2011, pp. 126–135.
23.
BaajH., and MahmassaniH. S.TRUST: A LISP Program for the Analysis of Transit Route Configurations. In Transportation Research Record 1283, TRB, National Research Council, Washington, D.C., 1990, pp. 125–135.
24.
SzetoW.Y., SolayappanM., and JiangY.Reliability-Based Transit Assignment for Congested Stochastic Transit Networks. Computer-Aided Civil and Infrastructure Engineering, Vol. 26, No. 4, 2011, pp. 311–326.
25.
SzetoW.Y., JiangY., WongK.I., and SolayappanM.Reliability-Based Stochastic Transit Assignment with Capacity Constraints: Formulation and Solution Method. Transportation Research Part C (forthcoming).
26.
MagnantiT.L., and WongR. T.Network Design and Transportation Planning: Models and Algorithms. Transportation Science, Vol. 18, No. 1, 1984, pp. 1–55.
