Sciweavers

12194 search results - page 351 / 2439
» cans 2010
Sort
View
EOR
2007
89views more  EOR 2007»
15 years 6 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...
152
Voted
EOR
2007
73views more  EOR 2007»
15 years 6 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...
187
Voted
EOR
2007
110views more  EOR 2007»
15 years 6 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...
EOR
2007
97views more  EOR 2007»
15 years 6 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...
EOR
2007
92views more  EOR 2007»
15 years 6 months ago
Planning and approximation models for delivery route based services with price-sensitive demands
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
Joseph Geunes, Zuo-Jun Max Shen, Akin Emir