Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Roth, Jörg
Affiliations: Faculty of Computer Science, Nuremberg Institute of Technology, Nuremberg, Germany. E-mail: joerg.roth@th-nuernberg.de
Abstract: To compute optimal paths between locations in road networks is an important operation for e.g. transport business. Efficient algorithms for path planning usually assume a single start and a single target. In some scenarios, however, we want to compute all shortest paths from a set of starts to a set of targets. If we use the one-to-one planning in a loop, we consider each path as an independent computation. The drawback: we cannot take benefit of similarities between planning steps. In this paper, we present an approach that addresses this problem and provides a many-to-many path planning. An example that is heavily based on many-to-many path planning: given a home depot and a set of delivery points, what is the optimal round-trip that starts at the home depot, approaches each delivery point and turns back to the home depot. This problem is known as the Traveling Salesman Problem, but usually it is not applied to real road networks. In this paper we describe the efficient many-to-many path planning that is based on A^*. It significantly reduces the number of visited crossings due to computation similarities. We adapt the approach to provide a solution for the Traveling Salesman Problem on road networks.
Keywords: Road transportation, shortest path problem, Traveling Salesman Problem
DOI: 10.3233/KES-160339
Journal: International Journal of Knowledge-based and Intelligent Engineering Systems, vol. 20, no. 3, pp. 135-148, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl