Modeling and simulation of logistics flows. 1, Theory and fundamentals / Jean-Michel Reveillac.

Format:

Book

Author/Creator:

Reveillac, Jean-Michel, author.

Language:

English

Subjects (All):

Business logistics--Mathematical models.

Business logistics.

Physical Description:

1 online resource (383 pages) : illustrations (some color), tables

Edition:

1st ed.

Place of Publication:

London, England ; Hoboken, New Jersey : ISTE : Wiley, 2017.

Summary:

Volume 1 presents successively an introduction followed by 10 chapters and a conclusion: * A logistic approach * an overview of operations research * The basics of graph theory * calculating optimal routes * Dynamic programming * planning and scheduling with PERT and MPM * the waves of calculations in a network * spanning trees and touring * linear programming * modeling of road traffic

Contents:

Cover

Title Page

Copyright

Contents

Foreword

About This Book

Intended public

Organization and contents of the book

Conventions

Vocabulary and definition

Acknowledgments

Introduction

I.1. What is logistics?

I.2. History

I.3. New tools and new technologies

1. Operational Research

1.1. A history

1.2. Fields of application, principles and concepts

1.2.1. Identification

1.2.2. Modeling

1.2.3. Solution

1.2.4. Validation

1.2.5. Implementation

1.2.6. Improvement

1.3. Basic models

1.4. The future of OR

2. Elements of Graph Theory

2.1. Graphs and representations

2.2. Undirected graph

2.2.1. Multigraph

2.2.2. Planar and non-planar graph

2.2.3. Connected and unconnected graph

2.2.4. Complete graph

2.2.5. Bipartite graph

2.2.6. Partial graph, subgraph, clique and stable

2.2.7. Degree of a vertex and a graph

2.2.8. Chain and cycle in a graph

2.2.9. Level of connectivity (or beta index)

2.2.10. Eulerian graph

2.2.11. Hamiltonian graph

2.2.12. Planar graph

2.2.13. Isthmus

2.2.14. Tree and forest

2.2.15. Arborescence

2.2.16. Ordered arborescence

2.3. Directed graph or digraph

2.3.1. Path and circuit in a digraph

2.3.2. Absence of circuit in a digraph

2.3.3. Adjacency matrix

2.3.4. Valued graph matrix

2.4. Graphs for logistics

3. Optimal Paths

3.1. Basic concepts

3.2. Dijkstra's algorithm

3.2.1. An example of calculating minimal paths

3.2.2. Interpreting the results of the calculations

3.3. Floyd-Warshall's algorithm

3.3.1. Creating the starting matrices (initialization of the algorithm)

3.3.2. Filling the matrices for the following repetitions

3.3.3. An example of calculating minimal paths

3.3.4. Interpreting the results

3.4. Bellman-Ford's algorithm

3.4.1. Initialization.

3.4.2. The next repetitions with relaxation

3.4.3. An example of calculation

3.4.4. Interpreting the results

3.5. Bellman-Ford's algorithm with a negative circuit

3.5.1. Example

3.6. Exercises

3.6.1. Exercise 1: Optimizing journey time

3.6.2. Exercise 2: A directed graph with negative cost side

3.6.3. Exercise 3: Routing data packets

3.6.4. Solutions to exercise 1

3.6.5. Solutions to exercise 2

3.6.6. Solutions to exercise 3

4. Dynamic Programming

4.1. The principles of dynamic programming

4.2. Formulating the problem

4.2.1. Example 1: The pyramid of numbers

4.2.2. Example 2: The Fibonacci sequence

4.2.3. Example 3: The knapsack

4.3. Stochastic process

4.4. Markov chains

4.4.1. Property of Markov chains

4.4.2. Classes and states of a chain

4.4.3. Matrix and graph

4.4.4. Applying Markov chains

4.5. Exercises

4.5.1. Exercise 1: Levenshtein distance

4.5.2. Exercise 2

4.5.3. Exercise 3: Ehrenfest model

4.5.4. Solutions to exercise 1

4.5.5. Solutions to exercise 2

4.5.6. Solutions to exercise 3

5. Scheduling with PERT and MPM

5.1. Fundamental concepts

5.2. Critical path method

5.3. Precedence diagram

5.4. Planning a project with PERT-CPM

5.4.1. A brief history

5.4.2. Methodology

5.5. Example of determining a critical path with PERT

5.5.1. Using the example to create a precedence table

5.5.2. Creating the graph

5.5.3. Numbering of vertices

5.5.4. Determining earliest dates of each of the tasks

5.5.5. Determining the latest dates for each of the tasks

5.5.6. Determining the critical paths

5.6. Slacks

5.6.1. Total slack

5.6.2. Free slack

5.6.3. Certain slack (or independent slack)

5.6.4. Properties

5.7. Example of calculating slacks

5.8. Determining the critical path with the help of a double-entry table.

5.8.1. Creating a table using our example

5.8.2 Filling out the table

5.8.3. ES dates

5.8.4. LF dates

5.8.5. Critical path

5.9. Methodology of planning with MPM

5.9.1. A brief history

5.9.2. Formalizing the graph

5.9.3. Rules of construction

5.9.4. Earliest and latest dates

5.9.5. Determining the critical path

5.10. Example of determining a critical path with MPM

5.10.1. Creating the graph

5.10.2. Determining the earliest dates for each task

5.10.3. Determining the latest dates of each task

5.10.4. Determining the critical path(s)

5.10.5. Slacks

5.11. Probabilistic PERT/CPM/MPM

5.11.1. Probability of tasks

5.11.2. Implementation in an example

5.11.3. Calculating average durations and variance

5.11.4. Calculating the average duration of the project

5.11.5. Calculating the probability of finishing the project in a chosen duration

5.11.6. Calculating the duration of the project for a given probability

5.12. Gantt diagram

5.12.1. Creating the diagram

5.12.2. Example

5.13. PERT-MPM cost

5.13.1. Method

5.13.2. Example

5.14. Exercises

5.14.1. Exercise 1

5.14.2. Exercise 2

5.14.3. Exercise 3

5.14.4. Exercise 4

5.14.5. Solutions to exercise 1

5.14.6. Solutions to exercise 2

5.14.7. Solutions to exercise 3

5.14.8. Solutions to exercise 4

6. Maximum Flow in a Network

6.1. Maximum flow

6.2. Ford-Fulkerson algorithm

6.2.1. Presentation of the algorithm

6.2.2. Application of an example

6.3. Minimum cut theorem

6.3.1. Example of cuts

6.4. Dinic algorithm

6.4.1. Presenting the algorithm

6.4.2. Application in an example

6.5. Exercises

6.5.1. Exercise 1: Drinking water supply

6.5.2. Exercise 2: Maximum flow according to Dinic

6.5.3. Solution to exercise 1

6.5.4. Solution to exercise 2.

7. Trees, Tours and Transport

7.1. The basic concepts

7.2. Kruskal's algorithm

7.2.1. Application to an example

7.3. Prim's algorithm

7.3.1. Application to an example

7.4. Sollin's algorithm

7.4.1. Application to an example

7.5. Little's algorithm for solving the TSP

7.5.1. Application to an example

7.6. Exercises

7.6.1. Exercise 1: Computer network

7.6.2. Exercise 2: Deliveries

7.6.3. Solution to exercise 1

7.6.4. Solution to exercise 2

8. Linear Programming

8.1. Basic concepts

8.1.1. Formulation of a linear program

8.2. The graphic resolution method

8.2.1. Identification

8.2.2. Formalization

8.2.3. Resolution

8.3. Simplex method

8.3.1. Steps

8.3.2. An example to be addressed

8.3.3. Formalization

8.3.4. Change into standard form

8.3.5. Creation of the table

8.3.6. Determination of the pivot

8.3.7. Iterations

8.3.8. Interpretation

8.4. Duality

8.4.1. Dual formulation

8.4.2. Passage from primal to dual formalization

8.4.3. Determination of the pivot

8.4.4. Iterations

8.4.5. Interpretation

8.5. Exercises

8.5.1. Exercise 1: Video and festival

8.5.2. Exercise 2: Simplex

8.5.3. Exercise 3: Primal and dual

8.5.4. Solutions to exercise 1

8.5.5. Solutions to exercise 2

8.5.6. Solutions to exercise 3

9. Modeling Road Traffic

9.1. A short introduction to road traffic

9.2. Scale of models and networks

9.3. Models and types

9.4. Learning more information about the models

9.4.1. Microscopic models

9.4.2. Macroscopic models

9.4.3. The families of macroscopic models

9.4.4. The discretization of models

9.4.5. Mesoscopic models

9.4.6. Hybrid models

9.5. Urban modeling

9.6. Intelligent transportation systems

9.7. Conclusion

10. Software Programs

10.1. Software programs for OR and logistics.

10.2. Spreadsheets

10.2.1. Existing software programs

10.3. Project managers

10.3.1. The procedure for creating a project

10.3.2. The different software programs available on the market

10.4. Flow simulators

10.4.1. Generalist software programs

10.4.2. Pedestrian simulators

10.4.3. Traffic simulators

10.4.4. The creation of a simulation process

Appendices

Appendix 1: Standard Normal Distribution Table

A1.1. Use

Appendix 2: GeoGebra

A2.1. Presentation of the software

A2.2. Using GeoGebra

Conclusion

Glossary

Bibliography

Index

Other titles from iSTE in Systems and Industrial Engineering - Robotics

EULA.

Notes:

Includes bibliographical references and index.

Description based on online resource; title from PDF title page (ebrary, viewed February 1, 2017).

ISBN:

9781119368540

1119368545

9781119368526

1119368529

OCLC:

969546804