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.

• A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost (Q1665650) (← links)
• Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis (Q1674845) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• The late acceptance hill-climbing heuristic (Q1698884) (← links)
• Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes (Q1711890) (← links)
• Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network (Q1730648) (← links)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• Ant colony optimization with clustering for solving the dynamic location routing problem (Q1733491) (← 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)
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← 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)
• Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
• A tabu search heuristic for the multi-depot vehicle routing problem (Q1919200) (← links)
• A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781) (← links)
• Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
• Focused simulated annealing search: An application to job shop scheduling (Q1919835) (← links)
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
• Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
• 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)