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

DOI10.1016/j.ejor.2004.09.057zbMath1116.90091OpenAlexW2008656089MaRDI QIDQ858328

Lawrence V. Snyder, Mark S. Daskin

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.057

zbMATH Keywords

metaheuristicstraveling salesmangenetic algorithmsGTSPrandom keys

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A two-level metaheuristic for the all colors shortest path problem, An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, Scheduling parallel-machine batch operations to maximize on-time delivery performance, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, Discrete heat transfer search for solving travelling salesman problem, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, A transformation technique for the clustered generalized traveling salesman problem with applications to logistics, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, The traveling purchaser problem with stochastic prices: exact and approximate algorithms, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, An adaptive memory matheuristic for the set orienteering problem, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, Population-based iterated greedy algorithm for the S-labeling problem, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, Algorithm for solving the Discrete-Continuous Inspection Problem, Path planning on a cuboid using genetic algorithms, A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem, A memetic algorithm for the generalized traveling salesman problem, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system, Traveling salesman problem across well-connected cities and with location-dependent edge lengths, Solving the family traveling salesman problem, A Sensitive Metaheuristic for Solving a Large Optimization Problem, A genetic algorithm for a single product network design model with lead time and safety stock considerations, The Generalized Covering Salesman Problem, Randomized heuristics for the family traveling salesperson problem, Discrete/Binary Approach, A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models, A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem, Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• Genetic algorithms. Concepts and designs
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• The dynamic programming method in the generalized traveling salesman problem
• Transformations of generalized ATSP into ATSP.
• Generalized Steiner problems and other variants
• Application of a hybrid genetic algorithm to airline crew scheduling
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Some Applications of the Generalized Travelling Salesman Problem
• The Plant Location Problem: New Models and Research Prospects
• A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Process planning for rotational parts using the generalized travelling salesman problem
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• The symmetric generalized traveling salesman polytope
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem