The traveling-salesman problem

DOI10.1287/OPRE.4.1.61zbMATH Open1414.90304OpenAlexW1994863634WikidataQ89044360 ScholiaQ89044360MaRDI QIDQ5378674FDOQ5378674

Authors: Merrill M. Flood 

Publication date: 3 June 2019

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.4.1.61

Recommendations

• The traveling salesman problem. I: Theoretical issues
• A method for solving traveling-salesman problems
• scientific article; zbMATH DE number 795217
• Worst-case analysis of a new heuristic for the travelling salesman problem
• Travelling salesman problem tools for microcomputers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (93)

• First vs. best improvement: an empirical study
• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
• Solving the traveling salesman problem with interdiction and fortification
• Dynamic vehicle routing with time windows in theory and practice
• Some properties of the solution space of the N-city traveling-salesman problem
• The Traveling Salesman Problem with Distances One and Two
• The traveling salesman problem with backhauls
• An optimization approach for communal home meal delivery service: A case study
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• Match twice and stitch: a new TSP tour construction heuristic.
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• The traveling salesman problem. I: Theoretical issues
• A travelling salesman problem (TSP) with multiple job facilities.
• Time-dependent travelling salesman problem.
• Submodularity and the traveling salesman problem
• An improved assignment lower bound for the Euclidean traveling salesman problem
• Visual attractiveness in routing problems: a review
• Truncated \(M\)-travelling salesman problem
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• A study on the effect of the asymmetry on real capacitated vehicle routing problems
• The effect of the asymmetry of road transportation networks on the traveling salesman problem
• The traveling salesman problem with flexible coloring
• New edges not used in shortest tours of TSP
• A method for solving traveling-salesman problems
• Pyramidal traveling salesman problem
• A new hybrid heuristic approach for solving large traveling salesman problem
• Traveling salesman problem
• Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
• A VNS approach to multi-location inventory redistribution with vehicle routing
• Hard to solve instances of the Euclidean traveling salesman problem
• The moving-target traveling salesman problem
• The balanced traveling salesman problem
• Measures of dynamism and urgency in logistics
• The hybrid electric vehicle-traveling salesman problem
• A two phase variable neighborhood search for the multi-product inventory routing problem
• Stochastic vehicle routing
• The convex-hull-and-line traveling salesman problem: A solvable case
• Solution of a large-scale traveling-salesman problem
• The hierarchical traveling salesman problem
• The transit route arc-node service maximization problem
• Traveling salesman path problems
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• A location-or-routing problem with partial and decaying coverage
• A concise guide to the Traveling Salesman Problem
• On the nearest neighbor rule for the metric traveling salesman problem
• Iterated local search for the vehicle routing problem with a private fleet and a common carrier
• The traveling salesman problem with few inner points
• The stable marriage problem: an interdisciplinary review from the physicist's perspective
• The traveling salesmanpProblem for lines in the plane
• Golden ratio versus pi as random sequence sources for Monte Carlo integration
• The multi-stripe travelling salesman problem
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
• The Convex-hull-and-k-line Travelling Salesman Problem
• Title not available (Why is that?)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• A distance function for computing on finite subsets of Euclidean spaces
• The n-line traveling salesman problem
• A bilevel programming approach to the travelling salesman problem.
• Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
• The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
• Title not available (Why is that?)
• The pollution traveling salesman problem with refueling
• The joint maintenance operation selection and technician routing problem
• Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem
• Fairer comparisons for travelling salesman problem solutions using hash functions
• Title not available (Why is that?)
• Learn global and optimize local: a data-driven methodology for last-mile routing
• The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem
• Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction
• Novel concave hull-based heuristic algorithm for TSP
• The multiple shortest path problem with path deconfliction
• The \(x\)-and-\(y\)-axes travelling salesman problem
• Computing and Combinatorics
• Closed paths in graphs vs. voting theory
• Travelling Salesman with a Self-Similar Itinerary
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs
• A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem
• Directed travelling salesman problem
• An adaptive large neighborhood search for the multi-point dynamic aggregation problem
• Finding the maximum multi improvement on neighborhood exploration
• Title not available (Why is that?)
• Discrete set handling
• Computing in combinatorial optimization
• Title not available (Why is that?)
• Models and algorithms for multiagent hierarchical routing with time windows
• Gale's Round-Trip Jeep Problem

This page was built for publication: The traveling-salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378674)