Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
From MaRDI portal
Publication:3755217
DOI10.1287/trsc.19.4.411zbMath0618.90042OpenAlexW4234920628MaRDI QIDQ3755217
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.411
computational experimentsheuristic algorithmroutingdesired delivery timessingle vehicle many-to-many pickup and delivery problem
Related Items
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Solving a selective dial-a-ride problem with logic-based Benders decomposition, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Routing problems: A bibliography, The pickup and delivery problem: Faces and branch-and-cut algorithm, Vehicle routing problems with alternative paths: an application to on-demand transportation, An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows, Pickup and Delivery of Partial Loads with “Soft” Time Windows, A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases, 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, Local search heuristics for the probabilistic dial-a-ride problem, The pickup and delivery problem with time windows, Vehicle routing problems with simultaneous pick-up and delivery service., The dial-a-ride problem: Models and algorithms, Resource extension functions: properties, inversion, and generalization to segments, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, Exact solutions for the collaborative pickup and delivery problem, Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows, An iterative improvement approach for the nonpreemptive open shop scheduling problem, School-bus routing for program scheduling, 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, Perturbation heuristics for the pickup and delivery traveling salesman problem, Efficient feasibility testing for dial-a-ride problems
