A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
From MaRDI portal
(Redirected from Publication:336326)
Recommendations
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
Cites work
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A hybrid genetic algorithm for the container loading problem
- A tabu search algorithm for weakly heterogeneous container loading problems
- A unified exact method for solving different classes of vehicle routing problems
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An exact method for the double TSP with multiple stacks
- An integrated approach to the vehicle routing and container loading problems
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- Exact algorithms for routing problems under vehicle capacity constraints
- Exact solutions to the double travelling salesman problem with multiple stacks
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Greedy randomized adaptive search procedures
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Heuristics for the container loading problem
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Optimal routing of multiple-load AGV subject to LIFO loading constraints
- Recent advances in vehicle routing exact algorithms
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Routing problems with loading constraints
- Solving container loading problems by block arrangement
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The pickup and delivery traveling salesman problem with first-in-first-out loading
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
Cited in
(24)- 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
- 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
- Model and algorithm for multi-objective joint optimization of three-dimensional loading and CVRP
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- 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 multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints
- 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
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- An integrated approach to the vehicle routing and container loading problems
- The mobile production vehicle routing problem: using 3D printing in last mile distribution
- 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
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- 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
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
This page was built for publication: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336326)