An Effective Heuristic Algorithm for the Traveling-Salesman Problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Adaptive memory programming for matrix bandwidth minimization
- Genetic local search in combinatorial optimization
- Visiting near-optimal solutions using local search algorithms
- A simple filter-and-fan approach to the facility location problem
- Iterated greedy for the maximum diversity problem
- The use of dynamic programming in genetic algorithms for permutation problems
- Solution of real-world postman problems
- A hybrid feature selection algorithm based on large neighborhood search
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- New benchmark instances for the inventory routing problem
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Further results on the probabilistic traveling salesman problem
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- Knowledge-guided local search for the vehicle routing problem
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
- A hybrid ant colony optimization for dynamic multidepot vehicle routing problem
- Solving the traveling salesman problem with interdiction and fortification
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- An iterative matheuristic for the inventory routing problem
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem
- A user's guide to tabu search
- Finding optimal subgraphs by local search
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
- An improved simulated annealing algorithm for bandwidth minimization
- Finite size scaling and critical transition in constrained traveling salesman problem
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing
- POPMUSIC for the travelling salesman problem
- Analysis of static simulated annealing algorithms
- A hybrid heuristic for an inventory routing problem
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- On the complexity of incremental computation
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- A stochastic local search algorithm for constrained continuous global optimization
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
- Parallel heuristic search -- introductions and a new approach
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity
- Introduction to computation and learning in artificial neural networks
- A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
- Diversification through candidate sampling for a non-iterated Lin-Kernighan-Helsgaun algorithm
- Fast local search algorithms for the handicapped persons transportation problem
- Self-configuring Nature Inspired Algorithms for Combinatorial Optimization Problems
- A genetic algorithm for a green vehicle routing problem
- A faster heuristic for the traveling salesman problem with drone
- NeuroGenetic approach for combinatorial optimization: an exploratory analysis
- Case injected genetic algorithms for traveling salesman problems
- Variable and large neighborhood search to solve the multiobjective set covering problem
- Branch and bound algorithms for the multidimensional assignment problem
- The joint maintenance operation selection and technician routing problem
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- A solution approach to the inventory routing problem in a three-level distribution system
- A framework for analyzing sub-optimal performance of local search algorithms
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- A deep reinforcement learning hyperheuristic for the covering tour problem with varying coverage
- A discrete state transition algorithm for generalized traveling salesman problem
- The generalized covering salesman problem
- Chain partitioning as a key element for building vehicle routing problem heuristics
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Sequential search and its application to vehicle-routing problems
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- An efficient local search for the feedback vertex set problem
- Efficiently solving very large-scale routing problems
- Genetic local search with distance preserving recombination operator for a vehicle routing problem.
- A comparison of algorithms for finding an efficient theme park tour
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Problem size reduction methods for large CVRPs
- A matheuristic for the two-echelon inventory-routing problem
- Bounds for the symmetric 2-peripatetic salesman problem
- Solving travelling salesman problem using ant systems: a programmer's approach
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force
- A simulated annealing approach for reliability-based chance-constrained programming
- An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
- A hybrid genetic algorithm with type-aware chromosomes for traveling salesman problems with drone
- Optimal partitioning of a data set based on the \(p\)-median model
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- Algorithm runtime prediction: methods \& evaluation
- Match twice and stitch: a new TSP tour construction heuristic.
- COBLOC: A hierarchical method for blocking network data
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Traveling salesman problem with backend information processing
- Analysis of a high-performance TSP solver on the GPU
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A new approach to choosing initial points in local search
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
- The landscape of the traveling salesman problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Searching for better fill-in
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
This page was built for publication: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5671788)
