Coding TSP tours as permutations via an insertion heuristic

Authors:
Bryant A. Julstrom
Affiliations:
Department of Computer Science, St. Cloud State University, St. Cloud, MN
Venue:
Proceedings of the 1999 ACM symposium on Applied computing
Year:
1999

Citing 4
Cited 5

Scheduling problems and traveling salesman: the genetic edge recombination

Proceedings of the third international conference on Genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Comparing decoding algorithms in a weight-coded GA for TSP

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms

Optimal configuration of a command and control network: balancing performance and reconfiguration constraints

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Heuristic and exact algorithms for a min-max selective vehicle routing problem

Computers and Operations Research
Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract