A multi-phase heuristic for the production routing problem

Date

2017-11-01

Author

Solyali, Oguz
Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

237
views

0
downloads

This study considers the production routing problem where a plant produces and distributes a single item to multiple retailers over a multi-period time horizon. The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers is minimized. A multi-phase heuristic is proposed for the problem. The proposed heuristic is a mathematical programming-based heuristic that relies on formulating and solving restricted versions of the problem as mixed integer programs. The computational experiments on benchmark instances show favorable results with regard to the quality of the solutions found at the expense of higher computing times on large instances. In particular, the heuristic managed to find new best solutions for the 65% of benchmark instances.

Subject Keywords

Supply chain, Production routing, Integer programming, Heuristics

URI

https://hdl.handle.net/11511/36663

Journal

COMPUTERS & OPERATIONS RESEARCH

DOI

https://doi.org/10.1016/j.cor.2017.06.007

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem Solyali, Oguz; Süral, Haldun (2011-08-01) We address a vendor-managed inventory-routing problem where a supplier ( vendor) receives a given amount of a single product each period and distributes it to multiple retailers over a finite time horizon using a capacitated vehicle. Each retailer faces external dynamic demand and is controlled by a deterministic order-up-to level policy requiring that the supplier raise the retailer's inventory level to a predetermined maximum in each replenishment. The problem is deciding on when and in what sequence to v...
An Effective Matheuristic for the Multivehicle Inventory Routing Problem Solyalı, Oguz; Süral, Haldun (2022-07-01) Copyright: © 2022 INFORMS.This study considers the multivehicle inventory routing problem in which a supplier has to build a distribution plan over a discrete time horizon to replenish a set of customers that faces a given demand. Transportation costs as well as inventory costs at the supplier and at the customers are to be minimized. A matheuristic algorithm is proposed that is based on sequentially solving different mixed integer linear programs. The algorithm merges the advantage of being easy to design ...
A MULTI OBJECTIVE MODEL FOR OPTIMIZATION OF A GREEN SUPPLY CHAIN NETWORK PAKSOY, TURAN; Ozceylan, Eren; Weber, Gerhard Wilhelm (2010-02-04) This study develops a model of a closed-loop supply chain (CLSC) network which starts with the suppliers and recycles with the decomposition centers. As a traditional network design, we consider minimizing the all transportation costs and the raw material purchasing costs. To pay attention for the green impacts, different transportation choices are presented between echelons according to their CO2 emissions. The plants can purchase different raw materials in respect of their recyclable ratios. The focuses o...
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2016-04-01) This study considers a basic inventory management problem with nonzero fixed order costs under interval demand uncertainty. The existing robust formulations obtained by applying well-known robust optimization methodologies become computationally intractable for large problem instances due to the presence of binary variables. This study resolves this intractability issue by proposing a new robust formulation that is shown to be solvable in polynomial time when the initial inventory is zero or negative. Becau...
Optimization of Supply Chain Systems with Price Elasticity of Demand Kaplan, Ugur; TÜRKAY, METİN; Karasözen, Bülent; Biegler, Lorenz T. (2011-09-01) A centralized multiechelon, multiproduct supply chain network is presented in a multiperiod setting with products that show varying demand against price. An important consideration in such complex supply chains is to maintain system performance at high levels for varying demands that may be sensitive to product price. To examine the price-centric behavior of the customers, the concept of price elasticity of demand is addressed. The proposed approach includes many realistic features of typical supply chain s...

Citation Formats

O. Solyali and H. Süral, “A multi-phase heuristic for the production routing problem,” COMPUTERS & OPERATIONS RESEARCH, pp. 114–124, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36663.