Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
From MaRDI portal
Publication:3748044
DOI10.1287/trsc.19.4.378zbMath0608.90043OpenAlexW2139445665MaRDI QIDQ3748044
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
Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, 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, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, 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, Étude comparative de divers modèles pour le problème de transport à la demande, 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, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, 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, Recent progress of local search in handling the time window constraints of the vehicle routing problem, The pickup and delivery problem with time windows, Vehicle routing problems with simultaneous pick-up and delivery service., An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Recent progress of local search in handling the time window constraints of the vehicle routing problem, The dial-a-ride problem: Models and algorithms, Resource extension functions: properties, inversion, and generalization to segments, Ship scheduling with soft time windows: An optimisation based approach, Exact solutions for the collaborative pickup and delivery problem, Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows, Multi-depot vehicle scheduling problems with time windows and waiting costs, An iterative improvement approach for the nonpreemptive open shop scheduling 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, Perturbation heuristics for the pickup and delivery traveling salesman problem, Efficient feasibility testing for dial-a-ride problems
