skip to main content
10.1145/2820783.2820838acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
short-paper

Effective and efficient: large-scale dynamic city express

Published:03 November 2015Publication History

ABSTRACT

City express services are in great demand in recent years. However, the current city express system is found to be unsatisfactory for both the service providers and customers. In this paper, we are the first to systematically study the large-scale dynamic city express problem. We aim to increase both the effectiveness and the efficiency of the scheduling algorithm. To improve the effectiveness, we adopt a batch assignment strategy that computes the pickup-delivery routes for a group of requests received in a short period rather than dealing with each request individually. To improve the efficiency, we design a two-level priority queue structure to reduce redundant shortest distance calculation and repeated candidate generation. We develop a simulation system and conduct extensive performance studies in the real road network of Beijing city. The experimental results demonstrate the high effectiveness and efficiency of our algorithm.

References

  1. O. Bräysy and M. Gendreau. Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation science, 39(1), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3. ed). MIT Press, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Gendreau, F. Guertin, J.-Y. Potvin, and E. Taillard. Parallel tabu search for real-time vehicle routing and dispatching. Transportation science, 33(4), 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. V. Pillac, M. Gendreau, C. Guéret, and A. L. Medaglia. A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 2013.Google ScholarGoogle Scholar
  5. S. M. Ross et al. Stochastic processes, volume 2. John Wiley & Sons New York, 1996.Google ScholarGoogle Scholar
  6. M. M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2), 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Y. Zheng, L. Capra, O. Wolfson, and H. Yang. Urban computing: concepts, methodologies, and applications. ACM Transactions on Intelligent Systems and Technology, 5(3):38--55, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Effective and efficient: large-scale dynamic city express

            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
              SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems
              November 2015
              646 pages
              ISBN:9781450339674
              DOI:10.1145/2820783

              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: 3 November 2015

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • short-paper

              Acceptance Rates

              SIGSPATIAL '15 Paper Acceptance Rate38of212submissions,18%Overall Acceptance Rate220of1,116submissions,20%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader