An integrated material handling system for a truck assembly plant

The paper attempts to develop a more comprehensive analytical framework for examining the relative merits of alternative material handling and inventory strategies for a truck assembly plant. This model can be used to minimise handling in delivering requirements from the warehouse to the assembly line and from the unpacking area to the warehouse. The model is also designed to look at arrangements of the storage areas to increase the efficiency of material management. This model is based on extensions of the Vehicle Routing Problem. Solutions to the model have been obtained by an implementation of a Genetic Algorithm. The historical demand data of the plant are used to simulate and analyse the different strategies to statistically determine the best material handing and inventory strategies for the truck assembly plant. As a result of implementation, the efficiency of the current system has been increased by about 30%.

[1]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[2]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[3]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[4]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[5]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[6]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[7]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[10]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[11]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[12]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[13]  Nagraj Balakrishnan,et al.  Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows , 1993 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Yves Rochat,et al.  A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland , 1994 .

[16]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[17]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[18]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[19]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[20]  Gilbert Laporte,et al.  A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems , 1992 .

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .