A linear MmTSP formulation of robust location-routing problem: a dairy products supply chain case study

Abstract

The location-routing problem (LRP), which integrates location and routing decisions, has been an attraction to both researchers and practitioners. LRP as an important business problem has its own inherent uncertainty; especially, considering phenomena such as traffic congestion and weather conditions and their impact on transportation costs, routing in LRP is subject to uncertainty. In this paper, we propose a multi-depot multi-travelling salesman problem (MmTSP) formulation of robust LRP (RLRP) considering uncertainty in transportation costs. In addition, an appropriate technique is utilised to linearise the RLRP model. In order to justify the applicability of the proposed model, a dairy products supply chain case study is provided. Furthermore, comprehensive numerical examples are presented to characterise the performance of the proposed model.Reference to this paper should be made as follows: Jouzdani, J. and Fathian, M. (2014) 'A linear MmTSP formulation of robust location-routing problem: a dairy products supply chain case study', Int.

The location routing problem using electric vehicles with constrained distance

“…The initial solution is generated by a heuristic, whereas routing is solved using simulated annealing. Jouzdani and Fathian (2014) model a dairy supply chain in Iran as an LRP with route-length constraints regarding the working hours. The model is solved by using the LINGO optimizer.…”

Hybrid Electromagnetism-Like Algorithm for Dynamic Supply Chain Network Design under Traffic Congestion and Uncertainty

“…where is the median of the MIC of the algorithm in the column and is that of the one mentioned in the row of the (27) for the small problem category is equal to 0.0005 and can be found in the fifth row and third column of Table 8. From this value, it can be concluded that the null hypothesis of equality of the MIC median for EMA-SA with that of EMA is rejected with 99.95% confidence.…”

“…From this value, it can be concluded that the null hypothesis of equality of the MIC median for EMA-SA with that of EMA is rejected with 99.95% confidence. Considering the alternative hypothesis in (27), it can be concluded that EMA-SA is superior to EMA according to MIC criterion.…”

“…In addition, the unavailability of historical data is a major drawback of SP methods [5]. Therefore, many authors have utilized Possibilistic Programming (PP) [5,7,23] and Scenariobased/Robust Optimization (RO) [24][25][26][27][28] for modeling the epistemic uncertainty in SCND. The reader is referred to the reviews in SCND modeling uncertainty for further reading [18,29].…”

The milk collection problem with time constraint: an optimization study integrating simulation

“…In this context, some authors have started to study the dairy transportation problem (DTP) that consists of determining the best routes to be performed for collecting milk from farms and delivering it to the processing plants (Lahrichi et al, 2015). Jouzdani and Fathian (2014) proposed a mathematical programming model combining facility location (FLP) and vehicle routing problem (VRP) in a dairy supply chain with the goal of reducing transportation costs. Such approach can solve small and medium sized problems in a reasonable amount of time.…”