IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v24y2016i3p333-360.html
   My bibliography  Save this article

An efficient hybrid of genetic and simulated annealing algorithms for multi server vehicle routing problem with multi entry

Author

Listed:
  • Hany Seidgar
  • Mehdi Abedi
  • Sahar Tadayoni Rad
  • Javad Rezaeian

Abstract

This paper considers a multi-server-vehicle routing problem where vehicles could exist and enter the service depot several times. The central branch of bank has a number of nurses to service the failures. The objective is to find efficient routes for the nurses to service each task for each customer in order to minimise the total cost of routing and lateness/earliness penalties. In this paper, a mixed integer programming model is presented and two meta-heuristics approaches namely hybrid of genetic and simulated algorithms (HGSA) and imperialist competitive algorithm (ICA) are developed for solving the random generated problems. In HGSA, simulated annealing (SA) is employed with a certain probability to avoid being trapped in a local optimum. Furthermore, Taguchi experimental design method is applied to set the proper values of the algorithm's parameters. The available results show the higher performance of proposed HGSA compared with ICA, in quality of solutions within comparatively shorter periods of time.

Suggested Citation

  • Hany Seidgar & Mehdi Abedi & Sahar Tadayoni Rad & Javad Rezaeian, 2016. "An efficient hybrid of genetic and simulated annealing algorithms for multi server vehicle routing problem with multi entry," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 24(3), pages 333-360.
    • Handle: RePEc:ids:ijisen:v:24:y:2016:i:3:p:333-360
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=79823
    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:ijisen:v:24:y:2016:i:3:p:333-360. 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=188 .

    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.