Pages that link to "Item:Q5378825"

The following pages link to A Method for Solving Traveling-Salesman Problems (Q5378825):

Displaying 50 items.

• A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
• Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
• The multiple team formation problem using sociometry (Q342525) (← links)
• A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
• Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
• Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• A variable depth search branching (Q453047) (← links)
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
• A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
• The band collocation problem (Q782758) (← links)
• Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm (Q844205) (← links)
• A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector (Q863996) (← links)
• Multicriteria tour planning for mobile healthcare facilities in a developing country (Q864026) (← links)
• An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
• Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
• Truncated \(M\)-travelling salesman problem (Q998696) (← links)
• Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
• A review of Hopfield neural networks for solving mathematical programming problems (Q1042039) (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
• A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
• A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
• \(k\)-interchange heuristic as an optimization procedure for material handling applications (Q1401081) (← links)
• A local search template. (Q1406708) (← links)
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. (Q1410330) (← links)
• Dispatching of small containers via coastal freight liners: The case of the Aegean sea. (Q1412735) (← links)
• Combination of geographical information system and efficient routing algorithms for real life distribution operations. (Q1412749) (← links)
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
• Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
• The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)
• Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
• Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks (Q1652223) (← links)
• Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
• Heuristics for synthesizing robust networks with a diameter constraint (Q1718143) (← links)
• Advancing Shannon entropy for measuring diversity in systems (Q1722720) (← links)