The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

DOI10.1287/IJOC.4.2.146zbMATH Open0780.90105OpenAlexW2103480272MaRDI QIDQ4030786FDOQ4030786

Authors: Martin W. P. Savelsbergh 

Publication date: 1 April 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/aff93e014b64beb97b65edffc9e67f5228fa6e5d

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

zbMATH Keywords

time windowsvehicle routingtravelling salesmanedge-exchange improvement method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Paths and cycles (05C38) Transportation, logistics and supply chain management (90B06)

Cited In (only showing first 100 items - show all)

• Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
• The mixed capacitated general routing problem under uncertainty
• A sequential GRASP for the therapist routing and scheduling problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• The time-dependent vehicle routing problem with time windows and road-network information
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
• On the one-to-one pickup-and-delivery problem with time windows and trailers
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
• 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
• Optimizing departure times in vehicle routes
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• The timetable constrained distance minimization problem
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Heuristics for the multi-period orienteering problem with multiple time windows
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
• 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
• A parallel matheuristic for the technician routing and scheduling problem
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• A comparison of column-generation approaches to the synchronized pickup and delivery problem
• Securing home health care in times of natural disasters
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• The petrol station replenishment problem with time windows
• Optimal vehicle routing with lower and upper bounds on route durations
• Integrated timetabling and vehicle scheduling with balanced departure times
• 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
• The vehicle-routing problem with time windows and driver-specific times
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• 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
• A unified solution framework for multi-attribute vehicle routing problems
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• The delivery man problem with time windows
• An adaptive large neighborhood search heuristic for the share-a-ride problem
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
• The vehicle routing problem with flexible time windows and traveling times
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Recent models and algorithms for one-to-one pickup and delivery problems
• A multi-shift vehicle routing problem with windows and cycle times
• Tabu search heuristics for the vehicle routing problem with time windows.
• Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
• Multi-depot vehicle routing problem with time windows under shared depot resources
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
• Local search with annealing-like restarts to solve the VRPTW
• The dial-a-ride problem: Models and algorithms
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• Variable neighborhood search for the dial-a-ride problem
• Typology and literature review for dial-a-ride problems
• Local search heuristics for the probabilistic dial-a-ride problem
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
• Design and operation for an electric taxi fleet
• Scheduling issues in vehicle routing
• A time-based pheromone approach for the ant system
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
• Synchronisation in vehicle routing: classification schema, modelling framework and literature review
• Étude comparative de divers modèles pour le problème de transport à la demande
• A ride time-oriented scheduling algorithm for dial-a-ride problems
• Collaborative transportation for attended home deliveries
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
• Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
• Waste collection inventory routing with non-stationary stochastic demands
• Fleet resupply by drones for last-mile delivery
• Multi-period time window assignment for attended home delivery
• Minimizing customers' waiting time in a vehicle routing problem with unit demands
• Models and algorithms for the delivery and installation routing problem
• The Canadian minimum duration truck driver scheduling problem
• A mixed constrained (identical) vehicle routing problem for time minimisation
• 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
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
• A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
• Competition and cooperation in pickup and multiple delivery problems
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
• Local optimization of routes in vehicle routing problems with time windows
• 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 matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• The vehicle routing problem with arrival time diversification on a multigraph
• Parcel delivery cost minimization with time window constraints using trucks and drones
• Enhanced iterated local search for the technician routing and scheduling problem

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)