Metaheuristics for vehicle routing problems with three-dimensional loading constraints
type: Item
instance of: scholarly article
title: Metaheuristics for vehicle routing problems with three-dimensional loading constraints
zbMATH Open document ID: 1173.90511
author: Guenther Fuellerer
author: K. F. Doerner
author: Richard F. Hartl
author: Manuel Iori
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5634706
zbMATH Keywords: vehicle routing
zbMATH Keywords: ant colony optimization
zbMATH Keywords: three-dimensional packing
Wikidata QID: Q59389674
describes a project that uses: Algorithm 864
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.03.046
OpenAlex ID: W1990902176
cites work: Orthogonal Packings in Two Dimensions
cites work: A hybrid genetic algorithm for the container loading problem
cites work: A new rank based version of the ant system. -- A computational study
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Q5431823
cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
cites work: Q5692628
cites work: Q3523238
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Weight distribution considerations in container loading
cites work: Metaheuristics for the vehicle routing problem with loading constraints
cites work: Solving container loading problems by block arrangement
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: Ant colony optimization for the two-dimensional loading vehicle routing problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
cites work: Q4365135
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: The Three-Dimensional Bin Packing Problem
cites work: Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
cites work: Heuristics for the container loading problem
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: The vehicle routing problem
cites work: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
DOI: 10.1016/J.EJOR.2009.03.046
Recommended article: Metaheuristics for the vehicle routing problem with loading constraints
Recommended article: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Recommended article: An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
Recommended article: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
Recommended article: A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
Recommended article: Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
Recommended article: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
Recommended article: Solving vehicle routing problems using constraint programming and metaheuristics
description: scientific article; zbMATH DE number 5634706