Sciweavers

74 search results - page 5 / 15
» Problem Generators for Rectangular packing problems
Sort
View
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
14 years 3 months ago
On-line, kinodynamic trajectory generation through rectangular channels using path and motion primitives
— We present a motion planning scheme for ground vehicles operating in a partially known environment. Kinematic constraints stemming from vehicle dynamics and from the requiremen...
Efstathios Bakolas, Panagiotis Tsiotras
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 3 months ago
A hybrid genetic algorithm for a variant of two-dimensional packing problem
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
Jin Kim, Byung Ro Moon
4OR
2008
79views more  4OR 2008»
13 years 8 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
SMA
2005
ACM
104views Solid Modeling» more  SMA 2005»
14 years 2 months ago
Packing a trunk: now with a twist!
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
Friedrich Eisenbrand, Stefan Funke, Andreas Karren...
EOR
2007
73views more  EOR 2007»
13 years 8 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...