A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
type: Item
instance of: scholarly article
title: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
zbMATH Open document ID: 1251.90013
author: Andreas Bortfeldt
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6106584
zbMATH Keywords: capacitated vehicle routing
zbMATH Keywords: loading
zbMATH Keywords: three-dimensional packing
zbMATH Keywords: tabu search
zbMATH Keywords: tree search
describes a project that uses: Algorithm 864
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2011.11.008
OpenAlex ID: W2088314713
cites work: Recent advances in vehicle routing exact algorithms
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: A unified exact method for solving different classes of vehicle routing problems
cites work: Exact algorithms for routing problems under vehicle capacity constraints
cites work: A heuristic for the three-dimensional strip packing problem
cites work: Q5692628
cites work: Q5431823
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: Applying the attribute based hill climber heuristic to the vehicle routing problem
cites work: A tree search algorithm for solving the container loading problem
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
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: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
cites work: Routing problems with loading constraints
cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
cites work: What you should know about the vehicle routing problem
cites work: A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
cites work: Honey bees mating optimization algorithm for large scale vehicle routing problems
cites work: The Three-Dimensional Bin Packing Problem
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
cites work: An integrated approach to the vehicle routing and container loading problems
cites work: A maximal-space algorithm for the container loading problem
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: A general heuristic for vehicle routing problems
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: The vehicle routing problem
cites work: An improved typology of cutting and packing problems
cites work: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
DOI: 10.1016/J.COR.2011.11.008
description: scientific article; zbMATH DE number 6106584