A parallel algorithm for the vehicle routing problem with time window constraints

Cited In (18)

New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Parallel Solution Methods for Vehicle Routing Problems
Applying the attribute based hill climber heuristic to the vehicle routing problem
A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
Parallelization of a two-phase metaheuristic for routing problems with time windows
A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis
Optimisation enhancement using self‐organising fuzzy control
Tabu search heuristics for the vehicle routing problem with time windows.
A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
Vehicle routing problem with time windows and a limited number of vehicles.
COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
Active guided evolution strategies for large-scale vehicle routing problems with time windows
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows

This page was built for publication: A parallel algorithm for the vehicle routing problem with time window constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290169)