CLING: heuristic to solve integrated resource allocation and routing problem with time window
by R.A. Malairajan; K. Ganesh; Matti Muhos; Päivi Iskanius
International Journal of Services and Operations Management (IJSOM), Vol. 13, No. 2, 2012

Abstract: One of the important extensions of the classical resource allocation problem is integrated resource allocation and routing problem with time window (IRARPTW). IRARPTW problem focuses on the time window for the service at the demanding node with the consideration of travel time of vehicle for a varying demand-oriented multi-echelon supply chain with the consideration of limitation on the number of supply catalyst resource. We have developed a unified heuristic named clustering inherent genetic algorithm (CLING) to solve vehicle routing problem with time windows and IRARPTW. Heuristic CLING was tested for benchmark datasets of VRPTW and derived datasets of IRARPTW and yielded encouraging results.

Online publication date: Sat, 23-Aug-2014

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 Services and Operations Management (IJSOM):
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