Metaheuristics for vehicle routing problems with three-dimensional loading constraints
From MaRDI portal
Publication:1038331
Recommendations
- Metaheuristics for the vehicle routing problem with loading constraints
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- Solving vehicle routing problems using constraint programming and metaheuristics
Cites work
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- scientific article; zbMATH DE number 2209651 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A hybrid genetic algorithm for the container loading problem
- A new rank based version of the ant system. -- A computational study
- An Algorithm for Two-Dimensional Cutting Problems
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Extreme point-based heuristics for three-dimensional bin packing
- Guided local search for the three-dimensional bin-packing problem
- Handbooks in operations Research \& management science: Transportation
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Heuristics for the container loading problem
- Metaheuristics for the vehicle routing problem with loading constraints
- New heuristics for the vehicle routing problem
- Orthogonal Packings in Two Dimensions
- Solving container loading problems by block arrangement
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- The Three-Dimensional Bin Packing Problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The vehicle routing problem
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- Weight distribution considerations in container loading
Cited in
(56)- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- A heuristic algorithm for solving triangle packing problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Routing problems with loading constraints
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Metaheuristics for the vehicle routing problem with loading constraints
- An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
- Model and algorithm for multi-objective joint optimization of three-dimensional loading and CVRP
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- Effective loading in combined vehicle routing and container loading problems
- MIP-based approaches for the container loading problem with multi-drop constraints
- Metaheuristics for truck loading in the car production industry
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Constraints in container loading -- a state-of-the-art review
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- A large neighbourhood search algorithm for solving container loading problems
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
- Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- A branch-and-bound algorithm for the double travelling salesman problem with two stacks
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Modeling soft unloading constraints in the multi-drop container loading problem
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Metaheuristics ``In the large
- Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Modeling of 3D cargo loading problem and optimization of crow search algorithm
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Rich vehicle routing problems: from a taxonomy to a definition
- Solution validator and visualizer for (combined) vehicle routing and container loading problems
- Airfreight forwarder's shipment planning: shipment consolidation and containerization
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- Review: An annotated bibliography of combined routing and loading problems
- A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints
This page was built for publication: Metaheuristics for vehicle routing problems with three-dimensional loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038331)
