The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) i...

Advanced meter infrastructures (AMIs) are now widespread and their importance within smart grid systems continues to increase with the advent of new applicat...

Unit commitment problem (UCP) for thermal units consists of finding an optimal electricity production plan for a long time horizon. In this paper we propose ...

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). F...

The p-hub median problem consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between th...

In this paper we study the periodic maintenance problem: given a set of m machines and a horizon of T periods, find indefinitely repeating itself mainten...

Large size optimization problems are usually successfully solved by using some metaheuristic approach. Nowadays, there is a trend to combine several metaheur...

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic deman...

Usually several neighborhood structures may be explored within a single local search algorithm. The simplest way is to define a single neighborhood as a unio...

In this paper, we propose two new diving heuristics for finding a feasible solution for a mixed integer programming problem, called _variable neighbourhood (...

We examine the requirements and the available methods and software to provide (or imitate) uniform random numbers in parallel computing environments. In this...

In this paper we investigate the options of a network operator faced with the requirement of reducing its carbon footprint, expressed in terms of a global en...

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

This paper proposes an incentive mechansim for transmission expansion planning. The mechansim is a bilevel program. The upper level is a profit-maximizing tr...

We introduce a new software tool and library named Lattice Builder, written in C++, that implements a variety of construction algorithms for good rank-1 latt...

Au fil des années de nombreuses critiques ont été formulées par les observateurs et divers comités d'étude concernant le manque de transparence du processus ...

Une très grande partie des problèmes de décision se caractérise à la fois par un environnement décisionnel complexe devant considérer de nombreux enjeux de n...

A computational framework has been developed that extends stochastic strategic mine planning algorithms, improving the representation of ore selection decisi...

Robust optimization (RO) is a powerful mean to handle optimization problems where there is a set of parameters that are uncertain. The effectiveness of the m...