IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v23y2017i4d10.1007_s10732-017-9343-z.html
   My bibliography  Save this article

Scatter search for trainees to software project requirements stable allocation

Author

Listed:
  • Mangesh Gharote

    (IIT Bombay
    TATA Consultancy Services Limited)

  • Rahul Patil

    (IIT Bombay)

  • Sachin Lodha

    (TATA Consultancy Services Limited)

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.

Suggested Citation

  • Mangesh Gharote & Rahul Patil & Sachin Lodha, 2017. "Scatter search for trainees to software project requirements stable allocation," Journal of Heuristics, Springer, vol. 23(4), pages 257-283, August.
  • Handle: RePEc:spr:joheur:v:23:y:2017:i:4:d:10.1007_s10732-017-9343-z
    DOI: 10.1007/s10732-017-9343-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9343-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10732-017-9343-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    2. Yagiura, Mutsunori & Ibaraki, Toshihide & Glover, Fred, 2006. "A path relinking approach with ejection chains for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 548-569, March.
    3. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
    4. Belfiore, PatrI´cia & Yoshida Yoshizaki, Hugo Tsugunobu, 2009. "Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil," European Journal of Operational Research, Elsevier, vol. 199(3), pages 750-758, December.
    5. Zaraket, Fadi A. & Olleik, Majd & Yassine, Ali A., 2014. "Skill-based framework for optimal software project selection and resource allocation," European Journal of Operational Research, Elsevier, vol. 234(1), pages 308-318.
    6. González, Miguel A. & Vela, Camino R. & Varela, Ramiro, 2015. "Scatter search with path relinking for the flexible job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 245(1), pages 35-45.
    7. Jafar Rezaei, 2015. "A two-way approach to supply chain partner selection," International Journal of Production Research, Taylor & Francis Journals, vol. 53(16), pages 4888-4902, August.
    8. Kothari, Ravi & Ghosh, Diptesh, 2012. "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen Chao & Tian Zhihui & Yao Baozhen, 2019. "Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network," Annals of Operations Research, Springer, vol. 273(1), pages 111-134, February.
    2. Manuel Sanchez & Lorena Pradenas & Jean-Christophe Deschamps & Victor Parada, 2016. "Reducing the carbon footprint in a vehicle routing problem by pooling resources from different companies," Netnomics, Springer, vol. 17(1), pages 29-45, July.
    3. Noordhoek, Marije & Dullaert, Wout & Lai, David S.W. & de Leeuw, Sander, 2018. "A simulation–optimization approach for a service-constrained multi-echelon distribution network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 292-311.
    4. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    5. Cannavale, Chiara & Esempio, Anna & Ferretti, Marco, 2021. "Up- and down- alliances: A systematic literature review," International Business Review, Elsevier, vol. 30(5).
    6. Lunardi, Willian T. & Birgin, Ernesto G. & Ronconi, Débora P. & Voos, Holger, 2021. "Metaheuristics for the online printing shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 293(2), pages 419-441.
    7. Liu, Yu-Hsin, 2011. "Incorporating scatter search and threshold accepting in finding maximum likelihood estimates for the multinomial probit model," European Journal of Operational Research, Elsevier, vol. 211(1), pages 130-138, May.
    8. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
    9. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    10. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    11. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    12. Marti, Rafael, 2006. "Scatter Search--Wellsprings and Challenges," European Journal of Operational Research, Elsevier, vol. 169(2), pages 351-358, March.
    13. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    14. Fuentes, Manuel & Cadarso, Luis & Marín, Ángel, 2019. "A hybrid model for crew scheduling in rail rapid transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 248-265.
    15. Büther, Marcel, 2007. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 632, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    17. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    18. Xiaxia Ma & Wenliang Bian & Wenchao Wei & Fei Wei, 2022. "Customer-Centric, Two-Product Split Delivery Vehicle Routing Problem under Consideration of Weighted Customer Waiting Time in Power Industry," Energies, MDPI, vol. 15(10), pages 1-23, May.
    19. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. Bożena Staruch & Bogdan Staruch, 2021. "Competence-based assignment of tasks to workers in factories with demand-driven manufacturing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 553-565, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:23:y:2017:i:4:d:10.1007_s10732-017-9343-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.