Samenvatting
The use and management of multimodal transport systems, including car–pooling and goods transportation, have become extremely complex, due to their large size (sometimes several thousand variables), the nature of their dynamic relationships as well as the many constraints to which they are subjected. The managers of these systems must ensure that the system works as efficiently as possible by managing the various causes of malfunction of the transport system (vehicle breakdowns, road obstructions, accidents, etc.). The detection and resolution of conflicts, which are particularly complex and must be dealt with in real time, are currently processed manually by operators. However, the experience and abilities of these operators are no longer sufficient when faced with the complexity of the problems to be solved. It is thus necessary to provide them with an interactive tool to help with the management of disturbances, enabling them to identify the different disturbances, to characterize and prioritize these disturbances, to process them by taking into account their specifics and to evaluate the impact of the decisions in real time.
Each chapter of this book can be broken down into an approach for solving a transport problem in 3 stages, i.e. modeling the problem, creating optimization algorithms and validating the solutions. The management of a transport system calls for knowledge of a variety of theories (problem modeling tools, multi–objective problem classification, optimization algorithms, etc.). The different constraints increase its complexity drastically and thus require a model that represents as far as possible all the components of a problem in order to better identify it and propose corresponding solutions. These solutions are then evaluated according to the criteria of the transport providers as well as those of the city transport authorities.
This book consists of a state of the art on innovative transport systems as well as the possibility of coordinating with the current public transport system and the authors clearly illustrate this coordination within the framework of an intelligent transport system.
Contents
1. Dynamic Car–pooling, Slim Hammadi and Nawel Zangar.
2. Simulation of Urban Transport Systems, Christian Tahon, Thérèse Bonte and Alain Gibaud.
3. Real–time Fleet Management: Typology and Methods, Frédéric Semet and Gilles Goncalves.
4. Solving the Problem of Dynamic Routes by Particle Swarm, Mostefa Redouane Khouahjia, Laetitia Jourdan and El Ghazali Talbi.
5. Optimization of Traffic at a Railway Junction: Scheduling Approaches Based on Timed Petri Nets, Thomas Bourdeaud huy and Benoît Trouillet.
About the Authors
Slim Hammadi is Full Professor at the Ecole Centrale de Lille in France, and Director of the LAGIS Team on Optimization of Logistic systems. He is an IEEE Senior Member and specializes in distributed optimization, multi–agent systems, supply chain management and metaheuristics.
Mekki Ksouri is Professor and Head of the Systems Analysis, Conception and Control Laboratory at Tunis El Manar University, National Engineering School of Tunis (ENIT) in Tunisia. He is an IEEE Senior Member and specializes in control systems, nonlinear systems, adaptive control and optimization. The multimodal transport network customers need to be oriented during their travels. A multimodal information system (MIS) can provide customers with a travel support tool, allowing them to express their demands and providing them with the appropriate responses in order to improve their travel conditions. This book develops methodologies in order to realize a MIS tool capable of ensuring the availability of permanent multimodal information for customers before and while traveling, considering passengers mobility.
Specificaties
Inhoudsopgave
<p>Chapter 1. Dynamic Car–pooling 1<br /> Slim HAMMADI and Nawel ZANGAR</p>
<p>1.1. Introduction 1</p>
<p>1.2. State of the art 2</p>
<p>1.3. Complexity of the optimized dynamic car–pooling problem: comparison and similarities with other existing systems 8</p>
<p>1.3.1. Graphical modeling for the implementation of a distributed physical architecture 9</p>
<p>1.3.2. Collection of requests for car–pooling and data modeling 11</p>
<p>1.3.3. Matrix structure to collect information on requests 14</p>
<p>1.3.4. Matrix representation for modeling car–pooling offers 17</p>
<p>1.3.5. Modeling constraints of vehicles allocation to users 21</p>
<p>1.3.6. Geographical network subdivision served and implementation of a physical distributed dynamic architecture 26</p>
<p>1.4. ODCCA: an optimized dynamic car–pooling platform based on communicating agents 33</p>
<p>1.4.1. Multi–agent concept for a distributed car–pooling system 33</p>
<p>1.5. Formal modeling: for an optimized and efficient allocation method 40</p>
<p>1.5.1. D3A: Dijkstra Dynamic Distributed Algorithm 40</p>
<p>1.5.2. ODAVe: Optimized Distributed Allocation of Vehicle to users 44</p>
<p>1.6. Implementation and deployment of a dynamic car–pooling service 47</p>
<p>1.6.1. Deployment of ODCCA: choosing a hybrid architecture 49</p>
<p>1.6.2. Layered architecture 51</p>
<p>1.6.3. Testing and implementation scenario 55</p>
<p>1.7. Conclusion 65</p>
<p>1.8. Bibliography 66</p>
<p>Chapter 2. Simulation of Urban Transport Systems 71<br /> Christian TAHON, Thérèse BONTE and Alain GIBAUD</p>
<p>2.1. Introduction 71</p>
<p>2.2. Context 72</p>
<p>2.3. Simulation of urban transport systems 75</p>
<p>2.3.1. Non–guided transport systems 76</p>
<p>2.3.2. Guided transport systems 77</p>
<p>2.4. The types of modeling 80</p>
<p>2.4.1. Nature of the models 80</p>
<p>2.4.2. Macrosimulation, mesoscopic simulation, micro simulation 81</p>
<p>2.5. Modeling approaches 83</p>
<p>2.6. Fields of application 83</p>
<p>2.7. Software tools 86</p>
<p>2.8. Simulation of the Valenciennes transport network with QUEST software 87</p>
<p>2.8.1. Problem 87</p>
<p>2.8.2. Network operation in normal mode 87</p>
<p>2.8.3. Disturbed mode network function 90</p>
<p>2.9. The QUEST software 92</p>
<p>2.9.1. Presentation 92</p>
<p>2.9.2. Modeling 92</p>
<p>2.10. Network modeling in normal mode 94</p>
<p>2.10.1. Topology of traffic networks 94</p>
<p>2.10.2. Bus lines 95</p>
<p>2.10.3. Vehicles 96</p>
<p>2.10.4. Modeling 96</p>
<p>2.10.5. Stops 97</p>
<p>2.10.6. Passengers 101</p>
<p>2.10.7. The flow of connecting passengers 102</p>
<p>2.11. Network modeling in degraded mode 103</p>
<p>2.11.1. Disturbances 103</p>
<p>2.11.2. Regulatory procedures 105</p>
<p>2.12. Simulation results 107</p>
<p>2.13. Conclusion/perspectives 107</p>
<p>2.14. Self–organization of traffic the FORESEE simulator 108</p>
<p>2.14.1. General problem 108</p>
<p>2.14.2. FORESEE simulator 113</p>
<p>2.14.3. Results 117</p>
<p>2.15. Conclusion perspectives 124</p>
<p>2.15.1. Sustainability of the information 125</p>
<p>2.15.2. Information aggregation algorithms 125</p>
<p>2.15.3. Cooperation efficiency 125</p>
<p>2.15.4. Deployment of the proposed approach 126</p>
<p>2.16. Bibliography 127</p>
<p>Chapter 3.Real–time Fleet Management: Typology and Methods 139<br /> Frédéric SEMET and Gilles GONCALVES</p>
<p>3.1. Introduction 139</p>
<p>3.2. General context of RTFMP 140</p>
<p>3.2.1. RTFMP characteristics 140</p>
<p>3.2.2. Application field of RTFMPs 142</p>
<p>3.3. Simulation platform for real–time fleet management 144</p>
<p>3.3.1. Dynamic management of vehicle routing 144</p>
<p>3.3.2. Routing management under time window constraints 146</p>
<p>3.3.3. General architecture of the simulation platform 147</p>
<p>3.3.4. Consideration of uncertainties on requests 151</p>
<p>3.3.5. Consideration of information linked to traffic 156</p>
<p>3.4. Real–time fleet management: a case study 162</p>
<p>3.4.1. General architecture of the optimization engine 163</p>
<p>3.4.2. Itinerary calculation and length estimation 164</p>
<p>3.4.3. The static route planning problem 165</p>
<p>3.4.4. Route planning and modification of the transport plan 166</p>
<p>3.5. Conclusion 168</p>
<p>3.6. Bibliography 168</p>
<p>Chapter 4. Solving the Problem of Dynamic Routes by Particle Swarm 173<br /> Mostefa Redouane KHOUAHJIA, Laetitia JOURDAN and El Ghazali TALBI</p>
<p>4.1. Introduction 173</p>
<p>4.2. Vehicle routing problems 174</p>
<p>4.2.1. The static vehicle routing problem 174</p>
<p>4.2.2. The dynamic vehicle routing problem (DVRP) 176</p>
<p>4.2.3. Importance of dynamic routing problems 178</p>
<p>4.3. Resolution scheme of the dynamic vehicle routing problem 179</p>
<p>4.3.1. Event planner 179</p>
<p>4.3.2. Particle swarm optimization 181</p>
<p>4.4. Adaptation of the PSO metaheuristic for the dynamic vehicle routing problem 184</p>
<p>4.4.1. Representation of particles 184</p>
<p>4.4.2. Velocity and movement of particles 185</p>
<p>4.4.3. The APSO algorithm (Adaptive Particle Swarm Optimization) 187</p>
<p>4.4.4. Adaptive memory mechanism 188</p>
<p>4.5. Experimental results 189</p>
<p>4.5.1. Datasets 189</p>
<p>4.5.2. Experiments and analysis 190</p>
<p>4.5.3. Measure of dynamicity 192</p>
<p>4.6. Conclusion 196</p>
<p>4.7. Bibliography 196</p>
<p>Chapter 5. Optimization of Traffic at a Railway Junction: Scheduling Approaches Based on Timed Petri Nets 199<br /> Thomas BOURDEAUD HUY and Benoît TROUILLET</p>
<p>5.1. Introduction 199</p>
<p>5.2. Scheduling in a railway junction 201</p>
<p>5.2.1. Classical scheduling 201</p>
<p>5.2.2. Flexible system scheduling 202</p>
<p>5.2.3. Dual Gantt diagram 203</p>
<p>5.2.4. The railway junction saturation problem 204</p>
<p>5.3. Petri nets for scheduling 206</p>
<p>5.3.1. Place/Transition Petri net 206</p>
<p>5.3.2. T–timed Petri nets 209</p>
<p>5.3.3. Controlled executions 211</p>
<p>5.3.4. Reachability problems in TPNs 212</p>
<p>5.3.5. Modeling of a railway junction with Petri nets 213</p>
<p>5.3.6. Approaches to solving the timed reachability problem 214</p>
<p>5.4. Incremental model for TPNs 216</p>
<p>5.4.1. Formulation operators + and s 220</p>
<p>5.4.2. Integer Mathematical Models 223</p>
<p>5.4.3. Numerical experiments 225</p>
<p>5.4.4. Study of the illustrative example of Figure 5.5 227</p>
<p>5.4.5. Conclusion and future work 228</p>
<p>5.5. A (max,+) approach to scheduling 229</p>
<p>5.5.1. Introduction and production hypotheses 230</p>
<p>5.5.2. Construction of a simple event graph associated with the initial model 233</p>
<p>5.5.3. Resolution of resource sharing 236</p>
<p>5.5.4. Application 242</p>
<p>5.5.5. Overview 246</p>
<p>5.6. Conclusion 247</p>
<p>5.7. Bibliography 248</p>
<p>List of Authors 253</p>
<p>Index 255</p>