An efficient genetic algorithm for the traveling salesman problem with precedence constraints

European Journal of Operational Research

Volumn 140, Issue 3, 2002, Pages 606-617

  Moon, Chiung ^a   Kim, Jongsoo ^a   Choi, Gyunghyun ^a   Seo, Yoonho ^b  

^a Hanyang University   (South Korea)

^b University of Ulsan   (South Korea)

Author keywords

Genetic algorithm; Optimization; Topological sort; Traveling salesman problem with precedence constraints

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

TOPOLOGICAL SORT (TS);

TRAVELING SALESMAN PROBLEM;

EID: 0036680981     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00227-2     Document Type: Article

References (21)

1. Some new branching and bounding criteria for the asymmetric traveling salesman problem
2. Interval programming using genetic algorithms
3. A travelling salesman problem with allocation time window and precedence constraints an application to ship scheduling
4. An additive bounding procedure for combinatorial optimization problems
5. A two-commodity network flow approach to the traveling salesman problem
6. Artificial intelligence, heuristic frameworks and tabu search
7. The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
8. Configuration space analysis of travelling salesman problem
9. Modeling and solving the flexible forging module scheduling problem
10. Classification of travelling salesman problem formulation
11. An effective heuristic algorithm for travelling salesman problem
12. Cluster based branching for the asymmetric traveling salesman problem
13. Using cutting planes to solve the symmetric travelling salesman problem
14. Dynamic programming strategies for the TSP with time windows and precedence constraints
15. Genetic algorithms for the travelling salesman problem
16. A heuristic for the pickup and delivery traveling salesman problem
17. The general pickup and delivery problem
18. A boolean neural network approach for the travelling salesman problem
19. Integer programming formulations of the travelling salesman problem