Sciweavers

1328 search results - page 1 / 266
» An Optimization Algorithm for the Ordered Open-End Bin-Packi...
Sort
View
IOR
2008
102views more  IOR 2008»
13 years 4 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini
AISS
2010
161views more  AISS 2010»
13 years 1 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 2 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
13 years 8 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
IJCAI
2003
13 years 5 months ago
An Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
Richard E. Korf