Multimodal processes scheduling in mesh-like network environment
<jats:title>Abstract</jats:title> <jats:p>Multimodal processes planning and scheduling play a pivotal role in many different domains including city networks, multimodal transportation systems, computer and telecommunication networks and so on. Multimodal process can be seen as a process partially processed by locally executed cyclic processes. In that context the concept of a Mesh-like Multimodal Transportation Network (MMTN) in which several isomorphic subnetworks interact each other via distinguished subsets of common shared intermodal transport interchange facilities (such as a railway station, bus station or bus/tram stop) as to provide a variety of demand-responsive passenger transportation services is examined. Consider a mesh-like layout of a passengers transport network equipped with different lines including buses, trams, metro, trains etc. where passenger flows are treated as multimodal processes. The goal is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multimodal transportation processes scheduling encompassing passenger flow itineraries. Then, the main objective is to provide conditions guaranteeing solvability of particular transport lines scheduling, i.e. guaranteeing the right match-up of local cyclic acting bus, tram, metro and train schedules to a given passengers flow itineraries.</jats:p>
Abara (1989), Applying integer linear programming to the fleet assignment problem, Interfaces, 19, 4, doi.org/10.1287/inte.19.4.20 ; Hall (2001), Operational decisions in AGV - served flowshop loops : Fleet sizing and decomposition, Annals of Operations Research, 107. ; Polak (2004), The performance evaluation tool for automated prototyping of concurrent cyclic processes, Fundamenta Informaticae, 60, 1. ; Levner (2010), Complexity of cyclic scheduling problems : A state - of - the - art survey Computers, Industrial Engineering, 59, 352, doi.org/10.1016/j.cie.2010.03.013 ; Bach (2010), Knowledge based and CP - driven approach applied to multi product small - size production flow, Control and Cybernetics, 39, 69. ; Clarke (1996), Maintenance and crew considerations in fleet assignment, Transportation Science, 30, 249, doi.org/10.1287/trsc.30.3.249 ; Songand (1998), Petri net modeling and scheduling for cyclic job shops with blocking Computers, Industrial Engineering, 34, 281, doi.org/10.1016/S0360-8352(97)00325-2 ; Heo (2003), A new algorithm for cyclic scheduling and design of multipurpose batch plants Industrial, Engineering Chemistry Research, 42, 836, doi.org/10.1021/ie020308u ; Sitekand (2008), A Declarative Framework for Constrained Search Problems In : New Frontiers in Applied Lecture Notes in Artificial Intelligence Springer - Verlag Berlin - Heidelberg, Artificial Intelligence, 5027.