LKH
From MaRDI portal
Software:16903
No author found.
Related Items (only showing first 100 items - show all)
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ Generating subtour elimination constraints for the TSP from pure integer solutions ⋮ Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ Chained Lin-Kernighan for Large Traveling Salesman Problems ⋮ Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems ⋮ Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics ⋮ Genetic operators for combinatorial optimization in TSP and microarray gene ordering ⋮ Graph-Theoretic Concepts in Computer Science ⋮ The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing ⋮ A computational software system to design order picking warehouses ⋮ Reinforcement learning for combinatorial optimization: a survey ⋮ Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Guidelines for the computational testing of machine learning approaches to vehicle routing problems ⋮ Crowdsourced humanitarian relief vehicle routing problem ⋮ Optimal TSP tour length estimation using standard deviation as a predictor ⋮ A branch-and-cut approach for the distributed no-wait flowshop scheduling problem ⋮ Optimal TSP tour length estimation using Sammon maps ⋮ Using regression models to understand the impact of route-length variability in practical vehicle routing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A tabu search algorithm for the single vehicle routing allocation problem ⋮ Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem ⋮ Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem ⋮ Optimization of logistics services in hospitals ⋮ A study on the effects of normalized TSP features for automated algorithm selection ⋮ Unnamed Item ⋮ Dynamical Systems Theory and Algorithms for NP-hard Problems ⋮ Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study ⋮ A novel bio-inspired approach based on the behavior of mosquitoes ⋮ Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP ⋮ Visiting near-optimal solutions using local search algorithms ⋮ Special Frequency Quadrilaterals and an Application ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Efficient heuristics for Median Cycle Problems ⋮ Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem ⋮ Determination of the candidate arc set for the asymmetric traveling salesman problem ⋮ A concise guide to the Traveling Salesman Problem ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ Locating a cycle in a transportation or a telecommunications network ⋮ A Neural-Network-Based Approach to the Double Traveling Salesman Problem ⋮ Theoretical insights into the augmented-neural-network approach for combinatorial optimization ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ Finite-time performance analysis of static simulated annealing algorithms ⋮ A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse ⋮ Genetic Algorithms and Genetic Programming ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Heuristiques pour le Problème du Vendeurm-Péripatétique ⋮ Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP ⋮ A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem ⋮ Continuous relaxations for the traveling salesman problem ⋮ The Generalized Covering Salesman Problem ⋮ A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals ⋮ A construction for directed in-out subgraphs of optimal size ⋮ A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP ⋮ Continuous reformulations and heuristics for the Euclidean travelling salesperson problem ⋮ Dynamic traveling salesman problem with stochastic release dates ⋮ On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers ⋮ Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles ⋮ Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples ⋮ Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks ⋮ 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 ⋮ Traveling salesman problems with PageRank distance on complex networks reveal community structure ⋮ Embedded local search approaches for routing optimization ⋮ Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP ⋮ A distribution-free TSP tour length estimation model for random graphs ⋮ The \(k\)-dissimilar vehicle routing problem ⋮ Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem ⋮ The multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ A fresh look at the traveling salesman problem with a center ⋮ An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ On the recoverable robust traveling salesman problem ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ A decomposition-based heuristic for the multiple-product inventory-routing problem ⋮ Ambulance routing for disaster response with patient groups ⋮ Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm ⋮ An iterated local search for the traveling salesman problem with release dates and completion time minimization ⋮ A simulated annealing heuristic for the open location-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 ⋮ Solving large batches of traveling salesman problems with parallel and distributed computing ⋮ GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem ⋮ Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem ⋮ The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement ⋮ Social structure optimization in team formation ⋮ A two-phase solution algorithm for the flexible periodic vehicle routing problem ⋮ Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ Solving large-scale TSP using a fast wedging insertion partitioning approach ⋮ Improving the robustness of EPS to solve the TSP ⋮ Deep policy dynamic programming for vehicle routing problems
This page was built for software: LKH
