This paper proposes an algorithm for delivery route optimization problems
and describes its application to real problems in Japanese banks.
For delivery route optimization problems in the real world,
an algorithm is required to minimize the number of routes
while handling various complicated constraints.
Techniques for modeling real problems with an abstract model
provided by the algorithm are also required.
The algorithm proposed in this paper provides a model and constraints
that were designed for describing real problems,
such as deliveries from multiple depots, time windows of customers, and
reuse of vehicles.
A mechanism for minimizing number of routes used by
the algorithm, called the {\em objective tuning method},
guides local search so that selected routes will shrink and disappear.
Through case studies of logistics problems in Japanese banks,
the algorithm is shown to be capable of modeling and solving real problems.
By: H. Okano
Published in: RT0309 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .