IDEAS home Printed from https://ideas.repec.org/a/wly/transj/v54y2015i4p473-495.html

Implementing Off‐peak Deliveries in the Greater Toronto Area: Costs, Benefits, Challenges

Author

Listed:
  • Jessica McPhee
  • Ari Paunonen
  • Taufiq Ramji
  • James H. Bookbinder

Abstract

Nestle Canada currently uses 32 routes that serve over 4,500 customers in the Greater Toronto Area (GTA). This study aims to quantify Nestlé's costs and benefits of modifying their ice cream supply chain to incorporate night‐time deliveries, while providing a framework for the regulatory, conceptual, and inertial obstacles to implementation. Employing Nestlé's customer data set, we created routing software to determine the proportion of customers who must be willing to accept deliveries outside of normal working hours so that the change would be financially feasible. Based upon a literature review we found that, before proceeding, the following qualitative factors should be considered: safety, sustainability, regulatory concerns, truck noise, traffic, and congestion. Reduction of 3–10 percent in the number of routes may result from switching a suitable proportion of deliveries to night‐time, achieving the minimum fleet size when 50–60 percent of locations are served on night routes. The operation of both night‐time and daytime deliveries would enable an increase in truck utilization, thus decreasing the number of vehicles required. Recommendations for success of night‐time deliveries include preparation of a safety plan, procurement of plate trucks, noise‐abatement techniques, and the development of a noise‐monitoring program.

Suggested Citation

  • Jessica McPhee & Ari Paunonen & Taufiq Ramji & James H. Bookbinder, 2015. "Implementing Off‐peak Deliveries in the Greater Toronto Area: Costs, Benefits, Challenges," Transportation Journal, John Wiley & Sons, vol. 54(4), pages 473-495, October.
  • Handle: RePEc:wly:transj:v:54:y:2015:i:4:p:473-495
    DOI: 10.5325/transportationj.54.4.0473
    as

    Download full text from publisher

    File URL: https://doi.org/10.5325/transportationj.54.4.0473
    Download Restriction: no

    File URL: https://libkey.io/10.5325/transportationj.54.4.0473?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
    ---><---

    References listed on IDEAS

    as
    1. Piecyk, Maja I. & McKinnon, Alan C., 2010. "Forecasting the carbon footprint of road freight transport in 2020," International Journal of Production Economics, Elsevier, vol. 128(1), pages 31-42, November.
    2. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zheng, Yuxin & Yang, Jie & Zhang, Xiaoning, 2025. "Multi-Period operations optimization for passenger-freight shared transport: A game-theoretic approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 199(C).
    2. William J. Rose & Peter M. Ralston & Chad W. Autry, 2020. "Urbanness and Its Implications for Logistics Strategy: A Revised Perspective," Transportation Journal, John Wiley & Sons, vol. 59(2), pages 165-199, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    2. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    3. Mikhail V. Batsyn & Ekaterina K. Batsyna & Ilya S. Bychkov & Panos M. Pardalos, 2021. "Vehicle assignment in site-dependent vehicle routing problems with split deliveries," Operational Research, Springer, vol. 21(1), pages 399-423, March.
    4. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.
    5. Leloup, Emeline & Paquay, Célia & Pironet, Thierry & Oliveira, José Fernando, 2025. "A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows," European Journal of Operational Research, Elsevier, vol. 323(1), pages 45-61.
    6. Rafael Tordecilla-Madera & Andrés Polo & Adrián Cañón, 2018. "Vehicles Allocation for Fruit Distribution Considering CO 2 Emissions and Decisions on Subcontracting," Sustainability, MDPI, vol. 10(7), pages 1-21, July.
    7. Zuo, Chengchoa & Birkin, Mark & Clarke, Graham & McEvoy, Fiona & Bloodworth, Andrew, 2018. "Reducing carbon emissions related to the transportation of aggregates: Is road or rail the solution?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 117(C), pages 26-38.
    8. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    9. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    10. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    11. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.
    12. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    13. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    14. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    15. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    16. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    17. Seitz, Claudio S. & Beuttenmüller, Oliver & Terzidis, Orestis, 2015. "Organizational adoption behavior of CO2-saving power train technologies: An empirical study on the German heavy-duty vehicles market," Transportation Research Part A: Policy and Practice, Elsevier, vol. 80(C), pages 247-262.
    18. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.
    19. Breen, Benjamin & Vega, Amaya & Feo-Valero, Maria, 2015. "An empirical analysis of mode and route choice for international freight transport in Ireland," Working Papers 262587, National University of Ireland, Galway, Socio-Economic Marine Research Unit.
    20. Kloster, Konstantin & Moeini, Mahdi & Vigo, Daniele & Wendt, Oliver, 2023. "The multiple traveling salesman problem in presence of drone- and robot-supported packet stations," European Journal of Operational Research, Elsevier, vol. 305(2), pages 630-643.

    More about this item

    Statistics

    Access and download statistics

    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:wly:transj:v:54:y:2015:i:4:p:473-495. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: .

    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.