A two-phase iterative procedure for the production, inventory and distribution routing problem

2016 ◽  
Author(s):  
Dicky Lim Teik Kyee ◽  
Noor Hasnah Moin
Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 27
Author(s):  
Bi Kouaï Bertin Kayé ◽  
Moustapha Diaby ◽  
Moussa Koivogui ◽  
Souleymane Oumtanaga

This study aims to compare the results of a memetic algorithm with those of the two-phase decomposition heuristic on the external depot production routing problem in a supply chain. We have modified the classical scheme of a genetic algorithm by replacing the mutation operator by three local search algorithms. The first local search consists in exchanging two customers visited the same day. The second consists in trying an exchange between two customers visited at consecutive periods and the third consists in removing a customer from his current tour for a better insertion in any tour of the same period. The tests that were carried out on 128 instances of the literature have highlighted the effectiveness of the memetic algorithm developed in this work compared to the two-phase decomposition heuristic. This is reflected by the fact that the results obtained by the memetic algorithm lead to a reduction in the overall average cost of production, inventory, and transport, ranging from 3.65% to 16.73% with an overall rate of 11.07% with regard to the results obtained with the two-phase decomposition heuristic. The outcomes will be beneficial to researchers and supply chain managers in the choice and development of heuristics and metaheuristics for the resolution of production routing problem.


Exacta ◽  
2021 ◽  
Author(s):  
William De Paula Ferreira ◽  
Leonardo Carlos Da Cruz ◽  
Michael David de Souza Dutra

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Chenyin Wang ◽  
Yaodong Ni ◽  
Xiangfeng Yang

<p style='text-indent:20px;'>This study introduces an uncertain programming model for the integrated production routing problem (PRP) in an uncertain production-inventory-routing system. Based on uncertainty theory, an uncertain programming model is proposed firstly and then transformed into a deterministic and equivalent model. The study further probes into different types of replenishment policies under the condition of uncertain demands, mainly the uncertain maximum level (UML) policy and the uncertain order-up to level (UOU) policy. Some inequalities are put forward to define the UML policy and the UOU policy under the uncertain environments, and the influences brought by uncertain demands are highlighted. The overall costs with optimal solution of the uncertain decision model grow with the increase of the confidence levels. And they are simultaneously affected by the variances of uncertain variables but rely on the value of confidence levels. Results show that when the confidence levels are not less than 0.5, the cost difference between the two policies begins to narrow along with the increase of the confidence levels and the variances of uncertain variables, eventually being trending to zero. When there are higher confidence levels and relatively large uncertainty in realistic applications, in which the solution scale is escalated, being conducive to its efficiency advantage, the comprehensive advantages of the UOU policy is obvious.</p>


Sign in / Sign up

Export Citation Format

Share Document