IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v56y2022i3p631-653.html
   My bibliography  Save this article

Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows

Author

Listed:
  • Fabian Torres

    (Centre interuniversitaire de recherche sur les reseaux d’entreprise, la logistique et le transport (CIRRELT), Montréal, Quebec H3T 1J4, Canada; Département de mathématiques et de génie industriel, Polytechnique Montréal, Montréal, Quebec H3C 3A7, Canada)

  • Michel Gendreau

    (Centre interuniversitaire de recherche sur les reseaux d’entreprise, la logistique et le transport (CIRRELT), Montréal, Quebec H3T 1J4, Canada; Département de mathématiques et de génie industriel, Polytechnique Montréal, Montréal, Quebec H3C 3A7, Canada)

  • Walter Rei

    (Centre interuniversitaire de recherche sur les reseaux d’entreprise, la logistique et le transport (CIRRELT), Montréal, Quebec H3T 1J4, Canada; Département de management et technologie, Université de Québec à Montréal, Montréal, Quebec H2L 2C4, Canada)

Abstract

The growth of e-commerce has increased demand for last-mile deliveries, increasing the level of congestion in the existing transportation infrastructure in urban areas. Crowdsourcing deliveries can provide the additional capacity needed to meet the growing demand in a cost-effective way. We introduce a setting where a crowd-shipping platform sells heterogeneous products of different sizes from a central depot. Items sold vary from groceries to electronics. Some items must be delivered within a time window, whereas others need a customer signature. Furthermore, customer presence is not guaranteed, and some deliveries may need to be returned to the depot. Delivery requests are fulfilled by a fleet of professional drivers and a pool of crowd drivers. We present a crowd-shipping platform that standardizes crowd drivers’ capacities and compensates them to return undelivered packages back to the depot. We formulate a two-stage stochastic model, and we propose a branch and price algorithm to solve the problem exactly and a column generation heuristic to solve larger problems quickly. We further develop an analytical method to calculate upper bounds on the supply of vehicles and an innovative cohesive pricing problem to generate columns for the pool of crowd drivers. Computational experiments are carried out on modified Solomon instances with a pool of 100 crowd vehicles. The branch and price algorithm is able to solve instances of up to 100 customers. We show that the value of the stochastic solution can be as high as 18% when compared with the solution obtained from a deterministic simplification of the model. Significant cost reductions of up to 28% are achieved by implementing crowd drivers with low compensations or higher capacities. Finally, we evaluate what happens when crowd drivers are given the autonomy to select routes based on rational and irrational behavior. There is no cost increase when crowd drivers are rational and select routes that have a higher compensation first. However, when crowd drivers are irrational and select routes randomly, the cost can increase up to 4.2% for some instances.

Suggested Citation

  • Fabian Torres & Michel Gendreau & Walter Rei, 2022. "Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows," Transportation Science, INFORMS, vol. 56(3), pages 631-653, May.
  • Handle: RePEc:inm:ortrsc:v:56:y:2022:i:3:p:631-653
    DOI: 10.1287/trsc.2021.1101
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1101
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2021.1101?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:56:y:2022:i:3:p:631-653. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.