Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling

DOI10.1287/TRSC.19.4.378zbMATH Open0608.90043OpenAlexW2139445665MaRDI QIDQ3748044FDOQ3748044

Lawrence Bodin, Thomas R. Sexton

Publication date: 1985

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.19.4.378

zbMATH Keywords

vehicle routingBenders' decompositionheuristic routing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (36)

• Étude comparative de divers modèles pour le problème de transport à la demande
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• Vehicle routing problems with alternative paths: an application to on-demand transportation
• A dial-a-ride problem for client transportation in a health-care organization
• The pickup and delivery problem with time windows
• Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows
• 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
• 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
• Ship scheduling with soft time windows: An optimisation based approach
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
• Exact solutions for the collaborative pickup and delivery problem
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
• Vehicle routing problems with simultaneous pick-up and delivery service.
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• Vehicle scheduling with combinable delivery and pickup operations
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Efficient feasibility testing for dial-a-ride problems
• Routing problems: A bibliography
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• 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
• 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
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Local search heuristics for the probabilistic dial-a-ride problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem

Recommendations

• Multi-depot vehicle scheduling problems with time windows and waiting costs 👍 👎
• Scheduling deliveries in vehicles with multiple compartments 👍 👎
• Vehicle scheduling with combinable delivery and pickup operations 👍 👎
• Models and Algorithms for Single-Depot Vehicle Scheduling 👍 👎
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing 👍 👎
• Single-Vehicle Routing and Scheduling to Minimize the Number of Delays 👍 👎
• Single-vehicle scheduling with time window constraints 👍 👎
• Optimizing routing and delivery patterns with multi-compartment vehicles 👍 👎

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)