Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
From MaRDI portal
Publication:1788902
Recommendations
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- A genetic approach for two-dimensional loading capacitated vehicle routing problems
Cites work
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- scientific article; zbMATH DE number 1783883 (Why is no real title available?)
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A GRASP for the Vehicle Routing Problem with Time Windows
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A memetic algorithm for the vehicle routing problem with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exchange Heuristic for Routeing Problems with Time Windows
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Exact solution of the two-dimensional finite bin packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- New classes of fast lower bounds for bin packing problems
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Probabilistic diversification and intensification in local search for vehicle routing
- Reactive GRASP for the strip-packing problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Routing problems with loading constraints
- TSPLIB—A Traveling Salesman Problem Library
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(11)- Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
- 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
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- A hybrid approach for the 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
- Optimizing logistics routings in a network perspective of supply and demand nodes
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
This page was built for publication: Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1788902)
