A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
type: Item
instance of: scholarly article
title: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
zbMATH Open document ID: 1374.90329
author: Lijun Wei
author: Zhenzhen Zhang
author: Defu Zhang
author: Stephen C. H. Leung
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6811640
zbMATH Keywords: routing
zbMATH Keywords: packing
zbMATH Keywords: simulated annealing
zbMATH Keywords: 2L-CVRP
zbMATH Keywords: rotation
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.08.035
OpenAlex ID: W2745690522
cites work: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
cites work: The truck dispatching problem
cites work: Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
cites work: A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
cites work: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
cites work: Ant colony optimization for the two-dimensional loading vehicle routing problem
cites work: Metaheuristics for vehicle routing problems with three-dimensional loading constraints
cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
cites work: Routing problems with loading constraints
cites work: Optimization by Simulated Annealing
cites work: Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Comments on: Routing problems with loading constraints
cites work: Vehicle routing problems with loading constraints: state-of-the-art and future directions
cites work: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
cites work: An effective tabu search approach with improved loading algorithms for the 3L-CVRP
cites work: Vehicle Routing
cites work: Improvement heuristics for the vehicle routing problem based on simulated annealing
cites work: Comparing descent heuristics and metaheuristics for the vehicle routing problem
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
cites work: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
cites work: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
cites work: Integrated distribution and loading planning via a compact metaheuristic algorithm
cites work: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
DOI: 10.1016/J.EJOR.2017.08.035
description: scientific article; zbMATH DE number 6811640