10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      The Same-Day Delivery Problem for Online Purchases

      1 , 1 , 1
      Transportation Science
      Institute for Operations Research and the Management Sciences (INFORMS)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Same-day delivery for online purchases is a recent trend in online retail. We introduce a multi-vehicle dynamic pickup and delivery problem with time constraints that incorporates key features associated with same-day delivery logistics. To make better informed decisions, our solution approach incorporates information about future requests into routing decisions. We also introduce an analytical result that identifies when it is beneficial for vehicles to wait at the depot. We present a wide range of computational experiments that demonstrate the value of our approach. The results show that more requests can be filled when time windows are evenly spread throughout the day compared to when many requests' time windows occur late in the day. However, the anticipation of future requests is most valuable when many requests' time windows occur late in the day. As a result of increased flexibility, experiments also demonstrate that the value of anticipating the future decreases when the number of vehicles or the arrival rate of requests increases.

          The online appendix is available at https://doi.org/10.1287/trsc.2016.0732 .

          Related collections

          Most cited references30

          • Record: found
          • Abstract: not found
          • Article: not found

          Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A Heuristic Algorithm for the Vehicle-Dispatch Problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A review of dynamic vehicle routing problems

                Bookmark

                Author and article information

                Contributors
                (View ORCID Profile)
                (View ORCID Profile)
                Journal
                Transportation Science
                Transportation Science
                Institute for Operations Research and the Management Sciences (INFORMS)
                0041-1655
                1526-5447
                February 2019
                February 2019
                : 53
                : 1
                : 167-184
                Affiliations
                [1 ]Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242
                Article
                10.1287/trsc.2016.0732
                baf31091-b0da-4130-a2ff-a1682454ec38
                © 2019
                History

                Comments

                Comment on this article