DIALING: heuristic to solve integrated resource allocation and routing problem with upper bound
by R.A. Malairajan; K. Ganesh; M.N. Qureshi; P. Sivakumar; Yves Ducq
International Journal of Value Chain Management (IJVCM), Vol. 5, No. 3/4, 2011

Abstract: An extended variant of mixed capacitated arc routing problems (MCARP) with upper bound on number of vehicle is considered in this study for the application of waste collection problem and it is termed as integrated resource allocation and routing problem with upper bound (IRARPUB) problem. Composite heuristic leveraging Dijkstra's algorithm and local search inherent genetic algorithm (DIALING) is proposed to solve both MCARP and IRARPUB. Extensive comparisons of the proposed heuristic with the existing benchmarks or the available lower bound show that it can produce excellent results, outperforming the existing best or yielding results with minimal deviations.

Online publication date: Thu, 26-Mar-2015

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 Value Chain Management (IJVCM):
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