Ann Melissa Campbell, University of Iowa – Making Delivery Driver Parking More Efficient episode artwork

EPISODE · Jun 17, 2024 · 2 MIN

Ann Melissa Campbell, University of Iowa – Making Delivery Driver Parking More Efficient

from The Academic Minute · host Academic Minute

Delivery drivers don’t have it easy when it comes to parking, so how can we improve this?Ann Melissa Campbell, Clement T. and Sylvia H. Hanson Family Chair in Manufacturing productivity and professor of business analytics at the University of Iowa, looks into it.Faculty Bio:Ann Melissa Campbell’s research focuses on freight transportation, especially on problems related to new and emerging business models, as well as the logistics of disaster preparation and relief. She is a recipient of the NSF CAREER Award and serves as an Area Editor for Transportation Science. As department chair, she led the efforts of the Tippie College of Business’ Department of Business Analytics to win the 2021 INFORMS UPS George D. Smith Prize for excellence in analytics education. Since 2022, she has chaired the annual FutureBAProf workshop focused on improving diversity in business analytics academic positions.Transcript:Anyone who’s ever spent time in a big city has found themselves stuck in traffic, surrounded by delivery vehicles. How can we get the products we order delivered to us on-time with fewer delivery trucks on the road and the traffic they cause?This is the question we considered in our latest study. Delivery companies develop sophisticated algorithms to decide what customers should be visited by which drivers, and the order that delivery drivers should visit these customers. These algorithms, however, don’t consider parking. It can be useful, for example, to recommend a driver park in a certain area and visit a prescribed set of customers on foot from that parking spot. Our algorithm does just this – it recommends parking spots for drivers, telling them where to park and which customers to visit on foot from that parking spot. We found that this strategic consideration of parking becomes particularly important in areas where it takes a long time to park. This is the case in most urban environments, where the current average time to park is 9 minutes. In these situations, the answer is for the driver to park fewer times and walk more. If the parking time is high enough, the solutions can suggest that driver deliver a set of packages from a parking spot and return to that parking spot to get more packages and walk again rather than drive. We tested our idea using data from Chicago. We calculated delivery time could be cut by about 50 percent if companies designed routes that strategically consider parking, which means drivers can make twice as many deliveries during a day. If drivers can make twice as many deliveries, we need only half the number of trucks on the road and traffic can be reduced so we can get to where we want to go more quickly. This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit www.academicminute.org

NOW PLAYING

Ann Melissa Campbell, University of Iowa – Making Delivery Driver Parking More Efficient

0:00 2:30

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Frequently Asked Questions

How long is this episode of The Academic Minute?

This episode is 2 minutes long.

When was this The Academic Minute episode published?

This episode was published on June 17, 2024.

What is this episode about?

Delivery drivers don’t have it easy when it comes to parking, so how can we improve this?Ann Melissa Campbell, Clement T. and Sylvia H. Hanson Family Chair in Manufacturing productivity and professor of business analytics at the University of Iowa,...

Can I download this The Academic Minute episode?

Yes, you can download this episode by clicking the download button on the episode player, or subscribe to the podcast in your preferred podcast app for automatic downloads.
URL copied to clipboard!