352
Views
5
CrossRef citations to date
0
Altmetric
Articles

A multi-objective meta-heuristic approach for the transit network design and frequency setting problem

ORCID Icon & ORCID Icon
Pages 851-867 | Received 06 Aug 2019, Accepted 03 Aug 2020, Published online: 14 Oct 2020

References

  • Alijla, B. O., L. P. Wong, C. P. Lim, A. T. Khader, and M. A. Al-Betar. 2014. “A Modified Intelligent Water Drops Algorithm and its Application to Optimization Problems.” Expert Systems with Applications 41 (15): 6555–6569.
  • Baaj, M. H., and H. S. Mahmassani. 1991. “An AI-Based Approach for Transit Route System Planning and Design.” Journal of Advanced Transportation 25: 187–209. doi:10.1002/atr.5670250205.
  • Ceder, A., and N. H. M. Wilson. 1986. “Bus Network Design.” Transportation Research Part B: Methodological 20 (4): 331–344.
  • Cerny, V. 1985. “Thermo-dynamical Approach to the Travelling Salesman Problem: And Efficient Simulation Algorithm.” Journal of Optimization. Theory and Applications 45: 41–55.
  • Ceylan, H., and T. Ozcan. 2018. “Optimization of Headways and Departure Times in Urban Bus Networks: A Case Study of Çorlu, Turkey.” Advances in Civil Engineering.
  • Chakroborty, P, and Wivedi T. 2002. Optimal Route Network Design for Transit Systems using Genetic Algorithms". Engineering optimization 34: 83–100.
  • Euchi, J., and R. Mraihi. 2012. “The Urban bus Routing Problem in the Tunisian Case by the Hybrid Artificial ant Colony Algorithm.” Swarm & Evolutionary Computation 2 (1): 15–24. doi:10.1016/j.swevo.2011.10.002.
  • Goldberg, D. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. New York: Addison Wesley Publishing Company Inc.
  • Han, A. F., and N. H. M. Wilson. 1982. “The Allocation of Buses in Heavily Utilized Networks with Overlapping Routes.” Transportation Research Part B: Methodological 16 (3): 221–232.
  • Holland, J. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
  • Jha, Shashi Bhushan, J. K. Jha, and Manoj Kumar Tiwari. 2019. “A Multi-Objective Meta-Heuristic Approach for Transit Network Design and Frequency Setting Problem in a bus Transit System.” Computers & Industrial Engineering 130: 166–186.
  • Jiang, Y., W. Szeto, and T. Ng. 2013. “Transit Network Design: A Hybrid Enhanced Artificial bee Colony Approach and a Case Study.” International Journal of Transportation Science & Technology 2 (3): 243–260. doi:10.1260/2046-0430.2.3.243.
  • Karp, R. M. 1975. “On the Computational Complexity of Combinatorial Problems.” Networks 5: 45–68.
  • Kechagiopoulos, P. N., and G. N. Beligiannis. 2014. “Solving the Urban Transit Routing Problem Using a Particle Swarm Optimization-Based Algorithm.” Applied Soft Computing 21 (1): 654–676. doi:10.1016/j.asoc.2014.04.005.
  • Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220: 671–680.
  • Magnanti, T. T., and R. T. Wong. 1984. “Network Design and Transportation Planning: Models and Algorithms.” Transportation Science 18 (1): 1–55.
  • Mandl, C. 1980. “Evaluation and Optimization of Urban Public Transportation Networks.” European Journal of Operational Research 5 (6): 396–404.
  • Mladenovic ´, N., and P. Hansen. 1997. “Variable Neighborhood Search.” Computers & Operations Research 24 (11): 1097–1100.
  • Nikolić, M., and D. Teodorović. 2013. “Transit Network Design by Bee Colony Optimization.” Expert Systems with Applications 40: 5945–5955. doi:10.1016/j.eswa.2013.05.002.
  • Oprešnik, R, Seljak S, Vihar T, Gerbec R, and Katrašnik T. 2018. "Real-World Fuel Consumption, Fuel Cost and Exhaust Emissions of Different Bus Powertrain Technologies." Energies 11 (8): 2160.
  • Pattnaik, S. B., S. Mohan, and V. M. Tom. 1998. “Urban bus Transit Route Network Design Using Genetic Algorithm.” Journal of Transportation Engineering 124 (4): 368–375.
  • Poorzahedy, H., and F. Safari. 2011. “An ant System Application to the bus Network Design Problem: An Algorithm and a Case Study.” Public Transport 3 (2): 165–187. doi:10.1007/s12469-011-0046-9.
  • Shah-Hosseini, H. 2007. “Problem Solving by Intelligent Water Drops”. In IEEE Congress on Evolutionary Computation, CEC.
  • Shah-Hosseini, H. 2008. “Intelligent Water Drops Algorithm: A new Optimization Method for Solving the Multiple Knapsack Problem.” International Journal of Intelligent Computing and Cybernetics 1 (2): 193–212.
  • Shah-Hosseini, H. 2009. Optimization with the Nature-Inspired Intelligent Water Drops Algorithm. IntechOpen. doi:10.5772/9623. https://www.intechopen.com/books/evolutionary-computation/optimization-with-the-nature-inspired-intelligent-water-drops-algorithm.
  • Shah-Hosseini, H. 2012a. “Intelligent Water Drops Algorithm for Automatic Multilevel Thresholding of Grey-Level Images Using a Modified Otsu’s Criterion.” International Journal of Modelling, Identification and Control 15 (4): 241–249.
  • Shah-Hosseini, H. 2012b. “An Approach to Continuous Optimization by the Intelligent Water Drops Algorithm.” Procedia-Social and Behavioral Sciences 32: 224–229.
  • Shih, Mao-Chang, Hani S. Mahmassani, and M. Hadi Baaj. 1997. “Trip Assignment Model for Timed-Transfer Transit Systems.” Transportation Research Record 1571 (1): 24–30.
  • Taylor, M. A. 1990. “Knowledge-based Systems for Transport Network Analysis: a Fifth-Generation Perspective on Transport Network Problems.” Transportation Research Part A: General 24 (1): 3–14.
  • Tom, V. M., and S. Mohan. 2003. “Transit Route Network Design Using Frequency Coded Genetic Algorithm.” Journal of Transportation Engineering 129 (2): 186–195.
  • Weise, T., M. Zapf, R. Chiong, and A. J. Nebro. 2009. “Why is Optimization Difficult.” In Nature-Inspired Algorithms for Optimisation, edited by R. Chiong, 1–50. Berlin: Springer.
  • Yang, Z., B. Yu, and C. Cheng. 2007. “A Parallel ant Colony Algorithm for bus Network Optimization.” Computer-Aided Civil & Infrastructure Engineering 22 (1): 44–55. doi:10.1111/j.1467-8667.2006.00469.x.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.