A Method for Solving Traveling-Salesman Problems
From MaRDI portal
Publication:5378825
DOI10.1287/opre.6.6.791zbMath1414.90303OpenAlexW2106378689MaRDI QIDQ5378825
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.6.6.791
Related Items
A guided local search heuristic for the capacitated arc routing problem, Use of the BATA algorithm and MIS to solve the mail carrier problem, The multi-vehicle profitable pickup and delivery problem, The bi-objective traveling purchaser problem with deliveries, A branch-and-price algorithm for the ring-tree facility location problem, Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, Unified encoding for hyper-heuristics with application to bioinformatics, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, Novel concave hull-based heuristic algorithm for TSP, Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, A variable neighborhood search heuristic for periodic routing problems, TSP race: minimizing completion time in time-sensitive applications, Evaluating the quality of online optimization algorithms by discrete event simulation, 2-change for k-connected networks, Ordered spatial sampling by means of the traveling salesman problem, A hybrid algorithm for a class of vehicle routing problems, An iterated local search heuristic for the split delivery vehicle routing problem, An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem, Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks, Stochastic local search with learning automaton for the swap-body vehicle routing problem, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics, The multiple team formation problem using sociometry, A large neighbourhood based heuristic for two-echelon routing problems, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, Multicriteria tour planning for mobile healthcare facilities in a developing country, Evolution-inspired local improvement algorithm solving orienteering problem, A Lagrangean relaxation heuristic for vehicle routing, Heuristic methods to consecutive block minimization, Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, Discrete heat transfer search for solving travelling salesman problem, A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection, Reinforcement learning for combinatorial optimization: a survey, A new extension of local search applied to the Dial-A-Ride problem, A variable neighborhood search algorithm for an integrated physician planning and scheduling problem, An approximation of the customer waiting time for online restaurants owning delivery system, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, Heuristic and exact algorithms for a min-max selective vehicle routing problem, \(k\)-interchange heuristic as an optimization procedure for material handling applications, A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit, A local search template., Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Using Markov chains to analyze the effectiveness of local search algorithms, A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem., Dispatching of small containers via coastal freight liners: The case of the Aegean sea., Combination of geographical information system and efficient routing algorithms for real life distribution operations., Instance-specific multi-objective parameter tuning based on fuzzy logic, Local search: is brute-force avoidable?, A variable depth search branching, An efficient implementation of local search algorithms for constrained routing problems, Heuristics for synthesizing robust networks with a diameter constraint, D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Advancing Shannon entropy for measuring diversity in systems, The green location-routing problem, Dynamic vehicle routing problems with enhanced ant colony optimization, A hybrid ant colony optimization for dynamic multidepot vehicle routing problem, Fresh seafood delivery routing problem using an improved ant colony optimization, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Application of imperialist competitive algorithm on solving the traveling salesman problem, A note on the effect of neighborhood structure in simulated annealing, A travelling salesman problem (TSP) with multiple job facilities., Golden ratio versus pi as random sequence sources for Monte Carlo integration, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, Exact algorithms for the equitable traveling salesman problem, Time-dependent travelling salesman problem., Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies, Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study, The effect of the asymmetry of road transportation networks on the traveling salesman problem, A survey of very large-scale neighborhood search techniques, Match twice and stitch: a new TSP tour construction heuristic., Sequential search and its application to vehicle-routing problems, First vs. best improvement: an empirical study, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, Truncated \(M\)-travelling salesman problem, A greedy randomized adaptive search procedure for the orienteering problem with hotel selection, Emergency relief routing models for injured victims considering equity and priority, Combining local search and elicitation for multi-objective combinatorial optimization, Paroid search: Generic local combinatorial optimization, New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach, Guided local search and its application to the traveling salesman problem, Algorithms for the metric ring star problem with fixed edge-cost ratio, Adaptive granular local search heuristic for a dynamic vehicle routing problem, Constrained spanning trees and the traveling salesman problem, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, A review of Hopfield neural networks for solving mathematical programming problems, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, The band collocation problem, Circular Jaccard distance based multi-solution optimization for traveling salesman problems, The heuristic search under conditions of error, The influence of problem specific neighborhood structures in metaheuristics performance, A fast metaheuristic for the travelling salesperson problem with hotel selection, A branch and bound algorithm for symmetric 2-peripatetic salesman problems, A heuristic method for solving the problem of partitioning graphs with supply and demand, Heuristics for the black and white traveling salesman problem, xegaPermGene, Analysis of a High-Performance TSP Solver on the GPU, An integrated cuckoo search-genetic algorithm for mining frequent itemsets, 2-Opt Moves and Flips for Area-optimal Polygonizations, Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows, The intermittent travelling salesman problem, Two-echelon collaborative routing problem with heterogeneous crowd-shippers, Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks, Bi‐objective green vehicle routing problem, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, A variable neighborhood search for flying sidekick traveling salesman problem, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, Hybrid genetic algorithm for undirected traveling salesman problems with profits, Fairer comparisons for travelling salesman problem solutions using hash functions, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, A survivable variant of the ring star problem, A Path-Based Approach to Constrained Sparse Optimization, \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices, Algorithm for solving the Discrete-Continuous Inspection Problem, The travelling salesman and the PQ-tree, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, Discrete Set Handling, Improving TSP Tours Using Dynamic Programming over Tree Decompositions.
