In order to make milk run (MR) effective in current business environments characterized by uncertainty and growing complexity, models are needed that capture the different elements of such a strategy and their interactions. Among them, order assignment to vehicles and dispatching are key operational planning decisions and their integration in a single model still needs attention by researchers. Thus, this paper presents a pickup MR model that finds the order assignment and routing strategies optimizing transportation and vehicle stopping costs. A mixed integer programming (MIP) model is developed and compared with a hybrid genetic local search algorithm (HGSA). The HGSA, that performed better than MIP in terms of elapsed time for large problems, is applied to the case of an Italian manufacturing company. The outcomes show a reduced distribution cost compared with the total material cost and high vehicle utilization rates. Future research will test and validate the model in multiple application settings.

A MULTI-CAPACITY INTEGRATED VEHICLE ROUTING AND LOADING MODEL FOR PICKUP MILK RUN / Yilmaz Eroglu, Duygu; Cagliano, ANNA CORINNA; Rafele, Carlo. - In: INTERNATIONAL JOURNAL OF MECHANICS AND CONTROL. - ISSN 1590-8844. - STAMPA. - 18:2(2017), pp. 107-121.

A MULTI-CAPACITY INTEGRATED VEHICLE ROUTING AND LOADING MODEL FOR PICKUP MILK RUN

Anna Corinna Cagliano;Carlo Rafele
2017

Abstract

In order to make milk run (MR) effective in current business environments characterized by uncertainty and growing complexity, models are needed that capture the different elements of such a strategy and their interactions. Among them, order assignment to vehicles and dispatching are key operational planning decisions and their integration in a single model still needs attention by researchers. Thus, this paper presents a pickup MR model that finds the order assignment and routing strategies optimizing transportation and vehicle stopping costs. A mixed integer programming (MIP) model is developed and compared with a hybrid genetic local search algorithm (HGSA). The HGSA, that performed better than MIP in terms of elapsed time for large problems, is applied to the case of an Italian manufacturing company. The outcomes show a reduced distribution cost compared with the total material cost and high vehicle utilization rates. Future research will test and validate the model in multiple application settings.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11583/2703810
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo