Heuristic and exact algorithms for the multi-pile vehicle routing problem
From MaRDI portal
Publication:657060
DOI10.1007/s00291-009-0179-2zbMath1229.90039OpenAlexW2092451650WikidataQ59389639 ScholiaQ59389639MaRDI QIDQ657060
Manuel Iori, Karl F. Doerner, Fabien Tricoire, Richard F. Hartl
Publication date: 13 January 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-009-0179-2
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, Rich vehicle routing problems: from a taxonomy to a definition, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Routing problems with loading constraints, Finished-vehicle transporter routing problem solved by loading pattern discovery, A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks, Multi-objective vehicle routing and loading with time window constraints: a real-life application, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Integrated distribution and loading planning via a compact metaheuristic algorithm, Designing vehicle routes for a mix of different request types, under time windows and loading constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- Scheduling periodic customer visits for a traveling salesperson
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A branch and bound algorithm for the strip packing problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Variable neighborhood search
- Multistars, partial multistars and the capacitated vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- An improved typology of cutting and packing problems
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Variable neighborhood search: Principles and applications
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
