Pages that link to "Item:Q4658480"

The following pages link to A unified tabu search heuristic for vehicle routing problems with time windows (Q4658480):

Displaying 50 items.

• Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits (Q1628066) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
• A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways (Q1652574) (← links)
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• Vehicle routing with arrival time diversification (Q1711450) (← links)
• A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
• A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows (Q1717814) (← links)
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
• Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain (Q1735180) (← links)
• Vehicle routing problem for multiple product types, compartments, and trips with soft time windows (Q1751334) (← links)
• A time-based pheromone approach for the ant system (Q1758053) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
• Exact and hybrid methods for the multiperiod field service routing problem (Q1788906) (← links)
• Application of multiagent technologies to multiple depot vehicle routing problem with time windows (Q1792533) (← links)
• Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) (← links)
• Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
• Routing relatively few customers per route (Q1876468) (← links)
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
• A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
• Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
• An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
• A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
• Bi-objective offshore supply vessel planning with costs and persistence objectives (Q2273681) (← links)
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles (Q2292364) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← 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)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• A multi-start local search heuristic for ship scheduling -- a computational study (Q2433394) (← links)
• The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
• Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (Q2475859) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)