A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
From MaRDI portal
Publication:1681135
DOI10.1016/j.ejor.2017.08.035zbMath1374.90329OpenAlexW2745690522MaRDI QIDQ1681135
Defu Zhang, Lijun Wei, Zhenzhen Zhang, Stephen C. H. Leung
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.035
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
Asynchronous optimization of part logistics routing problem ⋮ A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints ⋮ A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ The pallet-loading vehicle routing problem with stability 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 ⋮ Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing ⋮ Multipopulation cooperative particle swarm optimization with a mixed mutation strategy ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Application of the simulated annealing algorithm to the correlated WMP radiation model for flames
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- The Truck Dispatching Problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Vehicle Routing
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- Comments on: Routing problems with loading constraints
This page was built for publication: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints