Pages that link to "Item:Q2899121"

The following pages link to A Parallel Algorithm for the Vehicle Routing Problem (Q2899121):

Displaying 16 items.

• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
• Decision support for the technician routing and scheduling problem (Q6180048) (← links)