A GRASP for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Recommendations
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- GRASP with a new local search scheme for vehicle routing problems with time windows
- Vehicle Routing with Time Windows
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Cited in
(57)- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Heuristics for the flow line problem with setup costs
- GRASP with a new local search scheme for vehicle routing problems with time windows
- Towards a decision support system for the ready concrete distribution system: a case of a Greek company.
- A heuristic algorithm for solving hazardous materials distribution problems.
- Vehicle routing with backhauls: review and research perspectives
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- A multi-start local search algorithm for the vehicle routing problem with time windows
- Routing problems: A bibliography
- The simulated trading heuristic for solving vehicle routing problems
- Metaheuristics: A bibliography
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- City-courier routing and scheduling problems
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- An optimization algorithm for a capacitated vehicle routing problem with time windows
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Ant colony system for a dynamic vehicle routing problem
- The multiple TSP with time windows: vehicle bounds based on precedence graphs
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- An effective and fast heuristic for the dial-a-ride problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- An approach for efficient ship routing
- Real-life vehicle routing with time windows for visual attractiveness and operational robustness
- A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy
- POPMUSIC for a real-world large-scale vehicle routing problem with time windows
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Challenges and opportunities in attended home delivery
- scientific article; zbMATH DE number 4047422 (Why is no real title available?)
- A sequential GRASP for the therapist routing and scheduling problem
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows
- A greedy look-ahead heuristic for the vehicle routing problem with time windows
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- Matheurísticas para resolver el problema de ruteo de vehículos con ventanas de tiempo
- Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity
- Path inequalities for the vehicle routing problem with time windows
- A reactive GRASP with path relinking for capacitated clustering
- New lower bounds on the number of vehicles for the vehicle routing problem with time windows
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Using constraint-based operators to solve the vehicle routing problem with time windows
- A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Efficient GRASP solution approach for the prisoner transportation problem
- Customized GRASP for rehabilitation therapy scheduling with appointment priorities and accounting for therapist satisfaction
- A split-embedded metaheuristic for the heterogeneous inventory routing problem with batch size
- GRASP and VNS approaches for a vehicle routing problem with step cost functions
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem
- Collaborative platooning and routing for mixed fleets of electric automated vehicles and conventional trucks
- Metaheuristics in combinatorial optimization
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Improved modeling and solution methods for the multi-resource routing problem
- Comparing backhauling strategies in vehicle routing using ant colony optimization
This page was built for publication: A GRASP for the Vehicle Routing Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835445)
