Show simple item record

dc.contributor.authorLikas, Aris
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2009-10-06T12:14:06Z
dc.date.available2009-10-06T12:14:06Z
dc.date.issued2002
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2131
dc.language.isoenen
dc.subjectTraveling salesman problemen
dc.subject.ddc003en
dc.titleA note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problemen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherDepartment of Computer Science, University of Ioannina;Grèce
dc.description.abstractenA new approach is presented to the traveling salesman problem (TSP) relying on a novel greedy representation of the solution space and leading to a different definition of neighborhood structures required in many local and random search approaches. Accordingly, a parallelizable search strategy is proposed based upon local search with random restarts that exploits the characteristics of the representation. Preliminary experimental results on several sets of test problems, among which very well-known benchmarks, show that the representation developed, matched with the search strategy proposed, attains high quality near-optimal solutions in moderate execution times.en
dc.relation.isversionofjnlnameChaos, Solitons and Fractals
dc.relation.isversionofjnlvol13en
dc.relation.isversionofjnlissue1en
dc.relation.isversionofjnldate2002
dc.relation.isversionofjnlpages71-78en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/S0960-0779(00)00227-7en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record