The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
From MaRDI portal
The vehicle routing problem (VRP) is considered, seen as a travelling salesman problem (TSP) with time windows. The objective is to minimize route duration while serving each customer within the predefined time interval (time window). The author generalizes and extends the edge-exchange improvement method of the TSP and shows that applied to the VRP problem with time windows it does not increase the computing complexity. The key issues in the proposed algorithm are: the lexicographic search strategy in edge exchanges and the choice of the set of global variables to test the feasibility and profitability of actual exchange. A theorem is proved enabling the calculation of the forward slack time (i.e. the maximum possible delay of the departure time of a vertex which does not yet affect feasibility of the path). Also some numerical examples are discussed, showing the robustness of the method.
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)- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Local search with annealing-like restarts to solve the VRPTW
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- 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
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Bi-objective orienteering for personal activity scheduling
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
- Designing granular solution methods for routing problems with time windows
- Typology and literature review for dial-a-ride problems
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Vehicle routing with arrival time diversification
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- A time-based pheromone approach for the ant system
- The Canadian minimum duration truck driver scheduling problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Solving routing problems with pairwise synchronization constraints
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- Tabu search heuristics for the vehicle routing problem with time windows.
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
- Models and algorithms for the delivery and installation routing problem
- Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks
- On the one-to-one pickup-and-delivery problem with time windows and trailers
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
- The prisoner transportation problem
- The vehicle routing problem with arrival time diversification on a multigraph
- Minimising vehicle distribution duration considering service priority
- The time-dependent vehicle routing problem with time windows and road-network information
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- Design and operation for an electric taxi fleet
- Recovery management for a dial-a-ride system with real-time disruptions
- Waste collection inventory routing with non-stationary stochastic demands
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- The dial-a-ride problem: Models and algorithms
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A unified solution framework for multi-attribute vehicle routing problems
- The mixed capacitated general routing problem under uncertainty
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- Variable neighborhood search for the dial-a-ride problem
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- The vessel swap-body routing problem
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Competition and cooperation in pickup and multiple delivery problems
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- 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
- The vehicle-routing problem with time windows and driver-specific times
- A two-stage solution method for the annual dairy transportation problem
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Location-arc routing problem: heuristic approaches and test instances
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- Local optimization of routes in vehicle routing problems with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- A multi-shift vehicle routing problem with windows and cycle times
- A parallel matheuristic for the technician routing and scheduling problem
- A sequential GRASP for the therapist routing and scheduling problem
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- The delivery man problem with time windows
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Optimal vehicle routing with lower and upper bounds on route durations
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- Heuristic approaches to minimize tour duration for the TSP with multiple time windows
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Optimizing departure times in vehicle routes
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Scheduling issues in vehicle routing
- Multi-depot vehicle routing problem with time windows under shared depot resources
- Parcel delivery cost minimization with time window constraints using trucks and drones
- Enhanced iterated local search for the technician routing and scheduling problem
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
- Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies
- 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
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Securing home health care in times of natural disasters
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
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)
