The Traveling-Salesman Problem
From MaRDI portal
Publication:5378674
DOI10.1287/opre.4.1.61zbMath1414.90304OpenAlexW1994863634WikidataQ89044360 ScholiaQ89044360MaRDI QIDQ5378674
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
Related Items
Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction, The convex-hull-and-line traveling salesman problem: A solvable case, A new hybrid heuristic approach for solving large traveling salesman problem, An optimization approach for communal home meal delivery service: A case study, Visual attractiveness in routing problems: a review, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, Novel concave hull-based heuristic algorithm for TSP, The Convex-hull-and-k-line Travelling Salesman Problem, Iterated local search for the vehicle routing problem with a private fleet and a common carrier, Measures of dynamism and urgency in logistics, The hybrid electric vehicle-traveling salesman problem, Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia, A two phase variable neighborhood search for the multi-product inventory routing problem, A VNS approach to multi-location inventory redistribution with vehicle routing, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Submodularity and the traveling salesman problem, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem, Learn global and optimize local: a data-driven methodology for last-mile routing, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, The transit route arc-node service maximization problem, The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem, Fairer comparisons for travelling salesman problem solutions using hash functions, 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, A GRASP with evolutionary path relinking for the truck and trailer routing problem, The traveling salesman problem with flexible coloring, A distance function for computing on finite subsets of Euclidean spaces, A bilevel programming approach to the travelling salesman problem., HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, Solving the traveling salesman problem with interdiction and fortification, The stable marriage problem: an interdisciplinary review from the physicist's perspective, On the nearest neighbor rule for the metric traveling salesman problem, A travelling salesman problem (TSP) with multiple job facilities., Golden ratio versus pi as random sequence sources for Monte Carlo integration, A truck and drones model for last-mile delivery: a mathematical model and heuristic approach, The traveling salesman problem: An overview of exact and approximate algorithms, Hard to solve instances of the Euclidean traveling salesman problem, Time-dependent travelling salesman problem., The \(x\)-and-\(y\)-axes travelling salesman problem, 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, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, Match twice and stitch: a new TSP tour construction heuristic., First vs. best improvement: an empirical study, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, The multiple shortest path problem with path deconfliction, Truncated \(M\)-travelling salesman problem, Stochastic vehicle routing, Dynamic vehicle routing with time windows in theory and practice, Finding the maximum multi improvement on neighborhood exploration, Discrete Set Handling, Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory, Computing in combinatorial optimization, New edges not used in shortest tours of TSP, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, An improved assignment lower bound for the Euclidean traveling salesman problem, The traveling salesman problem with few inner points, A location-or-routing problem with partial and decaying coverage
