The effect of the asymmetry of road transportation networks on the traveling salesman problem
From MaRDI portal
Publication:1762144
DOI10.1016/j.cor.2011.09.005zbMath1251.90336OpenAlexW2007192625MaRDI QIDQ1762144
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/37058
asymmetryalgorithmsasymmetric traveling salesman problemgeographic information systemsroad transportation networks
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (5)
From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths ⋮ Discrete heat transfer search for solving travelling salesman problem ⋮ Heuristics for a cash-collection routing problem with a cluster-first route-second approach ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transforming asymmetric into symmetric traveling salesman problems
- A review of metrics on permutations for search landscape analysis
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- Estimation and determination of shortest path length in a road network with obstacles
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The traveling salesman problem and its variations
- Lower tolerance-based branch and bound algorithms for the ATSP
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Solution of a Min-Max Vehicle Routing Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Error Detecting and Error Correcting Codes
- The Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
- Modelling Inter-city Road Distances by Mathematical Functions
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: The effect of the asymmetry of road transportation networks on the traveling salesman problem