Advertisement

Reachability Modeling for Multimodal Networks Prototyping

  • Grzegorz BocewiczEmail author
  • Robert Wójcik
  • Zbigniew Banaszak
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 290)

Abstract

A declarative model aimed at reachability-driven refinement of the multimodal networks (MNs) cyclic steady state space is proposed. The concept of multimodal processes executed in goods/passengers transportation or data transmission networks where several closed loop structure subnetworks interact each other via distinguished subsets of common shared hubs as to provide a variety of demand-responsive goods or data transportation/handling services is employed. Multimodal processes throughput depends on their cycle time that is on cycle time reachable in considered MN. Therefore, searching for the MN’s cyclic steady state behavior the following question is considered: Is the cyclic steady state space reachable in the given network structure? The declarative approach employed makes it possible to evaluate the reachability of cyclic behaviors on a scale that reflects real practice.

Keywords

multimodal network initial states reduction-free method cyclic scheduling constraint programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abara, J.: Applying integer linear programming to the fleet assignment problem. Interfaces 19, 4–20 (1989)CrossRefGoogle Scholar
  2. 2.
    Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic steady state space refinement: periodic process scheduling. The International Journal of Advanced Manufacturing Technology 67(1-4), 137–155 (2013)CrossRefGoogle Scholar
  3. 3.
    Grzegorz, B., Zbigniew, B., Paweł, P.: Cyclic Steady State Space Refinement. In: Szewczyk, R., Zieliński, C., Kaliczyńska, M. (eds.) Recent Advances in Automation, Robotics and Measuring Techniques. AISC, vol. 267, pp. 11–20. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  4. 4.
    Korytkowski, P., Rymaszewski, S., Wiśniewski, T.: Ant Colony Optimization for job shop scheduling using multi-attribute dispatching rules. International Journal of Advanced Manufacturing Technology 67, 231–241 (2013)CrossRefGoogle Scholar
  5. 5.
    Levner, E., Kats, V., Alcaide, D., Pablo, L., Cheng, T.C.E.: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering 59(2), 352–361 (2010)CrossRefGoogle Scholar
  6. 6.
    Pawlewski, P.: Multimodal approach to model and design supply chain. In: Proceedings of 7th IFAC Conference on Manufacturing Modelling, Management, and Control, St. Petersburg, pp. 2110–2115 (2013)Google Scholar
  7. 7.
    Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundamenta Informaticae 60(1-4), 269–289 (2004)zbMATHMathSciNetGoogle Scholar
  8. 8.
    Puente, V., Gregorio, J.A., Beivide, R., Vallejo, F.: A New Routing Mechanism for Networks with Irregular Topology. In: Proceedings of Conference of Supercomputing, ACM/IEEE (2001)Google Scholar
  9. 9.
    Relich, M.: A declarative approach to new product development in the automotive industry. In: Environmental Issues in Automotive Industry, EcoProduction, pp. 23–45 (2014)Google Scholar
  10. 10.
    Różewski, P., Małachowski, B.: System for creative distance learning environment development based on competence management. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010, Part IV. LNCS, vol. 6279, pp. 180–189. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  11. 11.
    Sitek, P., Wikarek, J.: A hybrid approach to supply chain modeling and optimization. In: Proceedings of Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 1223–1230 (2013)Google Scholar
  12. 12.
    Sitek, P., Wikarek, J.: A hybrid method for modeling and solving constrained search problems. In: Proceedings of Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 385–392 (2013)Google Scholar
  13. 13.
    Song, J.-S., Lee, T.E.: Petri net modeling and scheduling for cyclic job shops with blocking. Computers & Industrial Engineering 34(2), 281–295 (1998)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Von Kampmeyer, T.: Cyclic scheduling problems. Ph.D. Dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück (2006)Google Scholar
  15. 15.
    Yu, H., Lu, F.: A multi-modal route planning approach with an improved genetic algorithm. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences 38, 343–348 (2010)Google Scholar
  16. 16.
    Zhang, X., He, Z., Pan, Y.: Study on Multimodal Transport Network Model Base on Genetic Algorithm Method. In: ICLEM, pp. 3514–3520 (2010)Google Scholar
  17. 17.
    Zidi, S., Maouche, S.: Ant Colony Optimization for the rescheduling of multimodal transport networks. In: IMACS Proceedings of Multiconference on Computational, Engineering in Systems Applications, vol. 1, pp. 965–971 (2006)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Grzegorz Bocewicz
    • 1
    Email author
  • Robert Wójcik
    • 2
  • Zbigniew Banaszak
    • 3
  1. 1.Department of Electronics and Computer ScienceKoszalin University of TechnologyKoszalinPoland
  2. 2.Institute of Computer Engineering, Control and RoboticsWrocław University of TechnologyWroclawPoland
  3. 3.Department of Business InformaticsWarsaw University of TechnologyWarsawPoland

Personalised recommendations