NDLI: Analysis of the Traveling Salesman Problem with a subset of intermediate cities and dynamic edge weights used with intelligent transportation systems

Content Provider	IEEE Xplore Digital Library
Author	Miller, J.
Copyright Year	2009
Description	Author affiliation: Department of Computer Systems Engineering University of Alaska, Anchorage (Miller, J.)
Abstract	In this paper a specialized routing problem for vehicles in a transportation network that need to visit multiple destinations before returning to the starting location in the minimum time is presented. Although this problem is similar to the Traveling Salesman Problem (TSP), it differs because the edge weights can change constantly and the vehicle only needs to visit a subset of the nodes in the graph. The Dynamic Fastest Paths with Multiple Unique Destinations (DynFast-MUD) algorithm [23] provides a solution to this problem which is tested in a live environment in this study. There are currently 50 vehicles in Anchorage, Alaska that contain devices that report the speed, location, and direction to a central server through a vehicle-to-infrastructure (V2I) architecture. Using this data, the shortest route to a predefined set of destinations was compared to the path identified by the DynFast-MUD algorithm once a day for a two week period. The results show that with this relatively limited number of vehicles contributing to the dynamic changing edge weights, the DynFast-MUD algorithm always provides a route that is at least as fast as the shortest route. It is hypothesized that with more vehicles reporting speed and location data, the DynFast-MUD algorithm will produce even better results.
Starting Page	1
Ending Page	5
File Size	424374
Page Count	5
File Format	PDF
ISBN	9781424446568
DOI	10.1109/ICICS.2009.5397734
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-12-08
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent transportation systems Traveling salesman problems Cities and towns MIMO Transmitters Channel estimation Fading Closed-form solution Receiving antennas Transmitting antennas
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in