Routing-Reference-Cited by-同舟云学术

Routing

Published:2013 Issue: Volume: Page:39-46
ISSN:
Container-title:Geographic Information Systems
language:
Short-container-title:

Author:

Curtin Kevin M.¹

Affiliation:

1. George Mason University, USA

Abstract

Routing is the act of selecting a course of travel. Routing problems are one of the most prominent and persistent problems in geoinformatics. This large research area has a strong theoretical foundation with ties to operations research and management science. There are a wide variety of routing models to fit many different application areas, including shortest path problems, vehicle routing problems, and the traveling salesman problem, among many others. There are also a range of optimal and heuristic solution procedures for solving instances of those problems. Research is ongoing to expand the types of routing problems that can be solved, and the environments within which they can be applied.

Publisher

IGI Global

Reference46 articles.

1. Applegate D., B. R., Chvtal V., & Cook W. . (1998). On the Solution of Traveling Salesman Problems. Documenta Mathematica, 645-656.

2. Hybrid route generation heuristic algorithm for the design of transit networks

3. On a routing problem.;R.Bellman;Quarterly of Applied Mathematics,1958

4. A multi-objective optimization approach to urban school bus routing: Formulation and solution method

5. Operational objective functions in designing public transport routes.;A.Ceder;Journal of Advanced Transportation,2001

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Related References;Technologies for Urban and Spatial Planning: Virtual Cities and Territories

2. Compilation of References;Technologies for Urban and Spatial Planning: Virtual Cities and Territories