MATHEMATICAL MODELS IN LOGISTIC SYSTEM DESIGN

The major goal of this paper is to underline the contribution of computer technology and quantitative methods to the development of logistics. After recalling the basic concepts of physical distribution and their evolution, the structure of a logistic system and the links with the business functions are illustrated. Then, the fundamental mathematical models, both for the logistic network design and for some key decision problems in logistic system design, are analyzed and discussed.

[1]  R. Burkard,et al.  A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .

[2]  B. M. Khumawala.  An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[3]  Andrew Kusiak,et al.  The facility layout problem , 1987 .

[4]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[5]  Marius M. Solomon,et al.  On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[8]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[9]  G. Lapalme,et al.  A parallel insert method for the capacitated arc routing problem , 1984 .

[10]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[11]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[12]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[13]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[14]  Larry P. Ritzman.  The Efficiency of Computer Algorithms for Plant Layout , 1972 .

[15]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[16]  Alexander H. G. Rinnooy Kan,et al.  Hierarchical vehicle routing problems , 1984, Networks.

[17]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

[18]  J. Heskett,et al.  Business logistics : physical distribution and materials management , 1973 .

[19]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[21]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[22]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[23]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[24]  B. P. Dzielinski,et al.  Optimal Programming of Lot Sizes, Inventory and Labor Allocations , 1965 .

[25]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[26]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[27]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[28]  Ronald H. Ballou.  Reformulating a Logistics Strategy: A Concern for the Past, Present and Future , 1981 .

[29]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[30]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[31]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[32]  D E Cullen,et al.  ALGORITHM FOR TRANSPORTATION ROUTING AND VEHICLE LOADING , 1975 .

[33]  Peter Duchessi,et al.  Microcomputer Graphics in Support of Vehicle Fleet Routing , 1985 .

[34]  A La Bella,et al.  Freight Transport Planning and Logistics , 1988 .

[35]  Vincent A. Mabert,et al.  SAMPLING AS A SOLUTION METHODOLOGY , 1977 .

[36]  Willard I. Zangwill,et al.  A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..

[37]  C. D. J. Waters.  A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement , 1987 .

[38]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

[39]  Harilaos N. Psaraftis.  On the practical importance of asymptotic optimality in certain heuristic algorithms , 1984, Networks.

[40]  Roger C. Vergin,et al.  Comparison of Computer Algorithms and Visual Based Methods for Plant Layout , 1975 .

[41]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[42]  Moshe Dror,et al.  A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..

[43]  H. Sherali,et al.  Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .