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)- The prisoner transportation problem
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- A multi-shift vehicle routing problem with windows and cycle times
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Recent models and algorithms for one-to-one pickup and delivery problems
- Tabu search heuristics for the vehicle routing problem with time windows.
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
- Local search with annealing-like restarts to solve the VRPTW
- Designing granular solution methods for routing problems with time windows
- Multi-depot vehicle routing problem with time windows under shared depot resources
- The dial-a-ride problem: Models and algorithms
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Local search heuristics for the probabilistic dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- Variable neighborhood search for the dial-a-ride problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- 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
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Vehicle routing with arrival time diversification
- Evaluating a simulated annealing metaheuristic for the heterogeneous on-demand bus routing problem with a novel experimental setup
- Design and operation for an electric taxi fleet
- Minimising vehicle distribution duration considering service priority
- A time-based pheromone approach for the ant system
- A novel hybrid PSO-heuristic algorithm with combinatorial Benders' cuts for maximal evacuation planning in wildfire disasters
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- Scheduling issues in vehicle routing
- 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
- 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 sequential GRASP for the therapist routing and scheduling problem
- The mixed capacitated general routing problem under uncertainty
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A ride time-oriented scheduling algorithm for dial-a-ride problems
- 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
- Collaborative transportation for attended home deliveries
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- An optimization approach for communal home meal delivery service: A case study
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Optimizing departure times in vehicle routes
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- A new effective heuristic for the prisoner transportation problem
- A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows
- Integrated crew organization and work zone scheduling for network-wide daily road pavement rehabilitation
- Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
- A review of recent advances in time-dependent vehicle routing
- The rail-road dial-a-ride problem
- Electric van-based robot deliveries with en-route charging
- The timetable constrained distance minimization problem
- Waste collection inventory routing with non-stationary stochastic demands
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- 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
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Fleet resupply by drones for last-mile delivery
- Multi-period time window assignment for attended home delivery
- Heuristics for the multi-period orienteering problem with multiple time windows
- Models and algorithms for the delivery and installation routing problem
- The Canadian minimum duration truck driver scheduling problem
- 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 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
- A parallel matheuristic for the technician routing and scheduling problem
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Competition and cooperation in pickup and multiple delivery problems
- Local optimization of routes in vehicle routing problems with time windows
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem 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
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- The vehicle routing problem with arrival time diversification on a multigraph
- Securing home health care in times of natural disasters
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- 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
- The petrol station replenishment problem with time windows
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)
