skip to main content
10.1145/2695664.2696027acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
short-paper

Search space reduction for electric vehicle-based tour schedules

Published:13 April 2015Publication History

ABSTRACT

This paper develops speedup techniques for tour schedules based on electric vehicle (EV)-specific constraint processing. Rather than the tour length, the waiting time is more critical to EVs due to long charging time and immature charging infrastructure. First, grouping tour spots in the vicinity significantly cuts down the search space, which is very sensitive to the number of destinations to visit, as the subsequence within a group has little impact on the waiting time. Second, the per-spot precalculation of the minimum cost to the other destinations makes more branches be pruned. Finally, the combination of well-established techniques in the traveling salesman problem leads to a tighter constraint on intermediary node expansion. The reduced overhead provides an acceptable response time for EV drivers who want to make an energy-efficient tour plan having a tolerable waiting time bound.

References

  1. J. Timpner and L. Wolf. Design and evaluation of charging station scheduling strategies for electric vehicles. IEEE Transactions on Intelligent Transportation Systems, 15(2):579--588, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. Lee, S. Kim, and G. Park. A tour recommendation service for electric vehicles based on a hybrid orienteering model. 28th Annual ACM SAC, pages 1652--1654, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. K. Helsgaun. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1):106--130, 2000Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Search space reduction for electric vehicle-based tour schedules

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing
                April 2015
                2418 pages
                ISBN:9781450331968
                DOI:10.1145/2695664

                Copyright © 2015 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 13 April 2015

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • short-paper

                Acceptance Rates

                SAC '15 Paper Acceptance Rate291of1,211submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%
              • Article Metrics

                • Downloads (Last 12 months)5
                • Downloads (Last 6 weeks)3

                Other Metrics

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader