Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
From MaRDI portal
Publication:3748044
Recommendations
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- Vehicle scheduling with combinable delivery and pickup operations
- Scheduling deliveries in vehicles with multiple compartments
- Single-Vehicle Routing and Scheduling to Minimize the Number of Delays
- Optimizing routing and delivery patterns with multi-compartment vehicles
- Models and Algorithms for Single-Depot Vehicle Scheduling
- Single-vehicle scheduling with time window constraints
- Multi-depot vehicle scheduling problems with time windows and waiting costs
Cited in
(39)- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Étude comparative de divers modèles pour le problème de transport à la demande
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- The pickup and delivery problem with time windows
- A dial-a-ride problem for client transportation in a health-care organization
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- Scheduling trucks in local depots for door-to-door delivery services
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Exact solutions for the collaborative pickup and delivery problem
- Ship scheduling with soft time windows: An optimisation based approach
- Vehicle routing problems with simultaneous pick-up and delivery service.
- Vehicle scheduling with combinable delivery and pickup operations
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Efficient feasibility testing for dial-a-ride problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Routing problems: A bibliography
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Resource extension functions: properties, inversion, and generalization to segments
- The dial-a-ride problem: Models and algorithms
- Local search heuristics for the probabilistic dial-a-ride problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Exact algorithms for the vehicle routing problem with soft time windows
This page was built for publication: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748044)
