The University of Southampton
University of Southampton Institutional Repository

Exact and approximate algorithms for the inventory routing problem

Exact and approximate algorithms for the inventory routing problem
Exact and approximate algorithms for the inventory routing problem
In this thesis we develop exact and approximate algorithms for the inventory routing problem (IRP). The inventory routing problem is one of deciding an optimal delivery policy for a set of customers through a given planning period. Customers can hold inventory and do not need deliveries every day. Deliveries are carried out by a fleet of homogeneous vehicles that must be routed to travel a minimum distance while visiting all customers scheduled for that day. Decisions concern which customers to be visited and how much to deliver to each of them must be taken. A new formulation for the IRP is presented as a mixed integer programming model. This new approach allows split deliveries so customers can receive the inventory through more than one vehicle during the same day. It also seeks periodic solutions through a given planning period. Although throughout our research the planning period is fixed, all algorithms presented in this thesis can be applied to any length of the planning period. Special cases for this problem are also considered and optimal polynomial algorithms have been developed. We develop four constructive heuristics for the inventory routing problem. These heuristics are based on a schedule-first route-second approach. First, a decision is made on which customers to visit each day, and how much inventory they should receive on each delivery. Then, a vehicle routing problem is solved for each day to perform the deliveries to the customers. Several experiments are carried out to compare the performance of each heuristic. An iterated local search method is then applied to the best solution obtained with these heuristics. The local search is based on node interchange and aims to reduce the number of routes per day as well as the total distance travelled. Extensive computational tests are carried out to asses the effectiveness of this local search procedure.
Cabo Nodar, Marta
17fab2bf-37d3-42bf-acdc-20d5bf3d59d1
Cabo Nodar, Marta
17fab2bf-37d3-42bf-acdc-20d5bf3d59d1

Cabo Nodar, Marta (2003) Exact and approximate algorithms for the inventory routing problem. University of Southampton, School of Mathematics, Doctoral Thesis, 190pp.

Record type: Thesis (Doctoral)

Abstract

In this thesis we develop exact and approximate algorithms for the inventory routing problem (IRP). The inventory routing problem is one of deciding an optimal delivery policy for a set of customers through a given planning period. Customers can hold inventory and do not need deliveries every day. Deliveries are carried out by a fleet of homogeneous vehicles that must be routed to travel a minimum distance while visiting all customers scheduled for that day. Decisions concern which customers to be visited and how much to deliver to each of them must be taken. A new formulation for the IRP is presented as a mixed integer programming model. This new approach allows split deliveries so customers can receive the inventory through more than one vehicle during the same day. It also seeks periodic solutions through a given planning period. Although throughout our research the planning period is fixed, all algorithms presented in this thesis can be applied to any length of the planning period. Special cases for this problem are also considered and optimal polynomial algorithms have been developed. We develop four constructive heuristics for the inventory routing problem. These heuristics are based on a schedule-first route-second approach. First, a decision is made on which customers to visit each day, and how much inventory they should receive on each delivery. Then, a vehicle routing problem is solved for each day to perform the deliveries to the customers. Several experiments are carried out to compare the performance of each heuristic. An iterated local search method is then applied to the best solution obtained with these heuristics. The local search is based on node interchange and aims to reduce the number of routes per day as well as the total distance travelled. Extensive computational tests are carried out to asses the effectiveness of this local search procedure.

Text
00279722.pdf - Other
Restricted to Repository staff only

More information

Published date: September 2003
Organisations: University of Southampton

Identifiers

Local EPrints ID: 50599
URI: https://eprints.soton.ac.uk/id/eprint/50599
PURE UUID: 1cdb7b8f-c1ee-4bbd-afb3-5a1a033f2b0a

Catalogue record

Date deposited: 19 Mar 2008
Last modified: 13 Mar 2019 20:51

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×