Pages that link to "Item:Q3724091"

The following pages link to Using simulated annealing to solve routing and location problems (Q3724091):

Displaying 30 items.

• Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms (Q301071) (← links)
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
• Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
• Experimentation in optimization (Q1084342) (← links)
• On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
• Simulated annealing with noisy or imprecise energy measurements (Q1106726) (← links)
• Boltzmann machines for travelling salesman problems (Q1119182) (← links)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
• A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
• Nested annealing: A provable improvement to simulated annealing (Q1193895) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
• Simulated annealing applied to the process allocation problem (Q1199515) (← links)
• Genetic algorithms, function optimization, and facility layout design (Q1205709) (← links)
• Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
• A neural network approach to the vessel dispatching problem (Q1291624) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Nearest-neighbour heuristics in accelerated algorithms of optimisation problems (Q1330318) (← links)
• Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems (Q1339121) (← links)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
• A hybrid algorithm for identifying global and local minima when optimizing functions with many minima. (Q1428045) (← links)
• Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• A two-phased approach to the supply network reconfiguration problem (Q1971987) (← links)
• A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry (Q2168721) (← links)
• A parallel heuristic for quadratic assignment problems (Q2276872) (← links)
• Multicriteria facility layout problem: An integrated approach (Q2367381) (← links)
• Genetic algorithm for linear and cyclic assignment problem (Q2367417) (← links)
• A guarantee rate optimization model for wastewater treatment system design under uncertainty (Q6072153) (← links)