Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
From MaRDI portal
Publication:5295484
Recommendations
- An exact algorithm for the pickup and delivery problem with time windows
- Exact algorithms for the multi-pickup and delivery problem with time windows
- The pickup and delivery problem with time windows
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Cites work
Cited in
(84)- Pickup and delivery problem with time windows: a new compact two-index formulation
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- On the one-to-one pickup-and-delivery problem with time windows and trailers
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- The dial-a-ride problem with private fleet and common carrier
- Coordinating technician allocation and maintenance routing for offshore wind farms
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
- Daily aircraft routing for amphibious ready groups
- Pickup and delivery problem with incompatibility constraints
- A hybrid constraint programming approach to the log-truck scheduling problem
- Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands
- Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- A dynamic tree algorithm for peer-to-peer ridesharing matching
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- The pickup and delivery problem with time windows and scheduled lines
- A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Event-based MILP models for ridepooling applications
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
- scientific article; zbMATH DE number 5951628 (Why is no real title available?)
- scientific article; zbMATH DE number 680242 (Why is no real title available?)
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- Planification des tournées dans le domaine de la messagerie rapide
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Recovery management for a dial-a-ride system with real-time disruptions
- The pickup and delivery problem with time windows and handling operations
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Assignment formulation for the elevator dispatching problem with destination control and its performance analysis
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- The dial-A-ride problem with transfers
- The multi-pickup and delivery problem with time windows
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
- Exact solutions for the collaborative pickup and delivery problem
- An optimization model and a solution algorithm for the many-to-many car pooling problem
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- An exact solution framework for a broad class of vehicle routing problems
- Feeder routing for air-to-air refueling operations
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- A decomposition approach for commodity pickup and delivery with time-windows under uncertainty
- A deterministic annealing local search for the electric autonomous dial-a-ride problem
- Strong cuts from compatibility relations for the dial-a-ride problem
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- Recent models and algorithms for one-to-one pickup and delivery problems
- An exact algorithm for the pickup and delivery problem with time windows
- Dynamic transportation of patients in hospitals
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- The dial-a-ride problem: Models and algorithms
- Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Online spatio-temporal matching in stochastic and dynamic domains
- Typology and literature review for dial-a-ride problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation
- Branch and price algorithm for route optimization on customized bus service
- Scheduling issues in vehicle routing
This page was built for publication: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295484)
