Metaheuristics and Their Hybridization to Solve the Bi-objective Ring Star Problem: a Comparative Study [article]

Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi (LIFL, INRIA Lille - Nord Europe)
<span title="2008-04-28">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper presents and experiments approaches to solve a new bi-objective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The first objective is the minimization of a ring cost that is related to the length of the cycle. The second one is the minimization of an assignment cost from non-visited nodes to visited ones. In spite of its obvious bi-objective formulation, this problem has
more &raquo; ... ys been investigated in a single-objective way. To tackle the bi-objective ring star problem, we first investigate different stand-alone search methods. Then, we propose two cooperative strategies that combines two multiple objective metaheuristics: an elitist evolutionary algorithm and a population-based local search. We apply this new hybrid approaches to well-known benchmark test instances and demonstrate their effectiveness in comparison to non-hybrid algorithms and to state-of-the-art methods.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:0804.3965v2</a> <a target="_blank" rel="external noopener" href="">fatcat:lv7ulxaqejhafm4tdlkw5bqjii</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>