2-Path Cuts for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:2783836
DOI10.1287/trsc.33.1.101zbMath1004.90015MaRDI QIDQ2783836
Oli B. G. Madsen, Niklas Kohl, Marius M. Solomon, Jacques Desrosiers, François Soumis
Publication date: 17 October 2002
Published in: Transportation Science (Search for Journal in Brave)
Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Decomposition methods (49M27)
Related Items
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem, A multi-start local search algorithm for the vehicle routing problem with time windows, A column generation approach for a multi-attribute vehicle routing problem, Consistency Cuts for Dantzig-Wolfe Reformulations, The discrete time window assignment vehicle routing problem, A comparison of column-generation approaches to the synchronized pickup and delivery problem, Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations, Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks, Arcs-states models for the vehicle routing problem with time windows and related problems, Lifted and local reachability cuts for the vehicle routing problem with time windows, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Pricing routines for vehicle routing with time windows on road networks, The pickup and delivery problem with time windows and handling operations, A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows, A column generation approach to the heterogeneous fleet vehicle routing problem, A general heuristic for vehicle routing problems, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, Feeder routing for air-to-air refueling operations, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, Modeling and solving profitable location and distribution problems, A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection, Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen, Algorithms for non-linear and stochastic resource constrained shortest path, A matheuristic for the MinMax capacitated open vehicle routing problem, An exact solution method for home health care scheduling with synchronized services, Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows, New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, New Refinements for the Solution of Vehicle Routing Problems with Branch and Price, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, A tutorial on column generation and branch-and-price for vehicle routing problems, Reachability cuts for the vehicle routing problem with time windows, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, The robust vehicle routing problem with time windows: solution by branch and price and cut, Combined location and routing problems for drug distribution, Limited memory rank-1 cuts for vehicle routing problems, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Formulations and exact algorithms for the vehicle routing problem with time windows, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Solving a school bus scheduling problem with integer programming, A dual ascent procedure for the set partitioning problem, Branch-and-price approaches for the multiperiod technician routing and scheduling problem, Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster, Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, An improved LNS algorithm for real-time vehicle routing problem with time windows, Vehicle routing under time-dependent travel times: the impact of congestion avoidance, A column generation algorithm for the vehicle routing problem with soft time windows, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Decomposition and dynamic cut generation in integer linear programming, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Lagrangian duality applied to the vehicle routing problem with time windows, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Branch and price for the vehicle routing problem with discrete Split deliveries and time windows, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, A personalized walking bus service requiring optimized route decisions: a real case, A vehicle routing problem with distribution uncertainty in deadlines, Bidirectional labeling for solving vehicle routing and truck driver scheduling problems, A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes, Research on the vehicle routing problem with interval demands, Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments, Vehicle routing problem with time windows and a limited number of vehicles., Approximative solutions to the bicriterion vehicle routing problem with time windows, The vehicle routing problem with time windows and temporal dependencies, Cutting planes for branch-and-price algorithms, Survey of research in the design and control of automated guided vehicle systems, Projection results for vehicle routing, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, On compact formulations for integer programs solved by column generation
Uses Software
