Skip to main content

Routing for the Milk-Run Pickup System in Automobile Parts Supply

  • Conference paper

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 66))

Abstract

An optimization-based approach is developed for routing a just-in-time (JIT) supply system, which requires for high-frequency, small quantity deliveries. The mathematical model called common frequency routing problem (CFR) is formulated. To solve the model, tabu search strategies have been developed. The utility of the approach is demonstrated through a computational experiment. The result shows that in the same demand conditions, the total transport distance is shorten, the total times of vehicle trips is reduced and side inventory decreases.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   389.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   499.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Chuah, K.H., Yingling, J.C.: Routing for a Just-in-Time supply pickup and delivery system. Transportation Science 39(3), P328–P339 (2005)

    Article  Google Scholar 

  • Chuah, K.H., Yingling, J.C.: Analyzing Inventory/Transportation Cost Tradeoffs for Milkrun Parts Delivery Systems to Large JIT Assembly Plants. SAE Technical paper series, 2001-01-2600

    Google Scholar 

  • Chuah, K.H.: Optimization and simulation of just-in-time supply pickup and delivery systems, University of Kentucky (2004)

    Google Scholar 

  • Du, T., Wang, F.K., Lu, P.-Y.: A real time vehicle-dispatching system for consolidating milk runs. Transportation Research part E, P1–P13 (2006)

    Google Scholar 

  • Jin, M., Liu, K., Bowden, R.O.: A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. Production Economics, 228–242 (2007)

    Google Scholar 

  • Barbarosoglu, G., Ozgur, D.: A Tabu search algorithm for the vehicle routing problem. Computers & Operations Research 26, 255–270 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Taillard, E., Badeau, P.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31(2), P170–P186 (1997)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, Z., Huang, Y., Wang, J. (2010). Routing for the Milk-Run Pickup System in Automobile Parts Supply. In: Huang, G.Q., Mak, K.L., Maropoulos, P.G. (eds) Proceedings of the 6th CIRP-Sponsored International Conference on Digital Enterprise Technology. Advances in Intelligent and Soft Computing, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10430-5_97

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10430-5_97

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10429-9

  • Online ISBN: 978-3-642-10430-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics