A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
From MaRDI portal
Publication:2571182
DOI10.1016/j.cor.2004.08.001zbMath1079.90591OpenAlexW2100664047MaRDI QIDQ2571182
Russell Bent, Pascal Van Hentenryck
Publication date: 1 November 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.08.001
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, A multi-start local search algorithm for the vehicle routing problem with time windows, Daily aircraft routing for amphibious ready groups, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations, Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows, An adaptive large neighborhood search for an E-grocery delivery routing problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, A study on the pickup and delivery problem with time windows: matheuristics and new instances, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands, 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, Integrated planning of loaded and empty container movements, Solving a pickup and delivery routing problem for fourth‐party logistics providers, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Moving products between location pairs: cross-docking versus direct-shipping, The pickup and delivery traveling salesman problem with handling costs, A hybrid method based on linear programming and tabu search for routing of logging trucks, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Vehicle routing problem with elementary shortest path based column generation, Dynamic transportation of patients in hospitals, A large neighbourhood search heuristic for ship routing and scheduling with split loads, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, The EMS vehicle patient transportation problem during a demand surge, Dynamic programming based metaheuristics for the dial-a-ride problem, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, On the one-to-one pickup-and-delivery problem with time windows and trailers, A local search heuristic for the pre- and end-haulage of intermodal container terminals, Shipper collaboration in forward and reverse logistics, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- The pickup and delivery problem with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Tabu Search—Part I
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- The General Pickup and Delivery Problem
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
- Principles and Practice of Constraint Programming – CP 2003
