This paper is a comprehensive literature review of Biased Random-Key Genetic Algorithms
(BRKGA). BRKGA is a metaheuristic that employs random-key-based chromosomes with …

In this paper, we consider a vehicle routing problem in which a fleet of homogeneous
vehicles, initially located at a depot, has to satisfy customers' demands in a two‐echelon …

Modern production systems require multiple manufacturing centers—usually distributed
among different locations—where the outcomes of each center need to be assembled to …

This paper analyzes the fleet mixed vehicle‐routing problem with backhauls, a rich and
realistic variant of the popular vehicle‐routing problem in which both delivery and pick‐up …

This paper addresses the Set Orienteering Problem which is a generalization of the
Orienteering Problem where the customers are grouped in clusters, and the profit associated …

Given a graph G=(V, E) and a threshold γ∈(0, 1], the maximum cardinality quasi-clique
problem consists in finding a maximum cardinality subset C* of the vertices in V such that the …

Abstract Let G=(V, E) be a graph with vertex set V and edge set E, and consider γ∈[0, 1) to
be a real constant. A γ-clique (or quasi-clique) is a subset V′⊆ V inducing a subgraph of G …

A divisible load is an amount W of computational work that can be arbitrarily divided into
independent chunks of load. In many divisible load applications, the load can be …

This paper addresses a problem that service companies often face: the field technician
scheduling problem. The problem considers the assignment of a set of jobs or service tasks …

A graph is chordal if all its cycles of length greater than or equal to four contain a chord, ie,
an edge connecting two nonconsecutive vertices of the cycle. Given a graph G=(V, E), the …