arrow
Return

Solving the Urban Transit Routing Problem using a particle swarm optimization based algorithm

delete2014-08-01
delete76
PRE
AI
P
Panagiotis N. Kechagiopoulos
G
Grigorios N. Beligiannis *
DOI:10.1016/j.asoc.2014.04.005delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The Urban Transit Routing Problem (UTRP) comprises an NP-hard problem that deals with the construction of route networks for public transit networks. It is a highly complex and multiply constrained problem, in which the assessment of candidate route networks can be both time consuming and challenging. Except for that, a multitude of potential solutions are usually rejected due to infeasibility. Because of this difficulty, soft computing algorithms can be very effective for its efficient solution. The success of these methods, however, depends mainly on the quality of the representation of candidate solutions, on the efficiency of the initialization procedure and on the suitability of the modification operators used. An optimization algorithm, based on particle swarm optimization, is designed and presented in the current contribution, aiming at the efficient solution of UTRP. Apart from the development of the optimization algorithm, emphasis is also given on appropriate representation of candidate solutions, the route networks in other words, and the respective evaluation procedure. The latter procedure considers not only the quality of service offered to each passenger, but also the costs of the operator. Results are compared on the basis of Mandl's benchmark problem of a Swiss bus network, which is probably the only widely investigated and accepted benchmark problem in the relevant literature. Comparison of the obtained results with other results published in the literature shows that the performance of the proposed soft computing algorithm is quite competitive compared to existing techniques. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Particle swarm optimization
Vehicle routing
Urban Transit Routing Problem
Mandl's benchmark problem
Real world application
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

H
Hellenic Open University
Scholars:
891
Papers: 824
Citations: 628
Cited Papers

Cited Papers

Randomized Phase II Study of Ixabepilone or Paclitaxel Plus Carboplatin in Patients With Non–Small-Cell Lung Cancer Prospectively Stratified by Beta-3 Tubulin Status
err2013-06-01
err0
errOAAI
errMartin J. Edelman; Claus-Peter Schneider; Chun-Ming Tsai; Heung-Tae Kim; Elisabeth Quoix; Alexander V. Luft; Remigiusz Kaleta; Pralay Mukhopadhyay; Ovidiu C. Trifan; Laura Whitaker; Martin Reck
errShare
errSave
errShare
errSave
Domain structure of TbFe magnetostrictive films by MFM
err2001-07-01
err0
PREAI
errJhy-Chau Shih; Tsung-Shune Chin; Zhi-Gang Sun; Hong-Wei Zhang; Bao-Gen Shen
errShare
errSave
Acute urinary tract infection in patients with underlying benign prostatic hyperplasia and prostate cancer
err2020-01-01
err0
errOAAI
errMusliu Adetola Tolani; Aisha Suleiman; Mudi Awaisu; Muhammad Mukhtar Abdulaziz; Ahmad Tijjani Lawal; Ahmad Bello
errShare
errSave
errShare
errSave
researcher View more