The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
From MaRDI portal
Publication:4030786
Recommendations
- Vehicle Routing with Time Windows
- scientific article; zbMATH DE number 4047423
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle routing and scheduling with time windows
Cited in
(only showing first 100 items - show all)- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Local search with annealing-like restarts to solve the VRPTW
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Securing home health care in times of natural disasters
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- Design and operation for an electric taxi fleet
- Location-arc routing problem: heuristic approaches and test instances
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- The time-dependent vehicle routing problem with time windows and road-network information
- On the one-to-one pickup-and-delivery problem with time windows and trailers
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Recent models and algorithms for one-to-one pickup and delivery problems
- Optimizing departure times in vehicle routes
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- A sequential GRASP for the therapist routing and scheduling problem
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- A multi-shift vehicle routing problem with windows and cycle times
- Heuristics for the multi-period orienteering problem with multiple time windows
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Integrated timetabling and vehicle scheduling with balanced departure times
- Scheduling issues in vehicle routing
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- A time-based pheromone approach for the ant system
- The dial-a-ride problem: Models and algorithms
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- A parallel matheuristic for the technician routing and scheduling problem
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Variable neighborhood search for the dial-a-ride problem
- The delivery man problem with time windows
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- The vehicle routing problem with flexible time windows and traveling times
- The petrol station replenishment problem with time windows
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Local search heuristics for the probabilistic dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- Tabu search heuristics for the vehicle routing problem with time windows.
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- The timetable constrained distance minimization problem
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- Optimal vehicle routing with lower and upper bounds on route durations
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- A two-stage solution method for the annual dairy transportation problem
- Multi-depot vehicle routing problem with time windows under shared depot resources
- The vehicle-routing problem with time windows and driver-specific times
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- A unified solution framework for multi-attribute vehicle routing problems
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- An optimization approach for communal home meal delivery service: A case study
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- The mixed capacitated general routing problem under uncertainty
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- A mixed constrained (identical) vehicle routing problem for time minimisation
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Parcel delivery cost minimization with time window constraints using trucks and drones
- Designing granular solution methods for routing problems with time windows
- Enhanced iterated local search for the technician routing and scheduling problem
- Models and algorithms for the delivery and installation routing problem
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- Étude comparative de divers modèles pour le problème de transport à la demande
- Local optimization of routes in vehicle routing problems with time windows
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- The prisoner transportation problem
- Visiting nurses assignment and routing for decentralized telehealth service networks
- Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
- Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks
- A ride time-oriented scheduling algorithm for dial-a-ride problems
- Fleet resupply by drones for last-mile delivery
- Multi-period time window assignment for attended home delivery
- Minimising vehicle distribution duration considering service priority
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Bi-objective orienteering for personal activity scheduling
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- Ten years of Routist: vehicle routing lessons learned from practice
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
This page was built for publication: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030786)
