Simulation Tool for Assignment Model: ASSOLVE

  • Pratiksha Saxena
  • Shabana Urooj
  • Abhinav Chaudhary
  • Sanchit Kumar
  • Satyavan Singh
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 340)

Abstract

In this paper, a simulation optimization tool ASSOLVE is proposed for assignment problems. The proposed tool is able to simulate and compute the results for assignment models. It is developed in JavaScript and back-end simulation results are stored for analysis with the help of an effective algorithm. This manuscript proposes a user friendly tool for output performance measurements of classical models of assignment system. Results and analysis are described with the help of numerical example.

Keywords

Simulation Java-script Assignment models Performance measures 

References

  1. 1.
    Alidaee, B., Wang, H., Landram, F.: On the flexible demand assignment problems: case of unmanned aerial vehicles. IEEE Trans. Autom. Sci. Eng. 8(4), 65–868 (2011)CrossRefGoogle Scholar
  2. 2.
    Tamura, S., Kodera, Y., Taniguchi, S., Yanase, T.: Feasiblity of Hungarian algorithm based scheduling. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 1185–1190 (2010)Google Scholar
  3. 3.
    Zeng, Y., Wu, X., Cao, J.: The research and analysis of Hungarian algorithm in the structure, index reduction for DAE. In: 11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, pp. 446–450 (2012)Google Scholar
  4. 4.
    Yue, K., Lockom, F., Li, Z., Ghalim, S., Ren, S., Zhang, L., Li, X.: Hungarian: algorithm based virtualization to maintain application timing similarity for defect-tolerant NoC. In: Proceedings of Design Automation Conference, pp. 493–498 (2012)Google Scholar
  5. 5.
    Huang, L.S: Solution of the unequal of workers and tasks assignment problem with restriction of qualification. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics (2005)Google Scholar
  6. 6.
    Das, G.K., Ghosh, S.C., Nandy, S.C.: An efficient heuristic algorithm for 2D h-hops range assignment problem. In: IEEE Communications Society, pp. 1051–1055 (2004)Google Scholar
  7. 7.
    Huang, C.J.: Integrate the Hungarian method and genetic algorithm to solve the shortest distance problem. In: Proceedings of Third International Conference on Digital Manufacturing and Automation, pp. 496–499 (2012)Google Scholar
  8. 8.
    Shaobo, L., Yang, G., Qingsheng, X.: Automatic design method of dynamic systems based on Hungarian algorithm and genetic programming. In: IEEE Conference on Wireless Communications, Networking and Mobile Computing (2008)Google Scholar
  9. 9.
    Giingor, I., Gunes, M.: Fuzzy multiple criteria assignment problems for fusion the case of hungarian algorithm. In: Proceedings of the Third International Conference on Information Fusion, IEEE explore (2000)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • Pratiksha Saxena
    • 1
  • Shabana Urooj
    • 2
  • Abhinav Chaudhary
    • 3
  • Sanchit Kumar
    • 3
  • Satyavan Singh
    • 3
  1. 1.Department of Applied MathematicsGautam Buddha UniversityGreater NoidaIndia
  2. 2.Department of Electrical EngineeringGautam Buddha UniversityGreater NoidaIndia
  3. 3.School of ICTGautam Buddha UniversityGreater NoidaIndia

Personalised recommendations