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 49 items.

• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm (Q2465483) (← links)
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem (Q2489128) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
• Fast and high precision algorithms for optimization in large-scale genomic problems (Q2490543) (← links)
• Path relinking for the vehicle routing problem (Q2491329) (← links)
• Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem (Q2508207) (← links)
• Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← links)
• A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
• Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
• A tabu search heuristic for the truck and trailer routing problem (Q2571183) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit (Q2630092) (← links)
• Route optimization cold chain logistic distribution using greedy search method (Q2656558) (← links)
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem (Q2676358) (← links)
• An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
• An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems (Q3296386) (← links)
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
• Applying an Intensification Strategy on Vehicle Routing Problem (Q3564531) (← links)
• A Hybrid Genetic Approach for the Dynamic Vehicle Routing Problem with Time Windows (Q3605829) (← links)
• Chain partitioning as a key element for building vehicle routing problem heuristics (Q3620287) (← links)
• From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future (Q3637316) (← links)
• Algorithms for the Vehicle Routing Problems with Time Deadlines (Q4305486) (← links)
• A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem (Q4543518) (← links)
• AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS (Q4675892) (← links)
• Iterated local search for the vehicle routing problem with a private fleet and a common carrier (Q5059448) (← links)
• New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
• Local Search Algorithms for the Maximal Planar Layout Problem (Q5689972) (← links)
• (Q5708512) (← links)
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem (Q5746676) (← links)
• Simple heuristics for the multi-period fleet size and mix vehicle routing problem (Q5879646) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
• Comparing descent heuristics and metaheuristics for the vehicle routing problem (Q5926600) (← links)
• Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
• A variable neighborhood search for flying sidekick traveling salesman problem (Q6088243) (← links)
• Ant algorithm for GPS surveying problem with fuzzy pheromone updating (Q6097193) (← links)
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach (Q6099456) (← links)
• Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic (Q6110177) (← links)
• Routing Courier Delivery Services with Urgent Demand (Q6160118) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)