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

Jiang, Zuhua; Huang, Yongwen; Wang, Jinlan

doi:10.1007/978-3-642-10430-5_97

Cited by 7 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In each flow, a vehicle must first pick up products from suppliers, then deliver goods to corresponding plants, and finally return to the departure point. To ensure that this process is conducted in an orderly manner, (10)- (11) restrict each vehicle to one single route from the plants to the suppliers, and vice versa. Equation (12) ensures that the solution does not contain any illegal isolated subtour.…”

Section: The Proposed Mathematical Model For Mm-mrp-picmentioning

confidence: 99%

“…These achievements of VRP have been already applied in the Milk-run system. Chuah and Yingling [10] and Jiang et al [11] studied the common frequency routing problem in the Milk-run system and minimized transportation and inventory costs using column generation combined with the tabu search algorithm. Using genetic algorithm and a robust optimization approach, Sadjadi et al [2] and Jafari-Eskandari et al [12,13] solved general and specific Milk-run issues with time windows and inventory uncertainty.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

Lin

Bian

Sun

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In recent years, logistics systems with multiple suppliers and plants in neighboring regions have been flourishing worldwide. However, high logistics costs remain a problem for such systems due to lack of information sharing and cooperation. This paper proposes an extended mathematical model that minimizes transportation and pipeline inventory costs via the many-to-many Milk-run routing mode. Because the problem is NP hard, a two-stage heuristic algorithm is developed by comprehensively considering its characteristics. More specifically, an initial satisfactory solution is generated in the first stage through a greedy heuristic algorithm to minimize the total number of vehicle service nodes and the best insertion heuristic algorithm to determine each vehicle’s route. Then, a simulated annealing algorithm (SA) with limited search scope is used to improve the initial satisfactory solution. Thirty numerical examples are employed to test the proposed algorithms. The experiment results demonstrate the effectiveness of this algorithm. Further, the superiority of the many-to-many transportation mode over other modes is demonstrated via two case studies.

show abstract

Section: The Proposed Mathematical Model For Mm-mrp-picmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

Lin

Bian

Sun

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The synchronization system called progress line. Progress line system is actually just-in-time system where there is no delay for parts supplied to the production line, hence the factory must have good document control and supporting information technology [9]. ADM has already been providing high quality, lower cost and short response times in achieving satisfactory and efficient logistics services.…”

Section: Introductionmentioning

confidence: 99%

Management and Production Engineering Review

Purba,

Fitra,

Nindiani

2019

View full text Add to dashboard Cite

The implementation of milk-run in Indonesia has been started since 2005. As a developing country, there is a challenge to operate milk-run smoothly especially in urban area due to severe traffic congestion and unfavourable road condition in some areas. This research aimed to analyze the practice of milk-run operation in one of the biggest Japanese automotive companies in Indonesia. Transportation Value Stream Mapping (TVSM) is applied in order to perform just-in-time delivery in the supply chain before operating milk-run. It is discussed that this company still need to continue in improving milk-run operation. The operation system needs control and integration from manufacturer, supplier and logistics partner. The advantage of milk-run operation is cost reduction and also support green logistics in decreasing emission of carbondioxide (CO 2 ) by reducing the number of trucks used.

show abstract

Milk-run routing problem with progress-lane in the collection of automobile parts

et al. 2019

View full text Add to dashboard Cite

In recent years, the automotive industry has faced an unprecedented crisis. In particular, the zero-inventory approach, which has been widely pursued by many automobile companies, seems to be impractical in some real production contexts since it requires an inventory of all parts but in low amounts. In this paper, we investigate a new logistics method which collects automobile parts by integrating the progress-lane (P-LANE) into the corresponding vehicle routing problem. We propose a mixed integer programming formulation for this new model, which can simultaneously determines the trip routes to collect automobile parts, as well as the PLANE that each collected part should be assigned to, so as to minimize the total costs of the production and inbound logistics. The comparison with the zero-inventory model shows that the use of the PLANE within the milk-run system could significantly decrease the total costs and also improve the transportation efficiency. To be specific, for small and large size instances, the total costs of the zero-inventory model are about 10% and 30% higher than the ones with PLANE , respectively, which suggests that the periodic part collection model with PLANE could be more appropriate for automobile manufacturing.

show abstract

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

Cited by 7 publications

References 5 publications

A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

Management and Production Engineering Review

Milk-run routing problem with progress-lane in the collection of automobile parts

Contact Info

Product

Resources

About