An artificial bee colony approach for the undirected capacitated arc routing problem with profits
by Tunchan Cura
International Journal of Operational Research (IJOR), Vol. 17, No. 4, 2013

Abstract: This paper considers a recently introduced routing problem variant called the undirected capacitated arc routing problem with profits (UCARPP), which belongs to a well-known class of vehicle routing problems. Although many studies have developed algorithms for vehicle routing problems, few studies have addressed the UCARPP. This paper proposes a relatively new technique, the artificial bee colony (ABC) approach, to solve the UCARPP. Moreover, considering the comparatively few studies on discrete optimisation using an ABC algorithm, this study also presents a new usage for the ABC algorithm in a difficult discrete optimisation problem, which is effective, efficient, robust and comparable to other approaches.

Online publication date: Tue, 29-Jul-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 Operational Research (IJOR):
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