Metaheuristics for truck loading in the car production industry
From MaRDI portal
Publication:2968504
DOI10.1111/itor.12306zbMath1358.90121OpenAlexW2394816447MaRDI QIDQ2968504
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12306
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Minimizing late deliveries in a truck loading problem ⋮ Metaheuristics for truck loading in the car production industry ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
Cites Work
- Heuristics for the strip packing problem with unloading constraints
- An investigation into two bin packing problems with ordering and orientation implications
- The three-dimensional knapsack problem with balancing constraints
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A solution method for a car fleet management problem with maintenance constraints
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Optimization by ant algorithms: possible roles for an individual ant
- MIP-based approaches for the container loading problem with multi-drop constraints
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Heuristics for the container loading problem
- Two-dimensional packing problems: a survey
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An adaptive memory algorithm for the \(k\)-coloring problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- The two-dimensional bin packing problem with variable bin sizes and costs
- Ant colony optimization theory: a survey
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- Models and algorithms for three-stage two-dimensional bin packing
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- Metaheuristics for truck loading in the car production industry
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
This page was built for publication: Metaheuristics for truck loading in the car production industry
