EU/ME - the metaheuristics community

  • Increase font size
  • Default font size
  • Decrease font size
Home Metaheuristics articles Recent Publications
Recent publications

New book "Memory Allocation Problems in Embedded Systems: Optimization Methods"

E-mail Print PDF
The OR-Group at the University of South-Brittany (Lorient, France) is happy to announce the publication of its last book based on Maria Soto's PhD work and a strong collaboration with Dr. Johann Laurent. This book presents some optimization methods applied to the memory allocation problem and their integration in SoftExplorer a computer software for helping architecture designers initially developed in the Lab-STICC. The book is published by ISTE-Wiley and is available here.
Last Updated on Thursday, 20 December 2012 13:28

Computers & Operations Research 39 (11) 2012

E-mail Print PDF

Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems

by Wajdi Trabelsi, Christophe Sauvey and Nathalie Sauer


Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. The last two cases can lead to blocking situations. In flowshop scheduling literature, many studies have been performed about classical flowshop problems and also about some problems with only one blocking situation between all machines.

This paper deals with makespan minimization in flowshop scheduling problems where mixed blocking constraints are considered. After a problem description and definitions of different blocking constraints, a mathematical model is presented and heuristics are developed to propose quick solutions to these kinds of problems. Then, metaheuristics are used to improve found solutions. A comparison between heuristics and metaheuristics is then performed.

Last Updated on Monday, 16 April 2012 14:04

Omega 40(5), 2012

E-mail Print PDF

Optimizing trains movement on a railway network

by Lixing Yang, Keping Li, Ziyou Gao, and Xiang Li


Focusing on solving critically important train operation problems on a railway network, this paper investigates a mathematical model for finding optimal trains movements under the consideration of operational interactions. With the predetermined routing and traversing order plan, we explicitly consider the optimization of energy consumption and travel time as the objective based on the coasting control methods. To reduce the calculation difficulties, simulation-based methodologies are proposed to compute the energy consumption and traversing time through using specific performance of the involved trains. A genetic algorithm integrated with simulation is designed to seek the approximate optimal coasting control strategies on the railway network. The numerical experiments investigate the effectiveness of the proposed model and algorithm.


Journal of Heuristics 18(1), 2012

E-mail Print PDF

A mathematical model and a metaheuristic approach for a memory allocation problem

by María Soto, André Rossi and Marc Sevaux


Memory allocation in embedded systems is one of the main challenges that electronic designers have to face. This part, rather difficult to handle is often left to the compiler with which automatic rules are applied. Nevertheless, an optimal allocation of data to memory banks may lead to great savings in terms of running time and energy consumption. This paper introduces an exact approach and a vns-based metaheuristic for addressing a memory allocation problem. Numerical experiments have been conducted on real instances from the electronic community and on dimacs instances expanded for our specific problem.


Transportation Research Part B: Methodological, 46(1), 2012

E-mail Print PDF

Efficient Transit Schedule Design of timing points: A comparison of Ant Colony and Genetic Algorithms

by Ehsan Mazloumi, Mahmoud Mesbah, Avi Ceder, Sara Moridpour and Graham Currie

AbstractThis work defines Transit Schedule Design (TSD) as an optimization problem to construct the transit schedule with the decision variables of the location of timing points and the amount of slack time associated with each timing point. Two heuristic procedures, Ant Colony and Genetic Algorithms, are developed for constructing optimal schedules for a fixed bus route. The paper presents a comparison of the fundamental features of the two algorithms. They are then calibrated based on data generated from micro-simulation of a bus route in Melbourne, Australia, to give rise to (near) optimal schedule designs. The algorithms are compared in terms of their accuracy and efficiency in providing the minimum cost solution. Although both procedures prove the ability to find the optimal solution, the Ant Colony procedure demonstrates a higher efficiency by evaluating less schedule designs to arrive at a ‘good’ solution. Potential benefits of the developed algorithms in bus route planning are also discussed.


Journal of Heuristics 17(6), 2011

E-mail Print PDF

A comparative study of crossover in differential evolution

by Chuan Lin, Anyong Qing and Quanyuan Feng

Abstract: In order to understand the role of crossover in differential evolution, theoretical analysis and comparative study of crossover in differential evolution are presented in this paper. Two new crossover methods, namely consecutive binomial crossover and non-consecutive exponential crossover, are designed. The probability distribution and expectation of crossover length for binomial and exponential crossover used in this paper are derived. Various differential evolution algorithms with different crossover methods including mutation-only differential evolution are comprehensively compared at system level instead of parameter level. Based on the theoretical analysis and simulation results, the effect of crossover on the reliability and efficiency of differential evolution algorithms is discussed. Some insights are revealed.

Last Updated on Tuesday, 22 November 2011 10:13

Computers & Operations Research 39 (7) 2012

E-mail Print PDF

Synchronized arc routing for snow plowing operations

by M. Angélica Salazar-Aguilar, André Langevin, and Gilbert Laporte

Abstract: This paper introduces a synchronized arc routing problem for snow plowing operations. In this problem, routes must be designed in such a way that street segments with two or more lanes in the same direction are plowed simultaneously by different synchronized vehicles. A mixed integer formulation and an adaptive large neighborhood search heuristic are proposed. The performance of the proposed algorithm is evaluated over a large instance set, including artificial and real data. Computational results confirm the efficiency of the algorithm.

Last Updated on Monday, 21 November 2011 07:26
  • «
  •  Start 
  •  Prev 
  •  1 
  •  2 
  •  3 
  •  4 
  •  Next 
  •  End 
  • »

Page 1 of 4


EU/ME 2017

Submit now your abstract.

Metaheuristics Events

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

Who's Online

We have 53 guests online