Metaheuristics for the vehicle routing problem with loading constraints
From MaRDI portal
Publication:5295486
Recommendations
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Routing problems with loading constraints
Cites work
Cited in
(32)- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Routing problems with loading constraints
- 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
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Container loading with multi-drop constraints
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- scientific article; zbMATH DE number 2094563 (Why is no real title available?)
- Rich vehicle routing problems: from a taxonomy to a definition
- Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- Metaheuristics for truck loading in the car production industry
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The pallet-loading vehicle routing problem with stability constraints
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
- The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem
- A branch-and-bound algorithm for the double travelling salesman problem with two stacks
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
This page was built for publication: Metaheuristics for the vehicle routing problem with loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295486)
