Pages that link to "Item:Q4319751"

The following pages link to Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees (Q4319751):

Displaying 50 items.

• The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
• Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing (Q357949) (← links)
• Disrupted capacitated vehicle routing problem with order release delay (Q367646) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window (Q742692) (← links)
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
• Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
• A note on ``Coordination of production and distribution planning'' by P. Chandra and M. L. Fisher (Q856257) (← links)
• Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results (Q878563) (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• A GA based heuristic for the vehicle routing problem with multiple trips (Q928681) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
• A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) (← links)
• A Lagrangian relaxation approach for the multiple sequence alignment problem (Q1016042) (← links)
• Combined location-routing problems -- a neural network approach (Q1026597) (← links)
• A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
• A result on projection for the vehicle routing problem (Q1127162) (← links)
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
• A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
• A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach (Q1370717) (← links)
• Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560) (← links)
• Optimization of printed circuit board manufacturing: Integrated modeling and algorithms (Q1577779) (← links)
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
• Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
• Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• The open vehicle routing problem with decoupling points (Q1681358) (← links)
• Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• 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)
• A hierarchical algorithm for the planar single-facility location routing problem (Q1761993) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)