#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2008

2014

- This year (0)
- Last 5 years (8)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hakim Akeb, Mhand Hifi
- ITOR
- 2008

- Hakim Akeb, Mhand Hifi, Stéphane Nègre
- Computers & Industrial Engineering
- 2011

- Hakim Akeb, Mhand Hifi
- J. Comb. Optim.
- 2010

- Hakim Akeb, Mhand Hifi, Rym M'Hallah
- Computers & OR
- 2009

- Hakim Akeb, Mhand Hifi, Rym M'Hallah
- ITOR
- 2010

- Hakim Akeb, Mhand Hifi
- Computers & OR
- 2013

- Hakim Akeb, Mhand Hifi, Mohamed Elhafedh Ould Ahmed Mounir
- Computers & Industrial Engineering
- 2011

In this paper, we propose a Minimum Damage (MinD) rule based heuristic for packing as many equal circles as possible into a circular container. The MinD heuristic places the next circle in a way to block the fewest future positions for other circles. The MinD heuristic packs more circles than either the position-coordinates based Bottom-Left (BL) heuristic… (More)

- Hakim Akeb, Mhand Hifi, Dominique Lazure
- 2012 Federated Conference on Computer Science and…
- 2012

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)

- Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi
- 2013 Federated Conference on Computer Science and…
- 2013

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)