IDEAS home Printed from
   My bibliography  Save this article

On the assignment of students to topics: A Variable Neighborhood Search approach


  • Geiger, Martin Josef
  • Wenger, Wolf


This article presents a study of a practical assignment problem found in teaching within higher education. Here, students are assigned to scientific topics for which written papers must be submitted. Often, preferences across topics exist among other side constraints that should be considered in solving the problem of interest. Characterizing attributes of real-world problems were studied for scientific departments in Economics and Business Administration at German universities by sending out 800 questionnaires, and analyzing the 203 responses. Based on earlier studies, a Variable Neighborhood Search (VNS) approach was formulated to solve the resulting assignment problem. Several neighborhood search operators were tested, and numerical results are reported for a range of problem scenarios taken from real-world cases. It was observed that VNS leads to superior results vs. single operator local search approaches. Furthermore, we were able to show that in the studied problem, the effectiveness of certain neighborhoods was, to a large extent, dependent on the structures of the underlying problem. An extension of the problem was formulated by integrating a second objective function, which simultaneously balances the workload of staff members while maximizing student utility. The VNS approach was implemented in a computer system, available free of charge, providing decision support for selected other institutions within higher education.

Suggested Citation

  • Geiger, Martin Josef & Wenger, Wolf, 2010. "On the assignment of students to topics: A Variable Neighborhood Search approach," Socio-Economic Planning Sciences, Elsevier, vol. 44(1), pages 25-34, March.
  • Handle: RePEc:eee:soceps:v:44:y:2010:i:1:p:25-34

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

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

    References listed on IDEAS

    1. Saber, Hussein M. & Ghosh, Jay B., 2001. "Assigning students to academic majors," Omega, Elsevier, vol. 29(6), pages 513-523, December.
    2. Partovi, Fariborz Y. & Arinze, Bay, 1995. "A knowledge based approach to the faculty-course assignment problem," Socio-Economic Planning Sciences, Elsevier, vol. 29(3), pages 245-256, September.
    3. Hultberg, Tim H. & Cardoso, Domingos M., 1997. "The teacher assignment problem: A special case of the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 101(3), pages 463-473, September.
    4. Al-Yakoob, Salem M. & Sherali, Hanif D., 2006. "Mathematical programming models and algorithms for a class-faculty assignment problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 488-507, September.
    5. McClure, Richard H. & Wells, Charles E., 1987. "Modeling multiple criteria in the faculty assignment problem," Socio-Economic Planning Sciences, Elsevier, vol. 21(6), pages 389-394.
    6. Yang, Chin W. & Pineno, Charles J., 1989. "An improved approach to solution of the faculty assignment problem," Socio-Economic Planning Sciences, Elsevier, vol. 23(3), pages 169-177.
    7. James S. Dyer & John M. Mulvey, 1976. "An Integrated Optimization/Information System for Academic Departmental Planning," Management Science, INFORMS, vol. 22(12), pages 1332-1341, August.
    8. Ozdemir, Mujgan S. & Gasimov, Rafail N., 2004. "The analytic hierarchy process and multiobjective 0-1 faculty course assignment," European Journal of Operational Research, Elsevier, vol. 157(2), pages 398-408, September.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:jbecon:v:87:y:2017:i:7:d:10.1007_s11573-017-0858-4 is not listed on IDEAS


    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:eee:soceps:v:44:y:2010:i:1:p:25-34. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.