Search Sciweavers | Sciweavers

120 search results - page 11 / 24

» On Bin Packing with Conflicts

AISS
2010

161views more AISS 2010»

Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional

13 years 5 months ago

Download www.aicit.org

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

claim paper

Read More »

click to vote

WAOA
2010
Springer

256views Algorithms» more WAOA 2010»

The Train Delivery Problem - Vehicle Routing Meets Bin Packing

13 years 5 months ago

Download www.cs.brown.edu

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

claim paper

Read More »

click to vote

ICPP
1999
IEEE

199views Distributed And Parallel Com...» more ICPP 1999»

Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints

13 years 11 months ago

Download glaros.dtc.umn.edu

In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...

William Leinberger, George Karypis, Vipin Kumar

claim paper

Read More »

click to vote

CEC
2007
IEEE

124views Artificial Intelligence» more CEC 2007»

The scalability of evolved on line bin packing heuristics

14 years 1 months ago