|
[an error occurred while processing this directive]
|
|
A Tabu-based Search Heuristic for Vehicle Routing in a
Just-In-Time Production System
The Department of Management Sciences
The University of Iowa
Friday, December 01, 2006
4:00-4:50pm,
61 SH
Abstract
Vehicle routing problems are a well-known class of NP-hard
combinatorial optimization problems. We consider a vehicle routing
problem enriched by supply chain considerations of a lean production
system. In this problem, motivated by Toyota's northern Kentucky auto
manufacturing operations, we seek a routing design for a fleet of
vehicles throughout a network of regional suppliers that adheres to
the just-in-time philosophy. The pursuit of low work-in-process
inventory and production leveling throughout the system introduces
complicating side constraints creating a vehicle routing problem with
time windows and split deliveries. We present a tabu-based search
heuristic and compare results to benchmarks.
|
