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.
- 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 hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems (Q1955120) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
- An evolutionary approach for the target search problem in uncertain environment (Q2331590) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)
- Using cost change estimates in a local search heuristic for the pollution routing problem (Q2362177) (← links)
- A user's guide to tabu search (Q2366991) (← links)
- 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)
- Designing multi-period supply chain network considering risk and emission: a multi-objective approach (Q2404320) (← 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)
- 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)