An efficient hybrid of genetic and simulated annealing algorithms for multi server vehicle routing problem with multi entry
by Hany Seidgar; Mehdi Abedi; Sahar Tadayoni Rad; Javad Rezaeian
International Journal of Industrial and Systems Engineering (IJISE), Vol. 24, No. 3, 2016

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.

Online publication date: Mon, 17-Oct-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com