An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving...

Full description

Saved in:
Bibliographic Details
Main Authors: Jinmo Sung, Bongju Jeong
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2014/313767
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832552680597225472
author Jinmo Sung
Bongju Jeong
author_facet Jinmo Sung
Bongju Jeong
author_sort Jinmo Sung
collection DOAJ
description Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.
format Article
id doaj-art-fd3d980d19d1497b88d0f390c783fdf2
institution Kabale University
issn 2356-6140
1537-744X
language English
publishDate 2014-01-01
publisher Wiley
record_format Article
series The Scientific World Journal
spelling doaj-art-fd3d980d19d1497b88d0f390c783fdf22025-02-03T05:58:15ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/313767313767An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence ConstraintsJinmo Sung0Bongju Jeong1Department of Information & Industrial Engineering, Yonsei University, 50 Yonsei-Ro, Seodaemaun-gu, Seoul 120-749, Republic of KoreaDepartment of Information & Industrial Engineering, Yonsei University, 50 Yonsei-Ro, Seodaemaun-gu, Seoul 120-749, Republic of KoreaTraveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.http://dx.doi.org/10.1155/2014/313767
spellingShingle Jinmo Sung
Bongju Jeong
An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
The Scientific World Journal
title An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
title_full An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
title_fullStr An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
title_full_unstemmed An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
title_short An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
title_sort adaptive evolutionary algorithm for traveling salesman problem with precedence constraints
url http://dx.doi.org/10.1155/2014/313767
work_keys_str_mv AT jinmosung anadaptiveevolutionaryalgorithmfortravelingsalesmanproblemwithprecedenceconstraints
AT bongjujeong anadaptiveevolutionaryalgorithmfortravelingsalesmanproblemwithprecedenceconstraints
AT jinmosung adaptiveevolutionaryalgorithmfortravelingsalesmanproblemwithprecedenceconstraints
AT bongjujeong adaptiveevolutionaryalgorithmfortravelingsalesmanproblemwithprecedenceconstraints