The following pages link to (Q4365133):
Displaying 50 items.
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Multi-objective optimal design of laminated composite skirt using hybrid NSGA (Q400113) (← links)
- Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- The multi-alternative cargo routing problem: solution by evolutionary methods (Q462099) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm (Q596885) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Switching codes and designs (Q658111) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- Path planning on a cuboid using genetic algorithms (Q942312) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- Pareto memetic algorithm for multiple objective optimization with an industrial application (Q945051) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Average-case approximation ratio of the 2-opt algorithm for the TSP (Q1015301) (← links)
- Combined location-routing problems -- a neural network approach (Q1026597) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Heuristics for the rural postman problem (Q1046717) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
- A local search template. (Q1406708) (← links)
- Nature's way of optimizing (Q1575193) (← links)
- A computational study of smoothing heuristics for the traveling salesman problem (Q1576330) (← links)
- Application of the noising method to the travelling salesman problem (Q1580974) (← links)
- Traveling salesman problems with PageRank distance on complex networks reveal community structure (Q1620011) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem (Q1659213) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
