A Mathematical Model to Optimize Transport Cost and Inventory Level in a Single Level Logistic Network

This paper proposes a mathematical model that minimizes transportation costs and optimizes distribution organization in a single level logistic network. The objective is to allocate customers to distribution centers and vehicles to travels in order to cut down the traveled distances, while observing the storage capacities of vehicles and distribution centers and covering the customers’ needs. We propose a mixed integer programming formula that can be solved using Lingo 14.0. A digital example will be given in the end to illustrate the practicability of the model.

[1]  Sunil Chopra,et al.  Designing the distribution network in a supply chain , 2003 .

[2]  Teresa Murino,et al.  The location - routing problem: an innovative approach , 2007 .

[3]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[4]  Rudini Menezes Sampaio,et al.  A hybrid algorithm for the vehicle routing problem with window , 2015 .

[5]  Lee Luong,et al.  Optimization/simulation modelling of the integrated production-distribution plan: an innovative survey , 2008 .

[6]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[7]  Paolo Toth,et al.  An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..

[8]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[9]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[10]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[11]  Donald Davendra,et al.  Traveling Salesman Problem, Theory and Applications , 2010 .

[12]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[13]  Exnar Filip.  The Travelling Salesman Problem and its Application in Logistic Practice , 2011 .

[14]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[15]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[16]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[17]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..