Logistic staff managment - ant algorithm for the optimal team creation

• Autorzy: Schiff Krzysztof

Identyfikatory

DOI

10.21008/j.2083-4950.2019.9.1.5

• Języki publikacji: EN

Abstrakty

EN

During daily logistic management managers often met difficult decision optimization problem concerning company staff. Such problems often rely on matching workers between them and team leader or matching worker to a place and a time slot and often they, menagers want to optimise their resources in order to receive such matches as maximum as possible as regars a cardinality number of a such set. These optimisation problem are often NP-difficults and to solve them menagers need special software tools. To aid managers in such situation artificial methods are used. Between artificials methods is a one called the ant colony optimisation algorithm and why in this article an ant colony optimization algorithm for the maximum cardinality 3-dimensional matching problem is described. The problem is modeled by means of 2-dimensional arrays. The elaborated ant algorithm was compared with another existing ant algorithm and tested for different values of ant algorithm parameters. Results of these tests were presented and discussed. The elaborated algorithm shows its superiority.

Słowa kluczowe

EN

logistic staff management; three dimensional matching problem; ant colony

• Wydawca: Publishing House of Poznan University of Technology
• Czasopismo: Research in Logistics & Production
• Rocznik: 2019
• Tom: Vol. 9, No. 1
• Strony: 49--59
• Opis fizyczny: Bibliogr. 33 poz., tab.

Twórcy

autor

Schiff Krzysztof

• Faculty of Electrical and Computer Engineering, Cracow University of Technology, Warszawska 24, 31-155, Kraków, Poland

Bibliografia

• 1. Aftab M.T., Umer M. & Ahmad R. (2012), Jobs scheduling and worker assignment problem to minimize makespan using ant colony optimization metaheuristic, International Journal of Infustrial and Manufacturing Engineering, vol. 6, no. 12, pp. 2823-2826.
• 2. Aiex R., Resende M., Pardalos P.M. & Toraldo G. (2005), GRASP with path relinking for three-index assignment problem INFORMS Journal on Computing, 17, pp. 224-247.
• 3. Balas E. & Saltzman M.J. (1989), Facets of the three-index assignment polytope, Discrete Appl. Math. 23, pp. 201-229.
• 4. Bergh J., Belien J., Bruecker P., Demeulemeester E. & Boeck L. (2012), Personnel scheduling: a literature review, dostępna: https://core.ac.uk/download/pdf/34570361.pdf
• 5. Biro P. & McDermid E. (2010), Three-sided stable matchings with cyclic preferences, Algorithmica, vol. 58, no. 1, pp. 5-18.
• 6. Chen J., Liu Y., Lu S., Sze S.H. & Zhang F. (2012), Iterative expansion and colour coding: An improved algorithm for 3D-matching, ACM Trans. Algorith., vol. 8, no. 1, pp. 1-6.
• 7. Clemons W., Grundel D. & Jeffcoat D. (2004), Applying simulated annealing on the multidimensional assignment, Proc. 2nd Operat. Control and Optimis. Conf., pp. 45-61.
• 8. Clemons W.K., Grundel D.A. & Jeffcost D.E. (2004), Applying simulated annealing to the multidimensional assignment problem, Word Scientific, pp. 45-61.
• 9. Crama Y. & Spieksma F.C.R. (1992), Approximation ALG for three-dimensional assignment problem with triangle inequalities, Europ. J.Oper. Res., vol. 60, pp. 273-279.
• 10. Devi R., Monica D., Devi S. & Subashini D. (2014), Scheduling and resource allocation for employee in software industry, Int.J. Adv. Comp. Eng. & Net., vol. 2, no.5, pp. 26-29.
• 11. Dorigo M. & Stutzle T. (2002), Ant colony optimisation, Cambridge MIT Press. Proceedings of EvoWorkshops 2002, Heidelberg: Springer-Verlag, Berlin, pp. 61-71.
• 12. Epifiano F.S., Ogasawara E., Soares J., Amorim M. & Souza U. (2014), O Problema de Alocacao deTutores em Aplicacoes de Provas, XLVI Simposio Brasileiro de Pesquisa Operacional, Salvador, 16-19 sepembre 2014 Brasil, pp. 3007-3018.
• 13. Eriksson K., Sjostrand J. & Strimling P. (2006), Three-dimensional stable matching with cyclic preferences, Math. Soc. Sci., vol. 52, no. 1, pp. 77-87.
• 14. Fira L. & Brezulianu A., (2012), A genetic algorithm for scheduling of resources in well-services company, Int.J. of Advanc. Research in Artif. Intell., vol. 5, no. 1, pp. 1-6.
• 15. Frieze A.M. (1974), A bilinear programming formulation of the 3-dimensional assignment problem, Math. Programming, vol. 7, pp. 376-379.
• 16. Gutin G. & Karapetyan D. (2009), A memetic Alg for the multidimensional assignment problem in Engineering Stochastic Local Search Alg,, SLS 2009, Lecture Notes in Computer Ścience, Springer, Berlin, Heidelberg, vol 5752.
• 17. Gutin G. & Karapetyan D. (2011), A new approach to population sizing for memetic algorithm: a case for the multidimensional assignment prob., Evol. Comput. 19 345-371.
• 18. Hansen P. & Kaufman L. (1973), A primal-dual alg. for the three-dimensional assignment problem, Cahiers Centre Etudes Rech. Opr., vol. 15, pp. 327-336.
• 19. Huang G. & Lim A. (2006), A hybrid genetic algorithm for the three-index assignment problem, European J. of Operational Research, vol, 172, no. 10, pp. 249-257.
• 20. Jiang H., Xuan J. & Zhang X. (2008), An approximate muscle guided global optimisation algorithm for the three-index assignment problem, Evol. Comput. pp. 2404-2410.
• 21. Kacprzak L., Rudy J. & Żelazny D. (2015), Multi-criteria 3-dimensional bin packing problem, Research in Logistics and Production, no.1, pp. 85-94.
• 22. Karp R.M. (1972), Reducibility among combinatorial problems, R.Miller (Ed.), Complexity of Computer Computations, Plenum, pp. 85-103.
• 23. Knuth D. (1972), Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of Algorithms, Amer. Math. Soc., Providence.
• 24. Kotwal J.G. & Dhope T.S. (2015), Solving Task Allocation to the Worker Using Genetic Algorithm, Inter. J. of Comput. Sc. and Inform. Technol., vol 6. no.4, pp. 3736-3741.
• 25. Król A. (2015), Algorithm for the transportation network nodes aggregation using fuzzy logic, Logistics and Transport, vol. 26, no. 2, pp. 67-74.
• 26. Leśniak P. & Boharski P. (2015), Application of genetic algorithms in design of public transport network, Logistics and Transport, vol. 26, no. 2, pp. 75-82.
• 27. Liu Y., Lu S. & Chen J., Sze S.H. (2006), Greedy localisation and colour-coding: improved matching and packing, Alg In International Workshop on Parameterised and Exact Computation IWPEC, Springer, vol. 4169 of LNCS, pages 84-95.
• 28. Niknafs A., Denzinger J. & Ruhe G. (2013), A systematic literature review of the personnel assignment problem, Proceedings of International Multi-Conference of Engineers and Computer Ścientist 2013, vol II, IMECS 2013, 2013, Hong Kong.
• 29. Pasiliao E.L. (2003), Alg. for Multidimensional Assignment Problems, Ph.D. thesis, Department of Industrial and Systems Engineering, University of Florida.
• 30. Schiff K. (2018), Ant ant colony optimisation for the triple matching problem, Technical Transactions, vol. 115, iss. 2 , pp. 179-186.
• 31. Stylianou C. & Andreou A.S. (2013), A multi-objective genetic algorithm for Inteligent Software Project Scheduling and Team Staffing, Intell. D. Tech., vol 1, no. 7, pp. 59-80.
• 32. Stylianou C., Gerasimous S. & Andreou A.S. (2012), A prototype tool for intelligent software project scheduling and team staffing, Int. Conf. on tools with Art. Intel., 2012, 277-284.
• 33. Younas I. (2015), Using Genetic Algorithms for Large Scale Optimization of Assignment, Planning and Rescheduling Problems, Doct. Th. in Comp. Systems, Stockholm.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).