Pages that link to "Item:Q1584821"
From MaRDI portal
The following pages link to An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821):
Displaying 50 items.
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Using a TSP heuristic for routing order pickers in warehouses (Q1044093) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Traveling salesman problems with PageRank distance on complex networks reveal community structure (Q1620011) (← links)
- Total distance approximations for routing solutions (Q1628118) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- An iterated local search for the traveling salesman problem with release dates and completion time minimization (Q1651639) (← links)
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem (Q1652128) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- A two-phase solution algorithm for the flexible periodic vehicle routing problem (Q1654343) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Utilizing individual picker skills to improve order batching in a warehouse (Q1694830) (← links)
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (Q1694923) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem (Q1708538) (← links)
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle (Q1722882) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse (Q1740491) (← links)
- A genetic algorithm for a green vehicle routing problem (Q1742204) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review (Q1754199) (← links)
- A study on the effect of the asymmetry on real capacitated vehicle routing problems (Q1761138) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- Exact algorithms for the order picking problem (Q1782167) (← links)
- A distributed implementation of simulated annealing for the travelling salesman problem (Q1822906) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2026705) (← links)
- Routing automated lane-guided transport vehicles in a warehouse handling returns (Q2030483) (← links)
- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem (Q2039712) (← links)
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem (Q2070343) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- Analyzing the performance of TSP solver methods (Q2093970) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- The parallel drone scheduling problem with multiple drones and vehicles (Q2116866) (← links)
