Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm

Transportation Planning and Technology

Volumn 28, Issue 2, 2005, Pages 113-133

  Nepal, Kali Prasad ^a   Park, Dongjoo ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b Kongju National University   (South Korea)

Author keywords

Median shortest path problem (MSPP); Pareto optimal paths (POP); Transportation networks; Vector labeling algorithm

Indexed keywords

ALGORITHMS; COSTS; DECISION MAKING; PARAMETER ESTIMATION; PRODUCT DESIGN; URBAN PLANNING; VECTORS;

ACCESS COST PARAMETER (ACP); CYCLIC BREAK (CB); MEDIAN SHORTEST PATH PROBLEM (MSPP); PARETO OPTIMAL PATH (POP);

TRANSPORTATION;

ALGORITHM; URBAN TRANSPORT;

EID: 17744372938     PISSN: 03081060     EISSN: None     Source Type: Journal    
DOI: 10.1080/03081060500053509     Document Type: Article

References (13)

1. Steenbrink, P. (1974) Optimization of Transport Networks (Bristol: Wiley).
2. Coutinho-Rodrigues, J. M., Climaco, J. C. N. & Current, J. R. (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions, Computers and Operation Research 26, 789-798.
3. Current, J. R., ReVelle, C. S. & Cohon, J. L. (1987) The median shortest path problem: a multiobjective approach to analyze cost vs. accessibility in the design of the transportation networks, Transportation Science, 21(3), 188-197.
4. Current, J. R., ReVelle, C. S. & Cohon, J. L. (1985) The maximum covering/shortest path problem: a multiobjective network design and routing formulation, European Journal of Operational Research, 21, 189-199.
5. Martins, E. Q. V. & Santos, J. L. E. D. (1999) The Labeling Algorithm for the Multiobjective Shortest Path Problem (Coimbra, Portugal: Departamento de Maternatica, Universidade de Coimbra).
6. Current, J. L. & Min, H. (1986) Multiobjective design of the transportation networks: taxonomy and annotation, European Journal of Operational Research, 26, 187-201.
7. Hansen, P. (1980) Bicriterion path problems, in: G. Fandel & T. Gal (Eds) Multiple Criteria Decision Making: Theory and Applications, pp. 109-127 (Berlin: Springer).
8. Martins, E. Q. V. (1984) On a multicriteria shortest path problem, European Journal of Operational Research, 16, 236-245.
9. Aneja, Y. P. & Nair, K. P. K. (1979) Bicriteria transportation problems, Management Science, 25, 73-78.
10. Park, D., Sharma, S. L., Rilett, L. R. & Chang, M. (2002) Identifying multiple and reasonable alternative routes: efficient vector labeling approach, Transportation Research Record, 1783, 111-118.
11. Nepal, K. P. (2002) Median shortest path problems in the design of transpiration networks, MA Thesus, Asian Institute of Technology, Thailand.
12. Moore, E. F. (1957) The shortest path through a maze, Proceedings of International Symposium on Theory of Switching, pp. 285-292 (Cambridge, MA: Harvard University).
13. Dijkstra, E. W. (1959) Note on two problems in connection with graphs, Numerical Mathematics, 1, 269-271.