Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
From MaRDI portal
Publication:1788902
DOI10.1007/s10100-011-0204-9zbMath1397.90385OpenAlexW2073472559MaRDI QIDQ1788902
Mohamed Reghioui, Alice Yalaoui, Selma Khebbache-Hadji, Christian Prins
Publication date: 9 October 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-011-0204-9
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A hybrid genetic algorithm 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, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, 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, Multi-objective vehicle routing and loading with time window constraints: a real-life application, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, 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, Optimizing logistics routings in a network perspective of supply and demand nodes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Routing problems with loading constraints
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- Reactive GRASP for the strip-packing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- 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
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A memetic algorithm for the vehicle routing problem with time windows
- TSPLIB—A Traveling Salesman Problem Library
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A GRASP for the Vehicle Routing Problem with Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- New classes of fast lower bounds for bin packing problems
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
