An Infeasible Space Exploring Matheuristic for the Production Routing Problem

Author(s):  
Eleftherios G. Manousakis ◽  
Grigoris A. Kasapidis ◽  
Chris T. Kiranoudis ◽  
Emmanouil E. Zachariadis
Author(s):  
Yuzhuo Qiu ◽  
Dan Zhou ◽  
Yanan Du ◽  
Jie Liu ◽  
Panos M. Pardalos ◽  
...  

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mohammad Ali Beheshtinia ◽  
Narjes Salmabadi ◽  
Somaye Rahimi

Purpose This paper aims to provide an integrated production-routing model in a three-echelon supply chain containing a two-layer transportation system to minimize the total costs of production, transportation, inventory holding and expired drugs treatment. In the proposed problem, some specifications such as multisite manufacturing, simultaneous pickup and delivery and uncertainty in parameters are considered. Design/methodology/approach At first, a mathematical model has been proposed for the problem. Then, one possibilistic model and one robust possibilistic model equivalent to the initial model are provided regarding the uncertain nature of the model parameters and the inaccessibility of their probability function. Finally, the performance of the proposed model is evaluated using the real data collected from a pharmaceutical production center in Iran. The results reveal the proper performance of the proposed models. Findings The results obtained from applying the proposed model to a real-life production center indicated that the number of expired drugs has decreased because of using this model, also the costs of the system were reduced owing to integrating simultaneous drug pickup and delivery operations. Moreover, regarding the results of simulations, the robust possibilistic model had the best performance among the proposed models. Originality/value This research considers a two-layer vehicle routing in a production-routing problem with inventory planning. Moreover, multisite manufacturing, simultaneous pickup of the expired drugs and delivery of the drugs to the distribution centers are considered. Providing a robust possibilistic model for tackling the uncertainty in demand, costs, production capacity and drug expiration costs is considered as another remarkable feature of the proposed model.


Author(s):  
Bi Kouaï Bertin Kayé ◽  
Moustapha Diaby ◽  
Tchimou N’Takpé ◽  
Souleymane Oumtanaga

Author(s):  
Zhenzhen Zhang ◽  
Zhixing Luo ◽  
Roberto Baldacci ◽  
Andrew Lim

The production routing problem (PRP) arises in the applications of integrated supply chain which jointly optimize the production, inventory, distribution, and routing decisions. The literature on this problem is quite rare due to its complexity. In this paper, we consider the multivehicle PRP (MVPRP) with order-up-to-level inventory replenishment policy, where every time a customer is visited, the quantity delivered is such that the maximum inventory level is reached. We propose an exact Benders’ decomposition approach to solve the MVPRP, which decomposes the problem as a master problem and a slave problem. The master problem decides whether to produce the product, the quantity to be produced, and the customers to be replenished for every period of the planning horizon. The resulting slave problem decomposes into a capacitated vehicle routing problem for each period of the planning horizon where each problem is solved using an exact algorithm based on the set partitioning model, and the identified feasibility and optimality cuts are added to the master problem to guide the solution process. Valid inequalities and initial optimality cuts are used to strengthen the linear programming relaxation of the master formulation. The exact method is tested on MVPRP instances and on instances of the multivehicle vendor-managed inventory routing problem, a special case of the MVPRP, and the good performance of the proposed approach is demonstrated.


2017 ◽  
Vol 87 ◽  
pp. 114-124 ◽  
Author(s):  
Oğuz Solyalı ◽  
Haldun Süral

Omega ◽  
2019 ◽  
Vol 86 ◽  
pp. 154-172 ◽  
Author(s):  
Fábio Neves-Moreira ◽  
Bernardo Almada-Lobo ◽  
Jean-François Cordeau ◽  
Luís Guimarães ◽  
Raf Jans

2019 ◽  
Vol 8 (2) ◽  
pp. 104
Author(s):  
Novi Rustiana Dewi ◽  
Eka Susanti ◽  
Eddy Roflin ◽  
Tiara Bella Octalia ◽  
Rika Novita Rika Novita

Industri tempe Ana adalah sebuah industri rumah tangga yang berada di Kota Palembang. Tempe produksi  Ana dikemas dalam tiga kemasan yaitu tempe daun, tempe plastik kepingan dan tempe plastik batangan, pada makalah ini diterapkan model PRPPI untuk jenis kemasan tempe daun. Tempe adalah salah satu produk yang bersifat mudah rusak (perishable). Penelitian ini bertujuan untuk meminimalkan biaya produksi, mendapatkan rute dan jumlah produksi tempe optimal menggunakan model Production Routing Problem Perishable Inventory (PRPPI) dengan kebijakan inventory Optimized Delivery–Optimized Selling (OD-OS). Model linier PRPPI diselesaikan menggunakan software Lingo 17. Diperoleh biaya produksi optimal adalah Rp 84.701. Rute optimal pendistribusian adalah Depot ? pasar Perumnas ? pasar Sekip Ujung ? pasar Kebon Semai ? Depot.  Jumlah produksi optimal adalah 27 potong.


Sign in / Sign up

Export Citation Format

Share Document