Skip to main content
SpringerLink
Log in

Scatter search for trainees to software project requirements stable allocation

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper, we study a centralized, stable matching scheme, which allocates trainees to software project requirements, to minimize retraining and relocation costs when the preference lists of the project requirements may contain ties of arbitrary lengths. This particular trainees’ assignment problem is important because the allocation decisions not only influence the costs but also impact software project deliverables and intern attrition rates. It is also an NP-hard problem because of the inclusion of the ties, and the costs in the stable allocation model. We, therefore, have designed a GRASP-based scatter search method, to solve the large size instances of our assignment problem efficiently. The GRASP method uses randomized algorithms to generate initial trial solutions. A repair heuristic based on regret minimization idea is designed to convert an unstable solution to a stable solution during an improvement phase. Computational experiments suggest that the proposed algorithm significantly reduces run time compared to the CPLEX, and produces solutions that are at an average 4.5% away from the best CPLEX solutions for the large size problem instances. Moreover, our scatter search method consistently provides better quality solutions than the two state of the art methods from the prior literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Acuna, S., Juristo, N.: Assigning people to roles in software projects. Softw. Pract. Exp. 34(7), 675–696 (2004)

    Article  Google Scholar 

  • Acuna, T., Juristo, N., Moreno, M.: Emphasizing human capabilities in software development. IEEE Softw. 23(2), 94–101 (2006)

    Article  Google Scholar 

  • Alvarez-Valdes, R., Crespo, E., Tamarit, J.M., Villa, F.: A scatter search algorithm for project scheduling under partially renewable resources. J. Heuristics 12(1–2), 95–113 (2006)

    Article  MATH  Google Scholar 

  • Barreto, A., Barros, M., Werner, C.: Staffing a software project: a constraint satisfaction and optimization-based approach. Comput. Oper. Res. 35(10), 3073–3089 (2008)

    Article  MATH  Google Scholar 

  • Belfiore, P., Yoshizaki, H.T.Y.: Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. Eur. J. Oper. Res. 199(3), 750–758 (2009)

    Article  MATH  Google Scholar 

  • Cano-Belmán, J., Ríos-Mercado, R.Z., Bautista, J.: A scatter search based hyper-heuristic for sequencing a mixed-model assembly line. J. Heuristics 16(6), 749–770 (2010)

    Article  MATH  Google Scholar 

  • Chouhan, M., Goyal, M.: Skill capacity planning and transformation scheduling of IT workforce under stochastic learning and turnover. In Proceedings \(49^{{\rm th}}\) IEEE Conference on Decision and Control, pp. 4145–4150 (2010)

  • Duggan, J., Byrne, J., Lyons, G.: A task allocation optimizer for software construction. IEEE Softw. 21(3), 76–82 (2004)

    Article  Google Scholar 

  • Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  • Festa, P., Resende, M.: GRASP: basic components and enhancements. Telecommun. Syst. 46(3), 253–271 (2011)

    Article  Google Scholar 

  • Firat, M., Hurkens, C., Laugier, A.: Stability in multi-skill workforce assignments of technicians. Ann. Oper. Res. (2012). doi:10.1007/s10479-012-1224-0

    MATH  Google Scholar 

  • Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9–14 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  • Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search approaches in stable matching problems. Algorithms 6(4), 591–617 (2013)

    Article  MathSciNet  Google Scholar 

  • Gharote, M., Patil R., Lodha, S.: Workforce allocation problem in information technology service organisations. In: Proceeding of the 4th International Conference of Applied Operational Research. Lecture Notes in Management Science, vol. 4, pp. 46–53 (2012)

  • Gharote, M., Patil, R., Lodha, S., Raman, R.: Assignment of trainees to software project requirements: a stable matching based approach. Comput. Ind. Eng. (2015). doi:10.1016/j.cie.2015.05.017

    Google Scholar 

  • Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653–684 (2000)

    MathSciNet  MATH  Google Scholar 

  • Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13–54 (1998)

    Google Scholar 

  • Gonsalves, T., Itoh, K.: Multi-objective optimization for software development projects. In: International Multi Conference of Engineers and Computer Scientists, Hong Kong, vol. 1, pp. 1–6 (2010)

  • González, M.A., Oddi, A., Rasconi, R., Varela, R.: Scatter search with path relinking for the job shop with time lags and setup times. Comput. Oper. Res. 60, 37–54 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  • Ho, S., Gendreau, M.Michel: Path relinking for the vehicle routing problem. J. Heuristics 12, 55–72 (2006)

    Article  MATH  Google Scholar 

  • Infosys: Annual Report Infosys FY2013-14. [online]. https://www.infosys.com/investors/reports-filings/annual-report/annual/Documents/infosys-AR-15.pdf (2014). Accessed 06 Mar 2015

  • Irving, R., Manlove, D.: Finding large stable matchings. J. Exp. Algorithm. 14, 2 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Irving, R.: Stable marriage and indifference. Discrete Appl. Math. 48, 261–272 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  • Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. Proc. ICALP 99, 443–452 (1999)

    MathSciNet  MATH  Google Scholar 

  • Kim, J.Y., Altinkemer, K., Bisi, A.: Yield management of workforce for IT service providers. Decis. Support Syst. 53(1), 23–33 (2012)

    Article  Google Scholar 

  • Kiselgof, S.: Matchings with interval order preferences: efficiency vs strategy-proofness. Procedia Comput. Sci. 31, 807–813 (2014)

    Article  Google Scholar 

  • Kothari, R., Ghosh, D.: A scatter search algorithm for the single row facility layout problem. J. Heuristics 20(2), 125–142 (2014)

    Article  Google Scholar 

  • Laguna, M., Martí, R.: Scatter Search. Methodology and Implementations in C, p. 312. Kluwer Academic Publishers, Boston (2003)

  • Laguna, M., Martí, R., Gallego, M., Duarte, A.: The scatter search methodology. In: Smith, C., et al. (eds.) Wiley Encyclopedia of Operations Research and Management Science, vol. 7, pp. 4692–4703. Wiley, Hoboken (2012)

    Google Scholar 

  • Lennon, C.: Stable Matchings with Additional Objectives. Unpublished manuscript. http://www.dcs.gla.ac.uk/~pat/jchoco/gatsp/papers/Lennondrft.pdf. Accessed 25 May 2012 (2012)

  • Linberg, K.R.: Software developer perceptions about software project failure: a case study. J. Syst. Softw. 49(2), 177–192 (1999)

    Article  Google Scholar 

  • Maenhout, B., Vanhoucke, M.: A hybrid scatter search heuristic for personalized crew rostering in the airline industry. Eur. J. Oper. Res. 206(1), 155–167 (2010)

    Article  MATH  Google Scholar 

  • Manlove, D.F.: The structure of stable marriage with indifference. Discrete Appl. Math. 122, 167–181 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Mateus, G.R., Resende, M.G., Silva, R.M.: GRASP with path-relinking for the generalized quadratic assignment problem. J. Heuristics 17(5), 527–565 (2011)

    Article  MATH  Google Scholar 

  • Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: Solving hard stable matching problems via local search and cooperative parallelization. In: \(29^{{\rm th}}\) AAAI Conference on Artificial Intelligence (2015)

  • Naveh, Y., Richter, Y., Altshuler, Y., Gresh, D., Connors, D.: Workforce optimization: identification and assignment of professional workers using constraint programming. IBM J. Res. Dev. 51(3), 263–279 (2007)

    Article  Google Scholar 

  • Otero, L.D., Otero, C.E.: A fuzzy expert system architecture for capability assessments in skill-based environments. Expert Syst. Appl. 39(1), 654–662 (2012)

    Article  Google Scholar 

  • Otero, L., Centeno, G., Ruiz-Torres, A., Otero, C.: A systematic approach for resource allocation in software projects. Comput. Ind. Eng. 56(4), 1333–1339 (2009)

    Article  Google Scholar 

  • Oyola, J., Løkketangen, A.: GRASP-ASP: an algorithm for the CVRP with route. J. Heuristics 20, 361–382 (2014)

    Article  Google Scholar 

  • Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochen-Berger, G. (eds.) Metaheuristics, pp. 219–270. Kluwer Academic Publishers, Berlin (2001)

    Google Scholar 

  • Rezaei, J.: A two-way approach to supply chain partner selection. Int. J. Prod. Res. (2015). doi:10.1080/00207543.2014.1003663

    Google Scholar 

  • Richter, Y., Naveh, Y., Gresh, D.L., Connors, D.P.: Optimatch: applying constraint programming to workforce management of highly skilled employees. Int. J. Serv. Oper. Inform. 3(3), 258–270 (2008)

    Google Scholar 

  • Russell, R.A., Chiang, W.C.: Scatter search for the vehicle routing problem with time windows. Eur. J. Oper. Res. 169(2), 606–622 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Saradhi, V.V., Palshikar, G.K.: Employee churn prediction. Expert Syst. Appl. 38(3), 1999–2006 (2011)

    Article  Google Scholar 

  • Silva, L.C.e, Costa, A.P.C.S.: Decision model for allocating human resources in information system projects. Int. J. Proj. Manage 31(1), 100–108 (2013)

    Article  Google Scholar 

  • Tang, J., Zhang, J., Pan, Z.: A scatter search algorithm for solving vehicle routing problem with loading cost. Expert Syst. Appl. 37(6), 4073–4083 (2010)

    Article  Google Scholar 

  • Yagiura, M., Ibaraki, T., Glover, F.: A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2), 548–569 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Zaraket, F.A., Olleik, M., Yassine, A.A.: Skill-based framework for optimal software project selection and resource allocation. Eur. J. Oper. Res. 234(1), 308–318 (2014)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shailesh J. Mehta School of Management, IIT Bombay, Powai, Mumbai, 400076, India

    Mangesh Gharote & Rahul Patil

  2. TCS – Research, TATA Consultancy Services Limited, 54 B, Hadapsar Industrial Estate, Hadapsar, Pune, 440013, India

    Mangesh Gharote & Sachin Lodha

Authors
  1. Mangesh Gharote
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rahul Patil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sachin Lodha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mangesh Gharote.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gharote, M., Patil, R. & Lodha, S. Scatter search for trainees to software project requirements stable allocation. J Heuristics 23, 257–283 (2017). https://doi.org/10.1007/s10732-017-9343-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-017-9343-z

Keywords

Search

Navigation