{"product_id":"modeling-and-simulation-of-logistics-flows-1-theory-and-fundamentals-hardback-9781786301062","title":"Modeling and Simulation of Logistics Flows 1; Theory and Fundamentals (Hardback) 9781786301062","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eModeling and Simulation of Logistics Flows 1\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eTheory and Fundamentals\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJean-Michel Réveillac (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781786301062, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 17 January 2017\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e384 pages\u003cbr\u003e23.4 x 16 x 2.5 cm, 0.726 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eVolume 1 presents successively an introduction followed by 10 chapters and a conclusion:\u003c\/p\u003e \u003cul\u003e \u003cli\u003eA logistic approach\u003c\/li\u003e \u003cli\u003ean overview of operations research\u003c\/li\u003e \u003cli\u003eThe basics of graph theory\u003c\/li\u003e \u003cli\u003ecalculating optimal routes\u003c\/li\u003e \u003cli\u003eDynamic programming\u003c\/li\u003e \u003cli\u003eplanning and scheduling with PERT and MPM\u003c\/li\u003e \u003cli\u003ethe waves of calculations in a network\u003c\/li\u003e \u003cli\u003espanning trees and touring\u003c\/li\u003e \u003cli\u003elinear programming\u003c\/li\u003e \u003cli\u003emodeling of road traffic\u003c\/li\u003e \u003c\/ul\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eForeword xiii\u003c\/p\u003e \u003cp\u003eAbout This Book xvii\u003c\/p\u003e \u003cp\u003eIntroduction xxiii\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 1. Operational Research 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1. A history 1\u003c\/p\u003e \u003cp\u003e1.2. Fields of application, principles and concepts 2\u003c\/p\u003e \u003cp\u003e1.2.1. Identification 2\u003c\/p\u003e \u003cp\u003e1.2.2. Modeling 3\u003c\/p\u003e \u003cp\u003e1.2.3. Solution 5\u003c\/p\u003e \u003cp\u003e1.2.4. Validation 6\u003c\/p\u003e \u003cp\u003e1.2.5. Implementation 6\u003c\/p\u003e \u003cp\u003e1.2.6. Improvement 6\u003c\/p\u003e \u003cp\u003e1.3. Basic models 7\u003c\/p\u003e \u003cp\u003e1.4. The future of OR 7\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 2. Elements of Graph Theory 9\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1. Graphs and representations 9\u003c\/p\u003e \u003cp\u003e2.2. Undirected graph 10\u003c\/p\u003e \u003cp\u003e2.2.1. Multigraph 10\u003c\/p\u003e \u003cp\u003e2.2.2. Planar and non-planar graph 11\u003c\/p\u003e \u003cp\u003e2.2.3. Connected and unconnected graph 11\u003c\/p\u003e \u003cp\u003e2.2.4. Complete graph 11\u003c\/p\u003e \u003cp\u003e2.2.5. Bipartite graph 12\u003c\/p\u003e \u003cp\u003e2.2.6. Partial graph, subgraph, clique and stable 12\u003c\/p\u003e \u003cp\u003e2.2.7. Degree of a vertex and a graph 13\u003c\/p\u003e \u003cp\u003e2.2.8. Chain and cycle in a graph 13\u003c\/p\u003e \u003cp\u003e2.2.9. Level of connectivity (or beta index) 15\u003c\/p\u003e \u003cp\u003e2.2.10. Eulerian graph 15\u003c\/p\u003e \u003cp\u003e2.2.11. Hamiltonian graph 16\u003c\/p\u003e \u003cp\u003e2.2.12. Planar graph 17\u003c\/p\u003e \u003cp\u003e2.2.13. Isthmus 18\u003c\/p\u003e \u003cp\u003e2.2.14. Tree and forest 19\u003c\/p\u003e \u003cp\u003e2.2.15. Arborescence 20\u003c\/p\u003e \u003cp\u003e2.2.16. Ordered arborescence 21\u003c\/p\u003e \u003cp\u003e2.3. Directed graph or digraph 22\u003c\/p\u003e \u003cp\u003e2.3.1. Path and circuit in a digraph 22\u003c\/p\u003e \u003cp\u003e2.3.2. Absence of circuit in a digraph 23\u003c\/p\u003e \u003cp\u003e2.3.3. Adjacency matrix 24\u003c\/p\u003e \u003cp\u003e2.3.4. Valued graph matrix 24\u003c\/p\u003e \u003cp\u003e2.4. Graphs for logistics 25\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 3. Optimal Paths 27\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1. Basic concepts 27\u003c\/p\u003e \u003cp\u003e3.2. Dijkstra's algorithm 28\u003c\/p\u003e \u003cp\u003e3.2.1. An example of calculating minimal paths 28\u003c\/p\u003e \u003cp\u003e3.2.2. Interpreting the results of the calculations 30\u003c\/p\u003e \u003cp\u003e3.3. Floyd--Warshall's algorithm 30\u003c\/p\u003e \u003cp\u003e3.3.1. Creating the starting matrices (initialization of the algorithm) 30\u003c\/p\u003e \u003cp\u003e3.3.2. Filling the matrices for the following repetitions 31\u003c\/p\u003e \u003cp\u003e3.3.3. An example of calculating minimal paths 32\u003c\/p\u003e \u003cp\u003e3.3.4. Interpreting the results 34\u003c\/p\u003e \u003cp\u003e3.4. Bellman--Ford's algorithm 35\u003c\/p\u003e \u003cp\u003e3.4.1. Initialization 36\u003c\/p\u003e \u003cp\u003e3.4.2. The next repetitions with relaxation 36\u003c\/p\u003e \u003cp\u003e3.4.3. An example of calculation 37\u003c\/p\u003e \u003cp\u003e3.4.4. Interpreting the results 39\u003c\/p\u003e \u003cp\u003e3.5. Bellman--Ford's algorithm with a negative circuit 40\u003c\/p\u003e \u003cp\u003e3.5.1. Example 40\u003c\/p\u003e \u003cp\u003e3.6. Exercises 43\u003c\/p\u003e \u003cp\u003e3.6.1. Exercise 1: Optimizing journey time 43\u003c\/p\u003e \u003cp\u003e3.6.2. Exercise 2: A directed graph with negative cost side 44\u003c\/p\u003e \u003cp\u003e3.6.3. Exercise 3: Routing data packets 45\u003c\/p\u003e \u003cp\u003e3.6.4. Solutions to exercise 1 45\u003c\/p\u003e \u003cp\u003e3.6.5. Solutions to exercise 2 46\u003c\/p\u003e \u003cp\u003e3.6.6. Solutions to exercise 3 48\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 4. Dynamic Programming 51\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1. The principles of dynamic programming 51\u003c\/p\u003e \u003cp\u003e4.2. Formulating the problem 52\u003c\/p\u003e \u003cp\u003e4.2.1. Example 1: The pyramid of numbers 52\u003c\/p\u003e \u003cp\u003e4.2.2. Example 2: The Fibonacci sequence 54\u003c\/p\u003e \u003cp\u003e4.2.3. Example 3: The knapsack 56\u003c\/p\u003e \u003cp\u003e4.3. Stochastic process 60\u003c\/p\u003e \u003cp\u003e4.4. Markov chains 60\u003c\/p\u003e \u003cp\u003e4.4.1. Property of Markov chains 61\u003c\/p\u003e \u003cp\u003e4.4.2. Classes and states of a chain 62\u003c\/p\u003e \u003cp\u003e4.4.3. Matrix and graph 63\u003c\/p\u003e \u003cp\u003e4.4.4. Applying Markov chains 64\u003c\/p\u003e \u003cp\u003e4.5. Exercises 66\u003c\/p\u003e \u003cp\u003e4.5.1. Exercise 1: Levenshtein distance 66\u003c\/p\u003e \u003cp\u003e4.5.2. Exercise 2 67\u003c\/p\u003e \u003cp\u003e4.5.3. Exercise 3: Ehrenfest model 67\u003c\/p\u003e \u003cp\u003e4.5.4. Solutions to exercise 1 68\u003c\/p\u003e \u003cp\u003e4.5.5. Solutions to exercise 2 69\u003c\/p\u003e \u003cp\u003e4.5.6. Solutions to exercise 3 70\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 5. Scheduling with PERT and MPM 73\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1. Fundamental concepts 73\u003c\/p\u003e \u003cp\u003e5.2. Critical path method 74\u003c\/p\u003e \u003cp\u003e5.3. Precedence diagram 74\u003c\/p\u003e \u003cp\u003e5.4. Planning a project with PERT-CPM 77\u003c\/p\u003e \u003cp\u003e5.4.1. A brief history 77\u003c\/p\u003e \u003cp\u003e5.4.2. Methodology 78\u003c\/p\u003e \u003cp\u003e5.5. Example of determining a critical path with PERT 86\u003c\/p\u003e \u003cp\u003e5.5.1. Using the example to create a precedence table 87\u003c\/p\u003e \u003cp\u003e5.5.2. Creating the graph 87\u003c\/p\u003e \u003cp\u003e5.5.3. Numbering of vertices 89\u003c\/p\u003e \u003cp\u003e5.5.4. Determining earliest dates of each of the tasks 89\u003c\/p\u003e \u003cp\u003e5.5.5. Determining the latest dates for each of the tasks 90\u003c\/p\u003e \u003cp\u003e5.5.6. Determining the critical paths 92\u003c\/p\u003e \u003cp\u003e5.6. Slacks 93\u003c\/p\u003e \u003cp\u003e5.6.1. Total slack 94\u003c\/p\u003e \u003cp\u003e5.6.2. Free slack 94\u003c\/p\u003e \u003cp\u003e5.6.3. Certain slack (or independent slack) 94\u003c\/p\u003e \u003cp\u003e5.6.4. Properties 94\u003c\/p\u003e \u003cp\u003e5.7. Example of calculating slacks 95\u003c\/p\u003e \u003cp\u003e5.8. Determining the critical path with the help of a double-entry table 96\u003c\/p\u003e \u003cp\u003e5.8.1. Creating a table using our example 96\u003c\/p\u003e \u003cp\u003e5.8.2 Filling out the table 96\u003c\/p\u003e \u003cp\u003e5.8.3. ES dates 97\u003c\/p\u003e \u003cp\u003e5.8.4. LF dates 99\u003c\/p\u003e \u003cp\u003e5.8.5. Critical path 100\u003c\/p\u003e \u003cp\u003e5.9. Methodology of planning with MPM 101\u003c\/p\u003e \u003cp\u003e5.9.1. A brief history 101\u003c\/p\u003e \u003cp\u003e5.9.2. Formalizing the graph 102\u003c\/p\u003e \u003cp\u003e5.9.3. Rules of construction 103\u003c\/p\u003e \u003cp\u003e5.9.4. Earliest and latest dates 104\u003c\/p\u003e \u003cp\u003e5.9.5. Determining the critical path 105\u003c\/p\u003e \u003cp\u003e5.10. Example of determining a critical path with MPM 106\u003c\/p\u003e \u003cp\u003e5.10.1. Creating the graph 106\u003c\/p\u003e \u003cp\u003e5.10.2. Determining the earliest dates for each task 107\u003c\/p\u003e \u003cp\u003e5.10.3. Determining the latest dates of each task 108\u003c\/p\u003e \u003cp\u003e5.10.4. Determining the critical path(s) 109\u003c\/p\u003e \u003cp\u003e5.10.5. Slacks 109\u003c\/p\u003e \u003cp\u003e5.11. Probabilistic PERT\/CPM\/MPM 111\u003c\/p\u003e \u003cp\u003e5.11.1. Probability of tasks 112\u003c\/p\u003e \u003cp\u003e5.11.2. Implementation in an example 113\u003c\/p\u003e \u003cp\u003e5.11.3. Calculating average durations and variance 114\u003c\/p\u003e \u003cp\u003e5.11.4. Calculating the average duration of the project 114\u003c\/p\u003e \u003cp\u003e5.11.5. Calculating the probability of finishing the project in a chosen duration 114\u003c\/p\u003e \u003cp\u003e5.11.6. Calculating the duration of the project for a given probability 115\u003c\/p\u003e \u003cp\u003e5.12. Gantt diagram 116\u003c\/p\u003e \u003cp\u003e5.12.1. Creating the diagram 116\u003c\/p\u003e \u003cp\u003e5.12.2. Example 117\u003c\/p\u003e \u003cp\u003e5.13. PERT-MPM cost 119\u003c\/p\u003e \u003cp\u003e5.13.1. Method 120\u003c\/p\u003e \u003cp\u003e5.13.2. Example 121\u003c\/p\u003e \u003cp\u003e5.14. Exercises 125\u003c\/p\u003e \u003cp\u003e5.14.1. Exercise 1 125\u003c\/p\u003e \u003cp\u003e5.14.2. Exercise 2 126\u003c\/p\u003e \u003cp\u003e5.14.3. Exercise 3 126\u003c\/p\u003e \u003cp\u003e5.14.4. Exercise 4 127\u003c\/p\u003e \u003cp\u003e5.14.5. Solutions to exercise 1 129\u003c\/p\u003e \u003cp\u003e5.14.6. Solutions to exercise 2 130\u003c\/p\u003e \u003cp\u003e5.14.7. Solutions to exercise 3 132\u003c\/p\u003e \u003cp\u003e5.14.8. Solutions to exercise 4 133\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 6. Maximum Flow in a Network 137\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1. Maximum flow 137\u003c\/p\u003e \u003cp\u003e6.2. Ford--Fulkerson algorithm 138\u003c\/p\u003e \u003cp\u003e6.2.1. Presentation of the algorithm 139\u003c\/p\u003e \u003cp\u003e6.2.2. Application of an example 141\u003c\/p\u003e \u003cp\u003e6.3. Minimum cut theorem 147\u003c\/p\u003e \u003cp\u003e6.3.1. Example of cuts 148\u003c\/p\u003e \u003cp\u003e6.4. Dinic algorithm 149\u003c\/p\u003e \u003cp\u003e6.4.1. Presenting the algorithm 149\u003c\/p\u003e \u003cp\u003e6.4.2. Application in an example 150\u003c\/p\u003e \u003cp\u003e6.5. Exercises 154\u003c\/p\u003e \u003cp\u003e6.5.1. Exercise 1: Drinking water supply 154\u003c\/p\u003e \u003cp\u003e6.5.2. Exercise 2: Maximum flow according to Dinic 155\u003c\/p\u003e \u003cp\u003e6.5.3. Solutions to exercise 1 155\u003c\/p\u003e \u003cp\u003e6.5.4. Solutions to exercise 2 158\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 7. Trees, Tours and Transport 163\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1. The basic concepts 163\u003c\/p\u003e \u003cp\u003e7.2. Kruskal's algorithm 165\u003c\/p\u003e \u003cp\u003e7.2.1. Application to an example 165\u003c\/p\u003e \u003cp\u003e7.3. Prim's algorithm 168\u003c\/p\u003e \u003cp\u003e7.3.1. Application to an example 170\u003c\/p\u003e \u003cp\u003e7.4. Sollin's algorithm 175\u003c\/p\u003e \u003cp\u003e7.4.1. Application to an example 176\u003c\/p\u003e \u003cp\u003e7.5. Little's algorithm for solving the TSP 182\u003c\/p\u003e \u003cp\u003e7.5.1. Application to an example 184\u003c\/p\u003e \u003cp\u003e7.6. Exercises 195\u003c\/p\u003e \u003cp\u003e7.6.1. Exercise 1: Computer network 195\u003c\/p\u003e \u003cp\u003e7.6.2. Exercise 2: Deliveries 196\u003c\/p\u003e \u003cp\u003e7.6.3. Solutions to exercise 1 197\u003c\/p\u003e \u003cp\u003e7.6.4. Solutions to exercise 2 200\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 8. Linear Programming 205\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1. Basic concepts 205\u003c\/p\u003e \u003cp\u003e8.1.1. Formulation of a linear program 206\u003c\/p\u003e \u003cp\u003e8.2. The graphic resolution method 206\u003c\/p\u003e \u003cp\u003e8.2.1. Identification 207\u003c\/p\u003e \u003cp\u003e8.2.2. Formalization 207\u003c\/p\u003e \u003cp\u003e8.2.3. Resolution 212\u003c\/p\u003e \u003cp\u003e8.3. Simplex method 215\u003c\/p\u003e \u003cp\u003e8.3.1. Steps 215\u003c\/p\u003e \u003cp\u003e8.3.2. An example to be addressed 215\u003c\/p\u003e \u003cp\u003e8.3.3. Formalization 216\u003c\/p\u003e \u003cp\u003e8.3.4. Change into standard form 217\u003c\/p\u003e \u003cp\u003e8.3.5. Creation of the table 218\u003c\/p\u003e \u003cp\u003e8.3.6. Determination of the pivot 218\u003c\/p\u003e \u003cp\u003e8.3.7. Iterations 219\u003c\/p\u003e \u003cp\u003e8.3.8. Interpretation 222\u003c\/p\u003e \u003cp\u003e8.4. Duality 223\u003c\/p\u003e \u003cp\u003e8.4.1. Dual formulation 224\u003c\/p\u003e \u003cp\u003e8.4.2. Passage from primal to dual formalization 224\u003c\/p\u003e \u003cp\u003e8.4.3. Determination of the pivot 226\u003c\/p\u003e \u003cp\u003e8.4.4. Iterations 227\u003c\/p\u003e \u003cp\u003e8.4.5. Interpretation 228\u003c\/p\u003e \u003cp\u003e8.5. Exercises . 228\u003c\/p\u003e \u003cp\u003e8.5.1. Exercise 1: Video and festival 228\u003c\/p\u003e \u003cp\u003e8.5.2. Exercise 2: Simplex 228\u003c\/p\u003e \u003cp\u003e8.5.3. Exercise 3: Primal and dual 229\u003c\/p\u003e \u003cp\u003e8.5.4. Solutions to exercise 1 229\u003c\/p\u003e \u003cp\u003e8.5.5. Solutions to exercise 2 232\u003c\/p\u003e \u003cp\u003e8.5.6. Solutions to exercise 3 234\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 9. Modeling Road Traffic 237\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1. A short introduction to road traffic 237\u003c\/p\u003e \u003cp\u003e9.2. Scale of models and networks 239\u003c\/p\u003e \u003cp\u003e9.3. Models and types 239\u003c\/p\u003e \u003cp\u003e9.4. Learning more information about the models 240\u003c\/p\u003e \u003cp\u003e9.4.1. Microscopic models 240\u003c\/p\u003e \u003cp\u003e9.4.2. Macroscopic models 245\u003c\/p\u003e \u003cp\u003e9.4.3. The families of macroscopic models 250\u003c\/p\u003e \u003cp\u003e9.4.4. The discretization of models 252\u003c\/p\u003e \u003cp\u003e9.4.5. Mesoscopic models 253\u003c\/p\u003e \u003cp\u003e9.4.6. Hybrid models 254\u003c\/p\u003e \u003cp\u003e9.5. Urban modeling 255\u003c\/p\u003e \u003cp\u003e9.6. Intelligent transportation systems 256\u003c\/p\u003e \u003cp\u003e9.7. Conclusion 256\u003c\/p\u003e \u003cp\u003e\u003cb\u003eChapter 10. Software Programs 259\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1. Software programs for OR and logistics 259\u003c\/p\u003e \u003cp\u003e10.2. Spreadsheets 260\u003c\/p\u003e \u003cp\u003e10.2.1. Existing software programs 262\u003c\/p\u003e \u003cp\u003e10.3. Project managers 266\u003c\/p\u003e \u003cp\u003e10.3.1. The procedure for creating a project 268\u003c\/p\u003e \u003cp\u003e10.3.2. The different software programs available on the market 268\u003c\/p\u003e \u003cp\u003e10.4. Flow simulators 271\u003c\/p\u003e \u003cp\u003e10.4.1. Generalist software programs 273\u003c\/p\u003e \u003cp\u003e10.4.2. Pedestrian simulators 281\u003c\/p\u003e \u003cp\u003e10.4.3. Traffic simulators 288\u003c\/p\u003e \u003cp\u003e10.4.4. The creation of a simulation process 300\u003c\/p\u003e \u003cp\u003e\u003cb\u003eAppendices 303\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eAppendix 1: Standard Normal Distribution Table 305\u003c\/p\u003e \u003cp\u003eAppendix 2: GeoGebra 309\u003c\/p\u003e \u003cp\u003eConclusion 319\u003c\/p\u003e \u003cp\u003eGlossary 323\u003c\/p\u003e \u003cp\u003eBibliography 329\u003c\/p\u003e \u003cp\u003eIndex 337\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Electronics \u0026amp; communications engineering [\u003ca title=\"See our other books on Electronics \u0026amp; communications engineering\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Electronics%20\u0026amp;%20communications%20engineering%20%5BTJ%5D%22\"\u003eTJ\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-ISTE","offers":[{"title":"Brand New","offer_id":52446341824792,"sku":"9781786301062","price":98.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781786301062.jpg?v=1785111362","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/modeling-and-simulation-of-logistics-flows-1-theory-and-fundamentals-hardback-9781786301062","provider":"Freshly Printed Books","version":"1.0","type":"link"}