Skip to main content
Journal Article

A hybrid algorithm of n-OPT and GA to solve dynamic TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3033 1030-1033
DOI: 10.1007/978-3-540-24680-0_161
6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We proposed the concept dynamic traveling salesman problem (Dynamic TSP). According to the characteristics of Dynamic TSP, we used a hybrid algorithm of n-OPT and GA to solve it. 2-OPT and 3-OPT are used in GA procedures of mutation and selection. The productivity and quality of solutions under dynamic conditions are evaluated by the experiment. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Liu, Z., & Kang, L. (2004). A hybrid algorithm of n-OPT and GA to solve dynamic TSP. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 1030–1033. https://doi.org/10.1007/978-3-540-24680-0_161

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free