Pages that link to "Item:Q2367016"
From MaRDI portal
The following pages link to Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016):
Displayed 50 items.
- A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
- A simulated annealing approach to the traveling tournament problem (Q880541) (← links)
- Comparing backhauling strategies in vehicle routing using ant colony optimization (Q926337) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- General local search methods (Q1268283) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem (Q1280120) (← links)
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem (Q1388833) (← links)
- Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- Integrating purchasing and routing in a propane gas supply chain. (Q1420453) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem (Q1571038) (← links)
- Heuristic solutions to multi-depot location-routing problems (Q1603335) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- Search strategies for the feeder bus network design problem (Q1609905) (← links)
- A two-phase tabu search approach to the location routing problem (Q1610130) (← links)
- Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A heuristic algorithm for the truckload and less-than-truckload problem (Q1771352) (← links)
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) (← links)
- A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
- A visual interactive approach to vehicle routing (Q1869906) (← links)
- A genetic algorithm for the vehicle routing problem (Q1870833) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- A tabu search heuristic for the multi-depot vehicle routing problem (Q1919200) (← links)
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781) (← links)
- Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
- Focused simulated annealing search: An application to job shop scheduling (Q1919835) (← links)
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- Tabu search for graph partitioning (Q1919841) (← links)
- A tabu search algorithm for frequency assignment (Q1919845) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control (Q1922638) (← links)
- A user's guide to tabu search (Q2366991) (← links)