Computers solve delivery problems

Writing in a forthcoming issue of the Inderscience publication the International Journal of Logistics Systems and Management, researchers suggest a new approach to cutting journey times and so reducing pollution and speeding up deliveries for couriers everywhere.

According to Chandra Sunil Kumar and T.T. Narendran of the Department of Management Studies, at IIT-Madras, in Chennai, India, the Travelling Salesman Problem, or to give it its modern name the Vehicle Routing Problem (VRP), is one of the biggest headaches for companies running delivery and pickup services – how to ensure the route taken by the couriers is not only as short as possible and so uses the least fuel but also ensures that all drop-offs and pick-ups are made in a timely manner. The efficiency of services involving express couriers, dial-a-ride systems, and partial-truck-load carriers might all be improved.

Narendran and colleagues have devised a computer model to investigate how companies might map out the optimum routes for their couriers.

In their model the researchers consider a single vehicle operating within a region. Each day, there are calls from customers, packages to deliver, and others to collect and deliver elsewhere. Static customer requests are those that are known in advance, while dynamic requests arise as the day progresses. The vehicle starts from the depot, moves to serve static customers according to a schedule of advance requests. As the day progresses, new requests come in and the dispatcher has to re-route to fulfil these new requests while minimising the total distance travelled in accommodating advance bookings.

The vehicle then follows the latest determined route until a new dynamic request arrives. At that time, the vehicle is between the start and finish of the original plan. Now the plan has to add a pickup and delivery point into the unexecuted part of the plan so that the additional distance to be travelled is minimised. At this juncture, the computer model inserts a heuristic – a rule of thumb. In one method, the customer's new request is positioned appropriately between two of the places to be visited as per the original plan. In the second approach, the entire sector remaining to be served is reframed with the inclusion of the new request; this part of the problem is solved afresh using an optimization approach.

The team has carried out tests of the model computationally and found that the distance travelled by the vehicle increases with increasing numbers of new requests. However, the heuristics can work in real-time and every time a new request arises, they can process the information and re-route the vehicle to keep the total distance as low as possible.

The team points out that their system will not only help courier companies but could be used equally well by dial-a-ride services, which fill the gap between public transport and taxi cabs, fast food and groceries home deliveries, emergency service responses, including fire, police, and ambulance, repair services, and perhaps even parcel and mail delivery services.