Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15762
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiefooghe, Arnauden_UK
dc.contributor.authorJourdan, Laetitiaen_UK
dc.contributor.authorBasseur, Matthieuen_UK
dc.contributor.authorTalbi, El-Ghazalien_UK
dc.contributor.authorBurke, Edmunden_UK
dc.contributor.editorvan Hemert, Jen_UK
dc.contributor.editorCotta, Cen_UK
dc.date.accessioned2018-02-15T03:59:17Z-
dc.date.available2018-02-15T03:59:17Zen_UK
dc.date.issued2008en_UK
dc.identifier.urihttp://hdl.handle.net/1893/15762-
dc.description.abstractThe 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.en_UK
dc.language.isoenen_UK
dc.publisherSpringeren_UK
dc.relationLiefooghe A, Jourdan L, Basseur M, Talbi E & Burke E (2008) Metaheuristics for the bi-objective ring star problem. In: van Hemert J & Cotta C (eds.) Evolutionary Computation in Combinatorial Optimization: 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings. Lecture Notes in Computer Science, 4972. 8th European Conference, EvoCOP 2008: » Evolutionary Computation in Combinatorial Optimization, Naples, Italy, 26.03.2008-28.03.2008. Berlin Heidelberg: Springer, pp. 206-217. http://link.springer.com/chapter/10.1007%2F978-3-540-78604-7_18; https://doi.org/10.1007/978-3-540-78604-7_18en_UK
dc.relation.ispartofseriesLecture Notes in Computer Science, 4972en_UK
dc.rightsThe 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.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
dc.titleMetaheuristics for the bi-objective ring star problemen_UK
dc.typeConference Paperen_UK
dc.rights.embargodate3000-03-01en_UK
dc.rights.embargoreason[Metaheuristics for the bi-objective ring star problem.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1007/978-3-540-78604-7_18en_UK
dc.citation.issn0302-9743en_UK
dc.citation.spage206en_UK
dc.citation.epage217en_UK
dc.citation.publicationstatusPublisheden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.identifier.urlhttp://link.springer.com/chapter/10.1007%2F978-3-540-78604-7_18en_UK
dc.author.emaile.k.burke@stir.ac.uken_UK
dc.citation.btitleEvolutionary Computation in Combinatorial Optimization: 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedingsen_UK
dc.citation.conferencedates2008-03-26 - 2008-03-28en_UK
dc.citation.conferencelocationNaples, Italyen_UK
dc.citation.conferencename8th European Conference, EvoCOP 2008: » Evolutionary Computation in Combinatorial Optimizationen_UK
dc.citation.date31/03/2008en_UK
dc.citation.isbn978-3-540-78603-0en_UK
dc.publisher.addressBerlin Heidelbergen_UK
dc.contributor.affiliationLille University of Science & Technology (University of Lille 1)en_UK
dc.contributor.affiliationLille University of Science & Technology (University of Lille 1)en_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.contributor.affiliationLille University of Science & Technology (University of Lille 1)en_UK
dc.contributor.affiliationComputing Science and Mathematics - Divisionen_UK
dc.identifier.scopusid2-s2.0-47249136102en_UK
dc.identifier.wtid694212en_UK
dcterms.dateAccepted2008-03-31en_UK
dc.date.filedepositdate2013-07-03en_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorLiefooghe, Arnaud|en_UK
local.rioxx.authorJourdan, Laetitia|en_UK
local.rioxx.authorBasseur, Matthieu|en_UK
local.rioxx.authorTalbi, El-Ghazali|en_UK
local.rioxx.authorBurke, Edmund|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.contributorvan Hemert, J|en_UK
local.rioxx.contributorCotta, C|en_UK
local.rioxx.freetoreaddate3000-03-01en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameMetaheuristics for the bi-objective ring star problem.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source978-3-540-78603-0en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
Metaheuristics for the bi-objective ring star problem.pdfFulltext - Published Version434.28 kBAdobe PDFUnder Embargo until 3000-03-01    Request a copy


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.