|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||Metaheuristics for the bi-objective ring star problem|
|Editors:||van, Hemert J|
|Citation:||Liefooghe A, Jourdan L, Basseur M, Talbi E & Burke E (2008) Metaheuristics for the bi-objective ring star problem In: van Hemert J, Cotta C (ed.) Evolutionary Computation in Combinatorial Optimization: 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings, Berlin Heidelberg: Springer. 8th European Conference, EvoCOP 2008: » Evolutionary Computation in Combinatorial Optimization, 26.3.2008 - 28.3.2008, Naples, Italy, pp. 206-217.|
|Series/Report no.:||Lecture Notes in Computer Science, 4972|
|Conference Name:||8th European Conference, EvoCOP 2008: » Evolutionary Computation in Combinatorial Optimization|
|Conference Location:||Naples, Italy|
|Abstract:||The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non-visited nodes to visited ones. In spite of its natural multi-objective formulation, this problem has never been investigated in such a way. In this paper, three metaheuristics are designed to approximate the whole set of efficient solutions for the problem under consideration. Computational experiments are performed on well-known benchmark test instances, and the proposed methods are rigorously compared to each other using different performance metrics.|
|Status:||Publisher version (final published refereed version)|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Metaheuristics for the bi-objective ring star problem.pdf||434.28 kB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.