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 34 items.
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
- A heuristic for the routing and carrier selection problem (Q2371384) (← links)
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls (Q2378454) (← links)
- An improved ant colony optimization for vehicle routing problem (Q2378461) (← links)
- Dynamic vehicle routing using genetic algorithms (Q2383962) (← links)
- Integrating multi-product production and distribution in newspaper logistics (Q2459393) (← links)
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem (Q2459404) (← links)
- Heuristics for the lexicographic Max-ordering vehicle routing problem (Q2461267) (← links)
- 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)
- 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)
- Local Search Algorithms for the Maximal Planar Layout Problem (Q5689972) (← links)
- (Q5708512) (← links)
- Comparing descent heuristics and metaheuristics for the vehicle routing problem (Q5926600) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)