Development and Application of Milk-Run Distribution Systems in the Express Industry Based on Saving Algorithm

You, Zhenlai; Jiao, Yang

doi:10.1155/2014/536459

Cited by 18 publications

(11 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…e GA results indicate that the use of GA can produce a near-optimal solution and significantly reduce lower supply chain costs. You and Jiao et al [47] presented the milk run distribution problem of the express company. ey improved the traditional Clarke and Wright's algorithm and then tested the algorithm with 10 distribution nodes.…”

Section: Literature Reviewmentioning

confidence: 99%

A Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithm

Kocaoğlu

Çakmak

Gümüş

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Managing the distribution of goods is a vital operation for many companies. A successful distribution system requires an effective distribution strategy selection and optimum route planning at the right time and minimum cost. Furthermore, customer’s demand and location can vary from order to order. In this situation, a mixed delivery system is a good solution for it and allows the use of different strategies together to decrease delivery costs. Although the “distribution strategy selection” is a critical issue for companies, there are only a few studies that focus on the mixed delivery network problem. There is a need to propose an efficient solution for the mixed delivery problem to guide researchers and practitioners. This paper develops a new “modified” savings-based genetic algorithm which is named “distribution strategy selection and vehicle routing hybrid algorithm (DSSVRHA).” Our new algorithm aims to contribute to the literature a new hybrid solution to solve a mixed delivery network problem that includes three delivery modes: “direct shipment,” “milk run,” and “cross-docking” efficiently. It decides the appropriate distribution strategy and also optimal routes using a heterogeneous fleet of vehicles at minimum cost. The results of the hybrid algorithm are compared with the results of the optimization model. And the performance of the hybrid algorithm is validated with statistical analysis. The computational results reveal that our developed algorithm provides a good solution for reducing the supply chain distribution costs and computational time.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithm

Kocaoğlu

Çakmak

Gümüş

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Egy harmony search és szimulált lehűtés alapján készült hibrid metaheurisztikus megoldás képezi az alapját a [6] szakirodalmi forrásban tárgyalt algoritmusnak, mely segítségével a szerzők egy üzemen kívüli milkrun anyagellátási rendszert és egy crossdocking létesítményt tartalmazó ellátási lánc optimalizálására mutatnak példát. A C-W saving algoritmus alkalmazására találhatunk példát az [7] forrásban, ahol egy a járatok úthosszát és az üzemeltetési költséget minimalizáló tervezési módszer kerül ismertetésre. Egy dinamikus optimalizálási feladat példáján keresztül szemlélteti a [8] szakirodalmi forrás a hangyafarm algoritmus alkalmazhatóságát.…”

Section: Szakirodalmi áTtekintésunclassified

Milkrun útvonalak optimalizálása egy autóipari beszállítónál

Francuz

Bányai

2020

MDT

View full text Add to dashboard Cite

A cikk témája az autóipari beszállítóknál alkalmazott Milkrun útvonalak optimalizálása az idő függvényében. A létrehozott metódus első esetben egy Milkrun útvonalra hajtja végre az optimalizálást, majd ezt kiterjeszti több útvonalra annak érdekében, hogy az adott időkorlátnak megfeleljen az optimalizálás. Az optimalizálási folyamat és annak megvalósíthatósága egy konkrét számpéldán keresztül lesz bemutatva.

show abstract

“…Accordingly, constraint (8) states that the total cost per minute in period l. Constraint (9) indicates the total number of additional trailers used is limited by the total number of additional trailers on hand, at each period. Constraint (10) and (11) state the number of additional trailers and additional trailer type used are bounded by the upper-bound values for each AGV at each period. Constraint (12) is the sign constraints.…”

Section: Proposed Mathematical Modelmentioning

confidence: 99%

A Mathematical Model for In-Plant Milk-Run Routing

Sipahioglu¹,

Altin²

2019

Pamukkale J Eng Sci

View full text Add to dashboard Cite

ÖzMilk-run is one of the lean logistics implementations defined as a cyclic materials delivering system. In-plant milk-run system, a variant of milkrun, runs for the delivering materials within the plant from warehouse to assembly stations in a cyclic manner. It is implemented using Automated Guided Vehicles (AGV), which provide automated materials handling in plant. In this study, in-plant milk-run system is discussed and the importance of determining milk-run routes and period is emphasized. A mixed integer mathematical model is proposed for the determination of milk-run routes and its period simultaneously for AGVs. Besides, the mathematical model allows split deliveries for assembly stations. The proposed model is coded using GAMS software and the success of this model is shown on randomly generated test problems. The proposed model obtains the optimal solution approximately in 1 second for generated two test problems. This points out the advantage and practicability of the proposed mathematical model for in-plant milk-run system. Milk-run döngüsel malzeme taşıma sistemi olarak yalın lojistik uygulamalarından birisidir. Milk-run'ın bir çeşidi olan fabrika içi milkrun sistemi, fabrika içinde depodan montaj istasyonlarına döngüsel bir yaklaşımla malzeme taşıması için çalışır. Fabrika içi milk-run sistemi fabrikada malzemelerin otomatik olarak elleçlenmesini sağlayan otomatik yönlendirilmiş araçlar (OYA) kullanılarak gerçekleştirilir. Bu çalışmada, fabrika içi milk-run sistemi ele alınmış ve milk-run rotalarının ve periyodunun belirlenmesinin önemi vurgulanmıştır. OYA'ların milk-run rotalarını ve periyotlarını eş zamanlı olarak belirlemek için bir karma matematiksel model önerilmektedir. Matematiksel model aynı zamanda montaj istasyonları için bölünmüş teslimatlara izin vermektedir. Önerilen model GAMS yazılımı kullanılarak kodlanmış ve modelin başarısı rassal olarak türetilen test problemleri üzerinde gösterilmiştir. Önerilen model, türetilen test problemlerinin en iyi çözümünü yaklaşık 1 saniye içinde elde etmiştir. Bu durum, fabrika içi milk-run sistemi için önerilen matematiksel modelin avantajını ve uygulanabilirliğini göstermektedir.

show abstract

Development and Application of Milk-Run Distribution Systems in the Express Industry Based on Saving Algorithm

Cited by 18 publications

References 13 publications

A Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithm

A Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithm

Milkrun útvonalak optimalizálása egy autóipari beszállítónál

A Mathematical Model for In-Plant Milk-Run Routing

Contact Info

Product

Resources

About