Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing

DOI10.1287/TRSC.19.4.411zbMATH Open0618.90042OpenAlexW4234920628MaRDI QIDQ3755217FDOQ3755217

Authors Thomas R. Sexton, Lawrence Bodin

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.411

zbMATH Keywords

computational experimentsheuristic algorithmroutingdesired delivery timessingle vehicle many-to-many pickup and delivery problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Pickup and Delivery of Partial Loads with “Soft” Time Windows
• Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
• An Heuristic Method for Solving Time-Sensitive Routeing Problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

Cited in

(32)

• Vehicle routing problems with simultaneous pick-up and delivery service.
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Vehicle routing problems with alternative paths: an application to on-demand transportation
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Efficient feasibility testing for dial-a-ride problems
• An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services
• scientific article; zbMATH DE number 1568945 (Why is no real title available?)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
• Resource extension functions: properties, inversion, and generalization to segments
• The dial-a-ride problem: Models and algorithms
• Routing problems: A bibliography
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• School-bus routing for program scheduling
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• Local search heuristics for the probabilistic dial-a-ride problem
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• A dial-a-ride problem for client transportation in a health-care organization
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• The pickup and delivery problem with time windows
• Exact solutions for the collaborative pickup and delivery problem
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Designing multi-vehicle delivery tours in a grid-cell format
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
• Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• Exact algorithms for the vehicle routing problem with soft time windows
• Pickup and Delivery of Partial Loads with “Soft” Time Windows

This page was built for publication: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755217)