A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem

DOI10.1007/s12597-012-0074-5zbMath1353.90127OpenAlexW2111076746MaRDI QIDQ505113

Yong-Cai Geng, Sumit K. Garg

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0074-5

zbMATH Keywords

patternwordalphabet-tablegeneralized time-dependent travelling salesman problemlexi search algorithmpattern recognition techniquetrip-schedule

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A random-key genetic algorithm for the generalized traveling salesman problem
• 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
• The dynamic programming method in the generalized traveling salesman problem
• Time-dependent travelling salesman problem.
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The symmetric generalized traveling salesman polytope
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem

This page was built for publication: A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem