Pickup and Delivery of Partial Loads with “Soft” Time Windows

DOI10.1080/01966324.1986.10737200zbMath0633.90029OpenAlexW2056638946WikidataQ58176210 ScholiaQ58176210MaRDI QIDQ3771948

Thomas R. Sexton, Young-Myung Choi

Publication date: 1986

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1986.10737200

zbMATH Keywords

time windowsnetwork flowBenders' decompositiondwell timespartial loadsroute improvement heuristicsingle-vehicle routing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (23)

A goal programming approach to vehicle routing problems with soft time windows ⋮ An effective and fast heuristic for the dial-a-ride problem ⋮ A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives ⋮ Routing problems: A bibliography ⋮ 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 ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ A dial-a-ride problem for client transportation in a health-care organization ⋮ The pickup and delivery problem with time windows ⋮ Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm ⋮ Vehicle routing problems with simultaneous pick-up and delivery service. ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ A column generation algorithm for the vehicle routing problem with soft time windows ⋮ Ship scheduling with soft time windows: An optimisation based approach ⋮ Dynamic transportation of patients in hospitals ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ Multi-depot vehicle scheduling problems with time windows and waiting costs ⋮ Vehicle routing problem with fuzzy time windows ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service ⋮ Planning models for long-haul operations of postal and express shipment companies ⋮ A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows ⋮ Perturbation heuristics for the pickup and delivery traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Traffic scheduling via Benders decomposition
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

This page was built for publication: Pickup and Delivery of Partial Loads with “Soft” Time Windows