Two-phase Pareto local search for the biobjective traveling salesman problem Export

@article{citeulike:4094910, abstract = {Abstract\ \ In this work, we present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first phase of the method, an initial population composed of a good approximation of the extreme supported efficient solutions is generated. We use as second phase a Pareto Local Search method applied to each solution of the initial population. We show that using the combination of these two techniques: good initial population generation plus Pareto Local Search gives better results than state-of-the-art algorithms. Two other points are introduced: the notion of ideal set and a simple way to produce near-efficient solutions of multiobjective problems, by using an efficient single-objective solver with a data perturbation technique.}, author = {Lust, Thibaut and Teghem, Jacques}, citeulike-article-id = {4094910}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10732-009-9103-9}, citeulike-linkout-1 = {http://www.springerlink.com/content/b8nxv2353rx473w3}, doi = {10.1007/s10732-009-9103-9}, journal = {Journal of Heuristics}, keywords = {local\_search, tsp}, posted-at = {2009-09-16 17:18:32}, priority = {0}, title = {Two-phase Pareto local search for the biobjective traveling salesman problem}, url = {http://dx.doi.org/10.1007/s10732-009-9103-9} }

TY - JOUR ID - citeulike:4094910 L3 - citeulike-article-id:4094910 N2 - Abstract  In this work, we present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first phase of the method, an initial population composed of a good approximation of the extreme supported efficient solutions is generated. We use as second phase a Pareto Local Search method applied to each solution of the initial population. We show that using the combination of these two techniques: good initial population generation plus Pareto Local Search gives better results than state-of-the-art algorithms. Two other points are introduced: the notion of ideal set and a simple way to produce near-efficient solutions of multiobjective problems, by using an efficient single-objective solver with a data perturbation technique. JF - Journal of Heuristics TI - Two-phase Pareto local search for the biobjective traveling salesman problem KW - local_search KW - tsp AU - Lust, Thibaut AU - Teghem, Jacques UR - http://dx.doi.org/10.1007/s10732-009-9103-9 ER -