The pickup and delivery problem with time windows
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- A new approach for crew pairing problems by column generation with an application to air transportation
- A reoptimization algorithm for the shortest path problem with time windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Integer Programming Formulation of Traveling Salesman 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
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Plus court chemin avec contraintes d'horaires
- Routing with time windows by column generation
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- Vehicle Routing with Time Windows
Cited in
(only showing first 100 items - show all)- Fleet routing position-based model for inventory pickup under production shutdown
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- Current modeling practices in bank courier scheduling
- scientific article; zbMATH DE number 4070617 (Why is no real title available?)
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Computational Science – ICCS 2005
- The vehicle routing problem with pickups and deliveries on some special graphs
- Minimization of travel time and weighted number of stops in a traffic-light network
- Moving products between location pairs: cross-docking versus direct-shipping
- The surgical patient routing problem: a central planner approach
- Expected part delays as a secondary layout criterion in automated manufacturing systems
- On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- The flexible and real-time commute trip sharing problems
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics
- Daily aircraft routing for amphibious ready groups
- Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots
- A review of design and control of automated guided vehicle systems
- A solution approach to find the critical path in a time-constrained activity network
- Van-based robot hybrid pickup and delivery routing problem
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- Shipping problems with body clock constraints.
- Operational planning of a large-scale multi-modal transportation system.
- Data mining-based dispatching system for solving the local pickup and delivery problem
- An effective and fast heuristic for the dial-a-ride problem
- Improved modeling and solution methods for the multi-resource routing problem
- Experiments with the ``Oregon Trail knapsack problem
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation
- A branch-and-price approach to the feeder network design problem
- Generalised pickup and delivery problem with dynamic time windows
- Single-vehicle scheduling with time window constraints
- A set covering approach for the pickup and delivery problem with general constraints on each route
- Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
- Exact solutions for the collaborative pickup and delivery problem
- The nuclear medicine production and delivery problem
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Exact solution of the soft-clustered vehicle-routing problem
- The demand weighted vehicle routing problem
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Solving a closed-loop location-inventory-routing problem with mixed quality defects returns in e-commerce by hybrid ant colony optimization algorithm
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Multi-objective temporal bin packing problem: an application in cloud computing
- Optimization of vehicle routes with delivery and pickup for a rental business: a case study
- Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
- Multi‐objective optimization of the maritime cargo routing and scheduling problem
- Household activity pattern problem with autonomous vehicles
- Competition and cooperation in pickup and multiple delivery problems
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
- The pickup and delivery problem with alternative locations and overlapping time windows
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- Vehicle routing problems with simultaneous pick-up and delivery service.
- Ship scheduling with soft time windows: An optimisation based approach
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- A two-phase heuristic for an in-port ship routing problem with tank allocation
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- Survey of research in the design and control of automated guided vehicle systems
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A near-exact method for solving the log-truck scheduling problem
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- Column generation approaches to ship scheduling with flexible cargo sizes
- Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems
- Collaborative transportation planning of less-than-truckload freight
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- Distribution of waiting time for dynamic pickup and delivery problems
- Real-time vehicle rerouting problems with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- Planning models for long-haul operations of postal and express shipment companies
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
- The dial-a-ride problem with private fleet and common carrier
- An exact algorithm for the pickup and delivery problem with time windows
- The pickup and delivery problem with time windows and scheduled lines
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- An optimization approach for planning daily drayage operations
- Bi-dynamic constraint aggregation and subproblem reduction
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- A genetic algorithm for service level based vehicle scheduling
- Critical path in an activity network with time constraints
- The shortest path problem with forbidden paths
- Resource extension functions: properties, inversion, and generalization to segments
- Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows
- Solving binary cutting stock problems by column generation and branch- and-bound
This page was built for publication: The pickup and delivery problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179004)
