The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs
| Autor: | Wout Dullaert, Annelieke C. Baller, Daniele Vigo, Said Dabia |
|---|---|
| Přispěvatelé: | Baller, Annelieke C., Dabia, Said, Dullaert, Wout E.H., Vigo, Daniele, Operations Analytics, Amsterdam Business Research Institute |
| Rok vydání: | 2019 |
| Předmět: |
Schedule
Information Systems and Management General Computer Science Operations research Computer science 0211 other engineering and technologies Logistics 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering Branch-and-Cut-and-Price Transportation costs Set (abstract data type) 0502 economics and business Joint replenishment Logistic 050210 logistics & transportation Sequence Fixed fee 021103 operations research 05 social sciences Incentive Modeling and Simulation Dynamic demand Value (economics) Joint (building) Routing (electronic design automation) |
| Zdroj: | Baller, A C, Dabia, S, Dullaert, W E H & Vigo, D 2019, ' The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs ', European Journal of Operational Research, vol. 276, no. 3, pp. 1013-1033 . https://doi.org/10.1016/j.ejor.2019.01.070 European Journal of Operational Research, 276(3), 1013-1033. Elsevier |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/j.ejor.2019.01.070 |
| Popis: | In a vendor-managed inventory setting, a supplier determines the timing and size of replenishments for its customers. In the Dynamic-Demand Joint Replenishment Problem (DJRP), one assumes that the supplier pays a fixed fee for replenishing a customer which often occurs if the supplier outsources transportation. Hence, there is no incentive for the supplier to schedule replenishments for nearby customers in the same period. This results in higher transportation costs for the carrier, decreased vehicle utilization and increased future fees for the supplier. To lower costs for both parties, this paper extends the traditional DJRP to the DJRP with Approximated Transportation Costs (DJRP-AT) by taking transportation considerations into account. Since routing problems are difficult to solve and it is not necessary to know the sequence of the deliveries to the customers as these are outsourced, the transportation costs for a given set of customers are approximated using classical schemes. A solution approach for the DJRP-AT based on Branch-and-Cut-and-Price is validated using test instances from the literature. Results show improvements of 4% on average and up to 14.4% for individual instances compared with the DJRP. Moreover, when the DJRP-AT is compared with the DJRP on instances derived from a real-life case, similar savings are obtained. Comparing the DJRP-AT to an equivalent problem with actual routing costs, the solution values of the DJRP-AT are on average only 0.77% higher showing the value of the approximation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect