EU/ME - the metaheuristics community

  • Increase font size
  • Default font size
  • Decrease font size
EU/ME - the metaheuristics community

EURO 2012 - Conference film

E-mail Print PDF

Dear friend,

The Organizers of the 25th EURO Conference have a great honor and pleasure of inviting you to take part in this Conference to be held on 8- 11 July 2012, in Vilnius, Lithuania. EU/ME, the metaheuristics community  would love to see you all at the EURO 2012 conference. Please have a look at the recent promotional film.


Computers & OR 39(6), 2012

E-mail Print PDF

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

by F. Della Croce, T. Garaix and A. Grosso


We present computational results with a heuristic algorithm for the parallel machines total weighted tardiness problem. The algorithm combines generalized pairwise interchange neighborhoods, dynasearch optimization and a new machine-based neighborhood whose size is non-polynomial in the number of machines. The computational results significantly improve over the current state of the art for this problem.

Last Updated on Monday, 10 October 2011 08:10

EJOR 215(2), 2011

E-mail Print PDF

A skyline heuristic for the 2D rectangular packing and strip packing problems

by  Lijun Wei, Wee-Chong Oon and Wenbin Zhu and Andrew Lim

Abstract: In this paper, we propose a greedy heuristic for the 2D rectangular packing problem (2DRP) that represents packings using a skyline; the use of this heuristic in a simple tabu search approach outperforms the best existing approach for the 2DRP on benchmark test cases. We then make use of this 2DRP approach as a subroutine in an “iterative doubling” binary search on the height of the packing to solve the 2D rectangular strip packing problem (2DSP). This approach outperforms all existing approaches on standard benchmark test cases for the 2DSP.

Last Updated on Friday, 07 October 2011 06:09

EJOR 216(1), 2012

E-mail Print PDF

Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking

by  Viet-Phuong Nguyen, Christian Prins and Caroline Prodhon

Abstract: The two-echelon location-routing problem (LRP-2E) arises from recent transportation applications like city logistics. In this problem, still seldom studied, first-level trips serve from a main depot a set of satellite depots, which must be located, while second-level trips visit customers from these satellites. After a literature review on the LRP-2E, we present four constructive heuristics and a hybrid metaheuristic: A greedy randomized adaptive search procedure (GRASP) complemented by a learning process (LP) and path relinking (PR). The GRASP and learning process involve three greedy randomized heuristics to generate trial solutions and two variable neighbourhood descent (VND) procedures to improve them. The optional path relinking adds a memory mechanism by combining intensification strategy and post-optimization. Numerical tests show that the GRASP with LP and PR outperforms the simple heuristics and an adaptation of a matheuristic initially published for a particular case, the capacitated location-routing problem (CLRP). Additional tests on the CLRP indicate that the best GRASP competes with the best metaheuristics published.

Last Updated on Friday, 07 October 2011 06:08

EJOR 216(2), 2012

E-mail Print PDF

Metaheuristics for the linear ordering problem with cumulative costs

by Abraham Duarte, Rafael Martí, Ada Álvarez and Francisco Ángel-Bell


The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRASP methodology, while the second one implements an Iterated Greedy-Strategic Oscillation procedure. We also propose a post-processing based on Path Relinking to obtain improved outcomes. We compare our methods with the state-of-the-art procedures on a set of 218 previously reported instances. The comparison favors the Iterated Greedy – Strategic Oscillation with the Path Relinking post-processing, which is able to identify 87 new best objective function values.

Last Updated on Friday, 07 October 2011 06:09

Page 10 of 14


EU/ME 2017

Submit now your abstract.


Should we trust "Open access journals"?

Metaheuristics Events

<<  April 2017  >>
 Mo  Tu  We  Th  Fr  Sa  Su 
       1  2
  3  4  5  6  7  8  9

Who's Online

We have 47 guests online