Pages that link to "Item:Q5284221"

The following pages link to A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem (Q5284221):

Displaying 33 items.

• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
• A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
• Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
• On the solving strategy in composite heuristics (Q1200786) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
• A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• The period traveling salesman problem: A new heuristic algorithm (Q1603331) (← links)
• Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
• Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem (Q1659213) (← links)
• Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) (← links)
• Generalized network design problems. (Q1810478) (← links)
• A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
• Heuristics for the traveling purchaser problem (Q1870801) (← links)
• A new heuristic for the period traveling salesman problem (Q1894732) (← links)
• A heuristic for the routing and carrier selection problem (Q2371384) (← links)
• A new approach to solve the classical symmetric traveling salesman problem by zero suffix method (Q2908906) (← links)
• Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach (Q3534464) (← links)
• Discrete/Binary Approach (Q3649626) (← links)
• Accelerated branch exchange heuristics for symmetric traveling salesman problems (Q3790961) (← links)
• Fast Heuristics for Large Geometric Traveling Salesman Problems (Q4030791) (← links)
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem (Q4032587) (← links)
• A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem (Q4543518) (← links)
• Iterated local search for the vehicle routing problem with a private fleet and a common carrier (Q5059448) (← links)
• Improvements to the Or-opt heuristic for the symmetric travelling salesman problem (Q5428949) (← links)
• A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers (Q6079875) (← links)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)