Learn More
This paper solves the strip packing problem (SPP) that consists in packing a set of circular objects into a rectangle of fixed width and unlimited length. The objective is to minimize the length of the rectangle that will contain all the objects such that no object overlaps another one. The proposed algorithm uses a look-ahead method combined with beam(More)
In this paper the capacitated vehicle routing problem with time windows is tackled with a beam-search based approximate algorithm. An instance of this problem is defined by a set of customers and a fleet of identical vehicles. A time window is associated with each customer and a maximum capacity characterizes a vehicle. The aim is then to serve all the(More)