Multimodal processes scheduling in mesh-like network environment

• Autorzy: Bocewicz G. , Banaszak Z.

Identyfikatory

DOI

10.1515/acsc-2015-0016

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

passengers flow scheduling; multimodal processes; cyclic scheduling; meshlike structure

• Wydawca: Polish Academy of Sciences, Committee of Automatic Control and Robotics
• Czasopismo: Archives of Control Sciences
• Rocznik: 2015
• Tom: Vol. 25, no. 2
• Strony: 237--261
• Opis fizyczny: Bibliogr. 20 poz., rys., tab., wzory

Twórcy

autor

Bocewicz G.

• Koszalin University of Technology, Sniadeckich 2, 75-453 Koszalin, Poland

autor

Banaszak Z.

• Warsaw University of Technology, Narbutta 85, 02-524 Warsaw

Bibliografia

• [1] J. Abara: Applying integer linear programming to the fleet assignment problem. Interfaces, 19 (1989), 4-20.
• [2] I. Bach, G. Bocewicz, Z. Banaszak and W. Muszyński: Knowledge based and CP-driven approach applied to multi product small-size production flow. Control and Cybernetics, 39(1), (2010), 69-95.
• [3] M. Bielli, A. Bolumakoul and H. Mouncif: Object modeling and path computation for multimodal travel systems. European J. of Operational Research, 175(3), (2006), 1705-1730.
• [4] G. Bocewicz and Z. Banaszak: Declarative approach to cyclic steady states space refinement: periodic processes scheduling. Int. J. of Advanced Manufacturing Technology, 67(1-4), (2013), 137-155.
• [5] G. Bocewicz and Z. Banaszak: Rescheduling of concurrently flowing cyclic processes. In: Computational Collective Intelligence: Technologies and Applications, N-T. Nguyen, K. Hoang, P. Jedrzejowicz (Eds.), LNAI, Springer-Verlag, 7654 2012, 212-222.
• [6] G. Bocewicz, Z. Banaszak and I. Nielsen: Robustness of multimodal processes itineraries. Proc. of IFAC Conf. on Manufacturing Modeling, Management and Control, Saint Petersburg, Russia, (2013), 2092-2097.
• [7] J. Buhl, J. Gautrais, N. Reevers, R. V. Sol’e, S. Valverde, P. Kuntz and G. Theraulaz: Topological patterns in street networks of self-organized urban settlements. The European Physical J. B, 49 (2006), 513-522.
• [8] L. W. Clarke, C. A. Hane, E. L. Johnsona nd G. L. Nemhauser: Maintenance and crew considerations in fleet assignment. Transportation Science, 30 (1996), 249-260.
• [9] E. Levner, V. Kats, D. Alcaide, L. Pablo and T. C. E. Cheng: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering, 59(2), (2010), 352-361.
• [10] M. Li: Robustness Analysis for Road Networks A framework with combined DTA models. Ph.D. theses, Delft University of Technology, 2008.
• [11] L. Liu: Data Model and Algorithms for Multimodal Route Planning with Transportation Networks. Ph.D. theses, Technische Universität München, 2010.
• [12] M. Friedrich: A multi-modal transport model for integrated planning. Proc. of 8th World Conf. on Transport Research, Elsevier, 2 (1999), 1-14.
• [13] Z. Guo: Transfers and Path Choice in Urban Public Transport System. Ph.D. theses, Massachusetts Institute of Technology, 2008.
• [14] N. G. Hall, Ch. Sriskandarajah and T. Ganesharajah: Operational decisions in AGV-served flowshop loops: Fleet sizing and decomposition. Annals of Operations Research, 107(1-4), (2001), 189-209.
• [15] S.-K. Heo, K.-H. Lee, H.-K. Lee, I.-B. Lee and J. H. Park: A new algorithm for cyclic scheduling and design of multipurpose batch plants. Industrial & Engineering Chemistry Research, 42(4), (2003), 836-846.
• [16] M. Polak, P. Majdzik, Z. Banaszak and R. Wójcik: The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundamenta Informaticae, 60(1-4), (2004), 269-289.
• [17] P. Sitek and J. Wikarek: A Declarative Framework for Constrained Search Problems. In: New Frontiers in Applied Artificial Intelligence, Lecture Notes in Artificial Intelligence, Nguyen, N. T., et al. (Eds.), 5027 Springer-Verlag, Berlin-Heidelberg, 2008, 728-737.
• [18] J. -S. Song and T. E. Lee: Petri net modeling and scheduling for cyclic job shops with blocking. Computers & Industrial Engineering, 34(2), (1998), 281-295.
• [19] M. Sharma: Control classification of automated guided vehicle systems. Int. J. of Engineering and Advanced Technology, 2(1), (2012), 191-196.
• [20] T. Von Kampmeyer: Cyclic Scheduling Problems. Ph.D. thesis, Fachbereich Mathematik/Informatik, Universität Osnabrück, 2006.