An optimization-based approach is developed for routing a just-intime (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. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Jiang, Z., Huang, Y., & Wang, J. (2010). Routing for the milk-run pickup system in automobile parts supply. In Advances in Intelligent and Soft Computing (Vol. 66 AISC, pp. 1267–1275). Springer Verlag. https://doi.org/10.1007/978-3-642-10430-5_97
Mendeley helps you to discover research relevant for your work.