An Efficient Transformation Of The Generalized Traveling Salesman Problem
From MaRDI portal
Publication:4202256
DOI10.1080/03155986.1993.11732212zbMath0774.90085OpenAlexW1517470327MaRDI QIDQ4202256
Charles E. Noon, James C. Bean
Publication date: 1 September 1993
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/6833
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Related Items (31)
On the generalized 2-peripatetic salesman problem ⋮ A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal ⋮ Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ A random-key genetic algorithm for the generalized traveling salesman problem ⋮ GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem ⋮ Routing problems: A bibliography ⋮ Modeling and solving several classes of arc routing problems as traveling salesman problems ⋮ A branch-and-cut algorithm for the generalized traveling salesman problem with time windows ⋮ Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem ⋮ A branch‐and‐dive heuristic for single vehicle snow removal ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ Transformations of generalized ATSP into ATSP. ⋮ Temperature field optimization for laser powder bed fusion as a traveling salesperson problem with history ⋮ The single robot line coverage problem: Theory, algorithms, and experiments ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ An efficient transformation of the generalized vehicle routing problem ⋮ Dubins traveling salesman problem with neighborhoods: a graph-based approach ⋮ Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm ⋮ Branch-and-bound for the precedence constrained generalized traveling salesman problem ⋮ A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem ⋮ Solving an urban waste collection problem using ants heuristics ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ On shortest Dubins path via a circular boundary ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ A way to optimally solve a time-dependent vehicle routing problem with time windows ⋮ Generalized network design problems. ⋮ A construction for directed in-out subgraphs of optimal size ⋮ Generalized spanning trees ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem ⋮ A review of TSP based approaches for flowshop scheduling
This page was built for publication: An Efficient Transformation Of The Generalized Traveling Salesman Problem
