On the selection of k efficient paths by clustering techniques
by Massimiliano Caramia, Stefano Giordani
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 1, No. 3, 2009

Abstract: In the multi-objective shortest path problem usually there is not just one single path that simultaneously minimises r > 1 objective functions (costs); that is why the problem consists in finding the set of efficient paths of the given network. The number of such paths is often very large, while from an application point of view one is generally interested in selecting a given (small) number k > 1 of efficient paths that are representative of the whole efficient path set. In this paper, we propose a clustering-based approach for selecting k efficient paths maximising their representativeness with respect to the cost vectors of all the efficient paths or w.r.t. the dissimilarity among the k selected paths. Computational results are given on random networks; a comparison with a known approach in the literature is also presented.

Online publication date: Sun, 19-Jul-2009

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 Data Mining, Modelling and Management (IJDMMM):
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