scispace - formally typeset
Journal ArticleDOI

A random-key genetic algorithm for the generalized traveling salesman problem

Reads0
Chats0
TLDR
An effective heuristic that combines a genetic algorithm with a local tour improvement heuristic for the generalized traveling salesman problem, which is competitive with other heuristics published to date in both solution quality and computation time.
About
This article is published in European Journal of Operational Research.The article was published on 2006-10-01. It has received 332 citations till now. The article focuses on the topics: Lin–Kernighan heuristic & 2-opt.

read more

Citations
More filters
Proceedings Article

Genetic CNN

TL;DR: Zhang et al. as mentioned in this paper proposed an encoding method to represent each network structure in a fixed-length binary string, which is initialized by generating a set of randomized individuals and defined standard genetic operations, e.g., selection, mutation and crossover, to generate competitive individuals and eliminate weak ones.
Journal ArticleDOI

Reliable logistics networks design with facility disruptions

TL;DR: In this paper, a mixed-integer programming model was proposed to minimize the nominal cost while reducing the disruption risk using the p -robustness criterion, which bounds the cost in disruption scenarios.
Journal ArticleDOI

Scheduling flexible flow lines with sequence dependent setup times

TL;DR: This paper examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan, and finds an application of the Random Keys Genetic Algorithm to be very effective for the problems examined.
Journal ArticleDOI

Red deer algorithm (RDA): a new nature-inspired meta-heuristic

TL;DR: The main inspiration of this meta- heuristic algorithm is to originate from an unusual mating behavior of Scottish red deer in a breading season, and the superiority of the proposed RDA shows in comparison with other well-known and recent meta-heuristics.
Journal ArticleDOI

An ant colony optimization method for generalized TSP problem

TL;DR: Numerical results show that the proposed method can deal with the GTSP problems fairly well, and the developed mutation process and local search technique are effective.
References
More filters
Journal ArticleDOI

TSPLIB—A Traveling Salesman Problem Library

TL;DR: This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.
Journal ArticleDOI

Genetic Algorithms and Random Keys for Sequencing and Optimization

TL;DR: A general genetic algorithm to address a wide variety of sequencing and optimization problems including multiple machine scheduling, resource allocation, and the quadratic assignment problem is presented.
Journal ArticleDOI

Performance of various computers using standard linear equations software

TL;DR: This report compares the performance of different computer systems in solving dense systems of linear equations, ranging from a CRAY Y-MP to scientific workstations such as the Apollo and Sun to IBM PCs.
Book

Genetic Algorithms: Concepts and Designs

TL;DR: Genetic Algorithms in Speech Recognition Systems.- 8.2.1 Background of Speech Recogning Systems.
Related Papers (5)