Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

This work addresses the Vehicle Routing Problem with Cross-Docking (VRPCD). The
problem consists in defining a minimum cost set of routes for a fleet of vehicles that meets …

This paper focuses on the research and development of a new paint shop concept for the
automotive industry, based on Industry 4.0 and Digital Factory ideas. The Paint Shop 4.0 …

This paper presents a General Variable Neighborhood Search (GVNS) heuristic for the
Traveling Salesman Problem with Time Windows (TSPTW). The heuristic is composed by …

Clustering addresses the problem of finding homogeneous and well-separated subsets,
called clusters, from a set of given data points. In addition to the points themselves, in many …

Unmanned aerial vehicles (UAVs) have been used extensively for search and rescue
operations, surveillance, disaster monitoring, attacking terrorists, etc. due to their growing …

In this paper, we discuss the scheduling of jobs with incompatible families on parallel
batching machines. The performance measure is total weighted tardiness. This research is …

The car sequencing problem is a well established problem that models the conflicts arising
from scheduling cars into an assembly line. However, the existing approaches to this …

The car sequencing problem consists of sequencing a given set of cars to be produced in
each day. This paper presents an application of the extended coincident algorithm (COIN-E) …