Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
From MaRDI portal
Publication:5295484
DOI10.1002/net.20177zbMath1141.90340OpenAlexW3122956505MaRDI QIDQ5295484
Stefan Ropke, Jean-François Cordeau, Gilbert Laporte
Publication date: 30 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20177
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items
A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search, An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, A dynamic tree algorithm for peer-to-peer ridesharing matching, Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Event-based MILP models for ridepooling applications, Daily aircraft routing for amphibious ready groups, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, A comparison of column-generation approaches to the synchronized pickup and delivery problem, 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, Online spatio-temporal matching in stochastic and dynamic domains, Lifted and local reachability cuts for the vehicle routing problem with time windows, The dial-A-ride problem with transfers, Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations, Coordinating technician allocation and maintenance routing for offshore wind farms, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation, The pickup and delivery problem with time windows and handling operations, Solving a selective dial-a-ride problem with logic-based Benders decomposition, Hybrid column generation and large neighborhood search for the dial-a-ride problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, A branch-and-price-and-check model for the vehicle routing problem with location congestion, Feeder routing for air-to-air refueling operations, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A study on the pickup and delivery problem with time windows: matheuristics and new instances, Exact algorithms for the multi-pickup and delivery problem with time windows, 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, A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows, Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem, Complexity, algorithmic, and computational aspects of a dial-a-ride type problem, A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network, Planification des tournées dans le domaine de la messagerie rapide, Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands, A deterministic annealing local search for the electric autonomous dial-a-ride problem, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system, Typology and literature review for dial-a-ride problems, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, Routing by ranking: a link analysis method for the constrained dial-a-ride problem, Pickup and delivery problem with time windows: a new compact two-index formulation, Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain, The multi-pickup and delivery problem with time windows, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, The dial-a-ride problem: Models and algorithms, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays, A hybrid constraint programming approach to the log-truck scheduling problem, Dynamic transportation of patients in hospitals, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm, An exact solution framework for a broad class of vehicle routing problems, Exact solutions for the collaborative pickup and delivery problem, Dynamic programming based metaheuristics for the dial-a-ride problem, Scheduling issues in vehicle routing, Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design, Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem, On the one-to-one pickup-and-delivery problem with time windows and trailers, A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem, Strong cuts from compatibility relations for the dial-a-ride problem, An optimization model and a solution algorithm for the many-to-many car pooling problem, Recovery management for a dial-a-ride system with real-time disruptions, The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Cites Work
