IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2009011.html
   My bibliography  Save this paper

A metaheuristic for a teaching assistant assignment-routing problem

Author

Listed:
  • MAYA, Pablo
  • SÖRENSEN, Kenneth
  • GOOS, Peter

Abstract

The Flemish Ministry of Education promotes the integrated education of disabled children by providing educational opportunities in common schools. In the current system, disabled children receive ambulant help from a teaching assistant (TA) employed at an institute for extra-ordinary education. The compensation that the TAs receive for driving to visit the students is a major cost factor for the institute that provides the assistance, therefore its management desires a schedule that minimizes the accumulated distance traveled by all TAs combined. We call this optimization problem the teaching assistants assignment routing problem (TAARP). It involves three decisions that have to be taken simultaneously: (1) pupils have to be assigned to TAs; (2) pupils assigned to a given TA have to be spread over the TA's different working days; and (3) the order in which to visit the pupils on each day has to be determined. We propose a solution strategy based on an auction algorithm and a variable neighborhood search which exhibit an excellent performance both in simulated and real instances. The total distance traveled in the solution obtained for the real data set improves the current solution by about 22% which represents a saving of around 9% on the annual budget of the institute.

Suggested Citation

  • MAYA, Pablo & SÖRENSEN, Kenneth & GOOS, Peter, 2009. "A metaheuristic for a teaching assistant assignment-routing problem," Working Papers 2009011, University of Antwerp, Faculty of Applied Economics.
  • Handle: RePEc:ant:wpaper:2009011
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docman/irua/19e477/a116798e.pdf
    Download Restriction: no

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:ant:wpaper:2009011. 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: (Joeri Nys). General contact details of provider: http://edirc.repec.org/data/ftufsbe.html .

    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.

    We have no references for this item. You can help adding them by using 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.