Pages that link to "Item:Q2367016"

The following pages link to Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016):

Displaying 50 items.

• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← links)
• Thirty years of heterogeneous vehicle routing (Q320861) (← links)
• An adaptive evolutionary approach for real-time vehicle routing and dispatching (Q336366) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
• Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) (← links)
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
• The case for strategic oscillation (Q542006) (← links)
• Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
• 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)
• An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup (Q833542) (← links)
• Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm (Q844205) (← 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)
• Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
• NeuroGenetic approach for combinatorial optimization: an exploratory analysis (Q970182) (← links)
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
• The multi-shift vehicle routing problem with overtime (Q976019) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
• Approximative solutions to the bicriterion vehicle routing problem with time windows (Q1038402) (← 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)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization (Q1654574) (← links)
• A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run (Q1665593) (← links)