IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v10y2017i1p49-68.html
   My bibliography  Save this article

Scheduling multi-skilled manpower with considering teams replacement and site-dependent vehicles routing

Author

Listed:
  • Morteza Kiani
  • Hany Seidgar
  • Iraj Mahdavi

Abstract

In this paper, a combined manpower-vehicle routing problem (CMVRP) is presented that a central depot is considered in which a set of vehicles and a set of multi-skilled teams originate from it to move toward each customer's site for servicing tasks. This problem deals with scheduling of multi-skilled manpower to service a set of tasks with due dates and at the same, routing of the vehicles which are used for moving this manpower. Teams are in different range of competency that it will affect the service time duration. Vehicles are in different moving speeds and costs and not all the vehicles are capable to move toward all the customers' sites. The objective is to find an efficient schedule for the teams and vehicles movement in order to minimise the total cost of servicing, routing and lateness penalties. In this paper, a mixed integer programming model is presented and two meta-heuristics approaches of genetic algorithm (GA) and particle swarm optimisation (PSO) are developed to solve the generated problems. Furthermore, Taguchi experimental design method is applied to set the proper values of parameters. The available results show the higher performance of proposed GA compared with PSO, in quality of solutions within comparatively shorter periods of time.

Suggested Citation

  • Morteza Kiani & Hany Seidgar & Iraj Mahdavi, 2017. "Scheduling multi-skilled manpower with considering teams replacement and site-dependent vehicles routing," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 10(1), pages 49-68.
  • Handle: RePEc:ids:ijmore:v:10:y:2017:i:1:p:49-68
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=80744
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijmore:v:10:y:2017:i:1:p:49-68. 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.

    We have no bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.