Logistics Engineering Handbook

Introduction to Logistics Engineering Logistics from a Historical Perspective, J.L. Sutherland Economic Impact of Logistics, R.A. Wilson Logistics Engineering Tool Chest, D. Teodorovic and K. Vukadinovic Logistics Metrics, T.L. Landers, A. Mendoza, and J.R. English Logistics as an Integrating System's Function, B.S. Blanchard Logistics Activities Customer Service, R. Germain and W. Whitworth Purchasing and Sourcing, C.-G. Lee Demand Forecasting in Logistics:Analytic Hierarchy Process and Genetic Algorithm-Based Multiple Regression Analysis, W. Ho and C. Ka Man Lee Facilities Location and Layout Design, B. Montreuil Inventory Control Th eory:Deterministic and Stochastic Models, L.M.A. Chan and M. Karakul Material Handling Systems, S.S. Heragu Warehousing, G.P. Sharp Distribution System Design, M. Goetschalckx Transportation Systems Overview, J. Geunes and K. Taaffe Topics in Transportation Management Real-Time Dispatching for Truckload Motor Carriers, W.B. Powell Classic Transportation Problems, K. Bulbul, A. Sen, and G. Ulusoy Pricing and Rating, R.E. Maner, T.T. Taha, and G.L. Whicker Management of Unbalanced Freight Networks, G.D.Taylor, Jr. Revenue Management and Capacity Planning, D.R. Bish, E.K. Bish, and B. Maddah Enabling Technologies Ubiquitous Communication:Tracking Technologies within the Supply Chain, M.E. Johnson Electronic Connectivity and Software, D.M. Scott Reliability,Maintainability,and Supportability in Logistics, C.R. Cassady, E.A. Pohl, and T.G. Yeung Funding and Justifying Logistics, R.G. Ingalls, Y.-P. Leow Sehwail, and L. Sehwail Logistics and the Internet, T.G. Crainic and M.G. Speranza Emerging and Growing Trends Reverse Logistics,Green Logistics,and Packaging, J.R. Stock Global Logistics Concerns, D. Bennett and D. Gay Outsourcing and Third-Party Logistics, X. Wang and Q. Meng Brief Overview of Intermodal Transportation, T. Bektas and T.G. Crainic Logistics in Service Industries, M.D. Rossetti Securing the Supply Chain, L. Ritter Index

[1]  Ali Haghani,et al.  Genetic Algorithm for the Time-Dependent Vehicle Routing Problem , 2001 .

[2]  Gilbert Laporte,et al.  Some applications of the clustered travelling salesman problem , 2000, J. Oper. Res. Soc..

[3]  Gianpaolo Ghiani,et al.  An algorithm for the hierarchical Chinese postman problem , 2000, Oper. Res. Lett..

[4]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

[5]  Gilbert Laporte,et al.  An adaptive memory heuristic for a class of vehicle routing problems with minmax objective , 1997, Comput. Oper. Res..

[6]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[7]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[8]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[9]  Wen Lea Pearn,et al.  Algorithms for the rural postman problem , 1995, Comput. Oper. Res..

[10]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[11]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[12]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

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

[14]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[15]  Giovanni Righini,et al.  Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery , 2007, Comput. Oper. Res..

[16]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

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

[18]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[19]  Ton Volgenant,et al.  The symmetric clustered traveling salesman problem , 1985 .

[20]  Refael Hassin,et al.  Approximation algorithms for some vehicle routing problems , 2005, Discret. Appl. Math..

[21]  Moshe Dror,et al.  Postman tour on a graph with precedence relation on arcs , 1987, Networks.

[22]  Greg N. Frederickson,et al.  Approximation Algorithms for Some Postman Problems , 1979, JACM.

[23]  Peter Brucker.  The Chinese Postman Problem for Mixed Graphs , 1980, WG.

[24]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[25]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[26]  José-Manuel Belenguer,et al.  A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..

[27]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[28]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[29]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[30]  Esther M. Arkin,et al.  Approximations for minimum and min-max vehicle routing problems , 2006, J. Algorithms.

[31]  Moshe Dror,et al.  A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem , 1997, Transp. Sci..

[32]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[33]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[34]  Ching-Wu Chu,et al.  A heuristic algorithm for the truckload and less-than-truckload problem , 2005, Eur. J. Oper. Res..

[35]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[36]  Ángel Corberán,et al.  An algorithm for the Rural Postman problem on a directed graph , 1986 .

[37]  K. H. Wang,et al.  On the maximum benefit Chinese Postman Problem , 2003 .

[38]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[39]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[40]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[41]  D. Simchi-Levi,et al.  The Logic of Logistics: Theory, Algorithms, and Applications for Logistics and Supply Chain Management , 1999 .

[42]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[43]  E. Minieka.  The Chinese Postman Problem for Mixed Networks , 1979 .

[44]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[45]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[46]  Jeffrey L. Rummel,et al.  A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .

[47]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[48]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[49]  C. M. Liu,et al.  Algorithms for the Chinese postman problem on mixed networks , 1995, Comput. Oper. Res..

[50]  Zaw Win,et al.  On the Windy Postman Problem on eulerian graphs , 1989, Math. Program..

[51]  Hsiao-Fan Wang,et al.  Time-constrained Chinese postman problems , 2002 .

[52]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

[53]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[54]  Ángel Corberán,et al.  An optimal method for the mixed postman problem , 1984 .

[55]  de Ng Dick Bruijn,et al.  Circuits and Trees in Oriented Linear Graphs , 1951 .

[56]  G. Dantzig.  Programming of Interdependent Activities: II Mathematical Model , 1949 .

[57]  Meigu Guan,et al.  On the windy postman problem , 1984, Discret. Appl. Math..

[58]  Eric R. Zieyel.  Operations research : applications and algorithms , 1988 .

[59]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[60]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[61]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[62]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[63]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[64]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[65]  Charalampos Papamanthou,et al.  Computational experience with exterior point algorithms for the transportation problem , 2004, Appl. Math. Comput..

[66]  J. Nesetril.  A few remarks on the history of MST-problem , 1997 .

[67]  Attahiru Sule Alfa,et al.  POSTMAN ROUTING PROBLEM IN A HIERARCHICAL NETWORK , 1988 .

[68]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[69]  Richard J. Linn,et al.  Storage space allocation in container terminals , 2003 .

[70]  Bruce L. Golden,et al.  VEHICLE ROUTING WITH BACKHAULS: MODELS, ALGORITHMS, AND CASE STUDIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[71]  Zhengyu Zhu,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem , 2007, 2007 IEEE International Conference on Automation and Logistics.

[72]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[73]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[74]  Wayne L. Winston,et al.  Introduction to mathematical programming , 1991 .

[75]  Bruce L. Golden,et al.  Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..

[76]  M. J. Maher,et al.  Model Building in Mathematical Programming , 1978 .

[77]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[78]  Leonid N. Vaserstein,et al.  Introduction to Linear Programming , 2018, Linear Programming and Resource Allocation Modeling.

[79]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[80]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[81]  Douglas R. Shier,et al.  Iterative methods for determining the k shortest paths in a network , 1976, Networks.

[82]  Enrique Benavent,et al.  The Directed Rural Postman Problem with Turn Penalties , 1999, Transp. Sci..

[83]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[84]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[86]  Jill R. Hardin,et al.  Vehicle minimization for periodic deliveries , 2005, Eur. J. Oper. Res..

[87]  Á. Corberán,et al.  A polyhedral approach to the rural postman problem , 1994 .

[88]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

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

[90]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[91]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[92]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[93]  J. Picard,et al.  An optimal algorithm for the mixed Chinese postman problem , 1996 .

[94]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[95]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[96]  Abraham Charnes,et al.  The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems , 1954 .

[97]  Marshall L. Fisher,et al.  A Periodic Inventory Routing Problem at a Supermarket Chain , 2004, Oper. Res..

[98]  C. S. Orloff.  A fundamental problem in vehicle routing , 1974, Networks.

[99]  Teodor Gabriel Crainic,et al.  A cooperative parallel meta-heuristic for the vehicle routing problem with time windows , 2005, Comput. Oper. Res..

[100]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[101]  Richard F. Hartl,et al.  New savings based algorithms for time constrained pickup and delivery of full truckloads , 2003, Eur. J. Oper. Res..

[102]  Don T. Phillips,et al.  Fundamentals Of Network Analysis , 1981 .

[103]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[104]  Ángel Corberán,et al.  Heuristics for the Mixed Rural Postman Problem , 2000, Comput. Oper. Res..

[105]  M. Daskin,et al.  The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem , 1993 .

[106]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[107]  Wen Lea Pearn,et al.  Algorithms for the Windy Postman Problem , 1994, Comput. Oper. Res..

[108]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[109]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[110]  Nicos Christofides.  The optimum traversal of a graph , 1973 .

[111]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[112]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[113]  Chris T. Kiranoudis,et al.  AN EFFICIENT META-HEURISTIC ALGORITHM FOR ROUTING PRODUCT COLLECTING VEHICLES OF DEHYDRATION PLANTS. I. ALGORITHM DEVELOPMENT , 2001 .

[114]  Christos H. Papadimitriou,et al.  On the complexity of edge traversing , 1976, J. ACM.

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

[116]  Russ J. Vander Wiel,et al.  An exact solution approach for the time‐dependent traveling‐salesman problem , 1996 .

[117]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[118]  Ángel Corberán,et al.  The Rural Postman Problem on mixed graphs with turn penalties , 2002, Comput. Oper. Res..

[119]  T. Koopmans.  Optimum Utilization of the Transportation System , 1949 .

[120]  Martin Grötschel,et al.  A cutting plane algorithm for the windy postman problem , 1992, Math. Program..

[121]  Balaji Raghavachari,et al.  A 3/2-Approximation Algorithm for the Mixed Postman Problem , 1999, SIAM J. Discret. Math..

[122]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[123]  Christos D. Tarantilis,et al.  Advanced vehicle routing algorithms for complex operations management problems , 2005 .

[124]  Edgar G. Goodaire,et al.  Discrete Mathematics With Graph Theory , 1997 .

[125]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.