LKH

swMATH4735MaRDI QIDQ16903FDOQ16903

Author name not available (Why is that?)

Described by source

• An effective implementation of the Lin-Kernighan traveling salesman heuristic

Cited In (only showing first 100 items - show all)

• Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems
• HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
• Knowledge-guided local search for the vehicle routing problem
• Solving the traveling salesman problem with interdiction and fortification
• A genetic algorithm for a green vehicle routing problem
• Sequencing and scheduling for filling lines in dairy production
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
• Efficiently solving very large-scale routing problems
• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
• An iterated local search for the traveling salesman problem with release dates and completion time minimization
• Optimal TSP tour length estimation using standard deviation as a predictor
• Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
• Continuous relaxations for the traveling salesman problem
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
• A study on the effect of the asymmetry on real capacitated vehicle routing problems
• Multiprogramming genetic algorithm for optimization problems with permutation property
• Global versus local search: the impact of population sizes on evolutionary algorithm performance
• Genetic operators for combinatorial optimization in TSP and microarray gene ordering
• Theoretical insights into the augmented-neural-network approach for combinatorial optimization
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
• A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• A two-phase solution algorithm for the flexible periodic vehicle routing problem
• Solving large batches of traveling salesman problems with parallel and distributed computing
• A survey of the standard location-routing problem
• Traveling salesman problems with PageRank distance on complex networks reveal community structure
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
• Exact algorithms for the order picking problem
• Reinforcement learning for combinatorial optimization: a survey
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• Extending single tolerances to set tolerances
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• A tabu search algorithm for the single vehicle routing allocation problem
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• The traveling purchaser problem and its variants
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• Utilizing individual picker skills to improve order batching in a warehouse
• An ILP-based local search procedure for the VRP with pickups and deliveries
• A computational software system to design order picking warehouses
• Deep policy dynamic programming for vehicle routing problems
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
• Neural large neighborhood search for routing problems
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
• A linearithmic heuristic for the travelling salesman problem
• A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
• Embedded local search approaches for routing optimization
• Learning to sparsify travelling salesman problem instances
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems
• Visiting near-optimal solutions using local search algorithms
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
• Chained Lin-Kernighan for large traveling salesman problems
• 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
• Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
• Generating subtour elimination constraints for the TSP from pure integer solutions
• Optimal TSP tour length estimation using Sammon maps
• Title not available (Why is that?)
• The salesman and the tree: the importance of search in CP
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• The generalized covering salesman problem
• Computing compatible tours for the symmetric traveling salesman problem
• A framework for analyzing sub-optimal performance of local search algorithms
• Improved filtering for weighted circuit constraints
• Algorithm runtime prediction: methods \& evaluation
• Locating a cycle in a transportation or a telecommunications network
• Using Markov chains to analyze the effectiveness of local search algorithms
• Heuristiques pour le Problème du Vendeurm-Péripatétique
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Title not available (Why is that?)
• Two-phase Pareto local search for the biobjective traveling salesman problem
• A tolerance-based heuristic approach for the weighted independent set problem
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• Finite-time performance analysis of static simulated annealing algorithms
• Pattern discrete and mixed hit-and-run for global optimization
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
• Efficient heuristics for Median Cycle Problems
• A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
• Extremal values of global tolerances in combinatorial optimization with an additive objective function
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• A distribution-free TSP tour length estimation model for random graphs
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
• The \(k\)-dissimilar vehicle routing problem
• The multi-compartment vehicle routing problem with flexible compartment sizes
• Synchronized routing of seasonal products through a production/distribution network
• The petrol station replenishment problem with time windows
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• Ambulance routing for disaster response with patient groups
• Expanding neighborhood GRASP for the traveling salesman problem
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
• On the recoverable robust traveling salesman problem
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• A simulated annealing heuristic for the open location-routing problem
• On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers

This page was built for software: LKH