The Case Study of Implementing the Delivery Optimization System at a Fast-Moving Consumer Goods Distributer
Abstract
Using new optimization methods and information-communications technology has become the key issue in the competition among the distributers of fast-moving consumer goods. Introducing a delivery optimization system instead of manual routing enables significant cost savings. The prerequisites for optimization are stable information system and efficient company management. The rich vehicle routing problem model is discussed and the effects of implementing the delivery optimization system are presented. For four years of continuous utilisation, the system has helped the distributer to reduce the overall distribution costs. It also made possible to close down several depots and handle more customer requests without investing in the vehicle fleet. The developed optimization system enabled the distributer to adapt to the new distribution schedule and react to first indicators of recession very fast.
References
Toth, P. and Vigo, D.: The Vehicle Routing Problem. Philadelphia: Society for Industrial and Applied Mathematics; 2002.
Braysy, O., et al.: An optimization approach for communal home meal delivery service: A case study. Journal of Computational and Applied Mathematics, 2009. 232(1): pp. 46-53
Braysy, I. and Gendreau, M.: Vehicle routing problem with time windows, part 1: Route construction and local search algorithms. Transportation Science, 2005. 39(1): pp. 104-118
Braysy, I. and Gendreau, M.: Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 2005. 39(1): pp. 119-139
Pisinger, D. and Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research, 2007. 34(8): pp. 2403-2435
Braysy, O., Dullaert, W. and Nakari, P.: The potential of optimization in communal routing problems: case studies from Finland. Journal of Transport Geography, 2009. 17(6): pp. 484-490
Dantzig, G.B. and Ramser, J.H.: The Truck Dispatching Problem. Management Science, 1959. 6(1): pp. 80-91
Solomon, M.M., Algorithms for the Vehicle-Routing and Scheduling Problems with Time Window Constraints. Operations Research, 1987. 35(2): pp. 254-265
Taner, F., Galic, A. and Caric, T.: Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms. Promet-Traffic & Transportation, 2012. 24(4): pp. 343-351
Wassan, N.A. and Osman, I.H.: Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society, 2002. 53(7): pp. 768-782
Brandao, J.: A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 2009. 195(3): pp. 716-728
Laporte, G.: Integer Programming Formulations for the Multi-Depot Vehicle-Routing Problem - Comments. European Journal of Operational Research, 1989. 38(2): pp. 227-227
Crevier, B., Cordeau, J.F. and Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research, 2007. 176(2): pp. 756-773
Repoussis, P., Tarantilis, C. and Ioannou, G.: A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem, in Numerical Methods and Applications, Boyanov, T. et al., Editors. 2007, Springer Berlin Heidelberg. pp. 247-254
Fischetti, M., González, J.J.S. and Toth, P.: Experiments with a multi-commodity formulation for the Symmetric Capacitated Vehicle Routing Problem. 1995.
Eksioglu, B., Vural, A.V., and Reisman, A.: The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 2009. 57(4): pp. 1472-1483
Focacci, F., Lodi, A. and Milano, M.: A hybrid exact algorithm for the TSPTW. Informs Journal on Computing, 2002. 14(4): pp. 403-417
Mireo. Available from: www.mireo.hr.
Russell, R.A.: Hybrid Heuristics for the Vehicle-Routing Problem with Time Windows. Transportation Science, 1995. 29(2): pp. 156-166
Nagata, Y. and Braysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Research Letters, 2009. 37(5): pp. 333-338
Mladenovic, N. and Hansen, P.: Variable neighborhood search. Computers & Operations Research, 1997. 24(11): pp. 1097-1100
Jacobsen, S.K. and Madsen, O.B.G.: A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research, 1980. 5(6): pp. 378-387
Crainic, T., et al.: Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem, in Evolutionary Computation in Combinatorial Optimization, Merz, P. and Hao, J.-K. Editors. 2011, Springer Berlin Heidelberg. pp. 179-190
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
