Heuristic and exact algorithms for the multi-pile vehicle routing problem
From MaRDI portal
Publication:657060
DOI10.1007/S00291-009-0179-2zbMATH Open1229.90039DBLPjournals/ors/TricoireDHI11OpenAlexW2092451650WikidataQ59389639 ScholiaQ59389639MaRDI QIDQ657060FDOQ657060
Authors: F. Tricoire, K. F. Doerner, Manuel Iori, 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
Recommendations
- scientific article; zbMATH DE number 5247432
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A practical heuristic for a large scale vehicle routing problem
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- Heuristics for large constrained vehicle routing problems
- A heuristic algorithm for the multi-depot periodic vehicle routing problem
- New heuristics for the vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- An improved typology of cutting and packing problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Multistars, partial multistars and the capacitated vehicle routing problem
- Title not available (Why is that?)
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Title not available (Why is that?)
- A branch and bound algorithm for the strip packing problem
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- Optimal Scheduling of Tasks on Identical Parallel Processors
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- Scheduling periodic customer visits for a traveling salesperson
Cited In (22)
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Routing problems with loading constraints
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation
- Rich vehicle routing problems: from a taxonomy to a definition
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- Exact and heuristic algorithms for routing AGV on path with precedence constraints
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A branch-and-bound algorithm for the double travelling salesman problem with two stacks
Uses Software
This page was built for publication: Heuristic and exact algorithms for the multi-pile vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657060)
