The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

DOI10.1287/IJOC.4.2.146zbMath0780.90105OpenAlexW2103480272MaRDI QIDQ4030786

Savelsbergh, Martin W. P.

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

zbMATH Keywords

vehicle routingtime windowstravelling salesmanedge-exchange improvement method

Mathematics Subject Classification ID

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

Related Items (only showing first 100 items - show all)

É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 ⋮ A ride time-oriented scheduling algorithm for dial-a-ride problems ⋮ 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 ⋮ Collaborative transportation for attended home deliveries ⋮ Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem ⋮ Fleet resupply by drones for last-mile delivery ⋮ Multi-period time window assignment for attended home delivery ⋮ Ten years of Routist: vehicle routing lessons learned from practice ⋮ Visiting nurses assignment and routing for decentralized telehealth service networks ⋮ A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery ⋮ A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service ⋮ Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem ⋮ An optimization approach for communal home meal delivery service: A case study ⋮ The mixed capacitated general routing problem under uncertainty ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows ⋮ 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 ⋮ Applying the attribute based hill climber heuristic to the vehicle routing 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 ⋮ 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 ⋮ 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 ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ 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 heuristic for very large scale vehicle routing problems ⋮ A parallel matheuristic for the technician routing and scheduling problem ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ The prisoner transportation problem ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ The vehicle routing problem with arrival time diversification on a multigraph ⋮ The vessel swap-body routing problem ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges ⋮ 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 ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ Designing granular solution methods for routing problems with time windows ⋮ Typology and literature review for dial-a-ride problems ⋮ The delivery man problem with time windows ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints ⋮ Vehicle routing with arrival time diversification ⋮ Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows ⋮ Competition and Cooperation in Pickup and Multiple Delivery Problems ⋮ Securing home health care in times of natural disasters ⋮ Heuristics for routing heterogeneous unmanned vehicles with fuel constraints ⋮ Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ The petrol station replenishment problem with time windows ⋮ Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ A time-based pheromone approach for the ant system ⋮ The dial-a-ride problem: Models and algorithms ⋮ Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study ⋮ A cooperative parallel metaheuristic for the capacitated vehicle routing problem ⋮ An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays ⋮ Optimizing departure times in vehicle routes ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Design and operation for an electric taxi fleet ⋮ Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks ⋮ Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows ⋮ An effective memetic algorithm for the cumulative capacitated vehicle routing problem ⋮ A two-phase hybrid metaheuristic 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 ⋮ An adaptive VNS algorithm for vehicle routing problems with intermediate stops ⋮ A polyhedral study of the asymmetric traveling salesman problem with time windows ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ 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 ⋮ Solving routing problems with pairwise synchronization constraints ⋮ Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks ⋮ Scheduling issues in vehicle routing

This page was built for publication: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration