Pages that link to "Item:Q4291474"

The following pages link to Parallel iterative search methods for vehicle routing problems (Q4291474):

Displaying 50 items.

• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• A study on the effect of the asymmetry on real capacitated vehicle routing problems (Q1761138) (← 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)
• 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)
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
• The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
• A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781) (← links)
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Parallel local search (Q1922627) (← links)
• Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
• POPMUSIC for the travelling salesman problem (Q1991147) (← links)
• Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• An improved ant colony optimization for vehicle routing problem (Q2378461) (← links)
• Dynamic vehicle routing using genetic algorithms (Q2383962) (← 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)
• Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid (Q2466400) (← links)
• The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
• A tabu search approach for the livestock collection problem (Q2482370) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← 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)
• A memetic algorithm for the multi trip vehicle routing problem (Q2514735) (← 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)
• Ant colony system for a dynamic vehicle routing problem (Q2583173) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem (Q3057120) (← links)
• A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline (Q3467854) (← links)
• A tabu search procedure for coordinating production, inventory and distribution routing problems (Q3563621) (← links)
• Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem (Q4543518) (← links)
• Simulated annealing heuristic for the general share-a-ride problem (Q5058863) (← links)