In 1997 two papers new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...

This paper describes a Tabu Search (TS) heuristic for a Ship Routing and Scheduling Problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous ships. Constraints include delivery time windows imposed by customers, the time horizon by...

This paper proposes a novel model formulation for the Maximum Covering Species Problem that incorporates spatial connectivity requirements. This model, called the Connected Maximum Covering Species Problem, enforces structural connectivity and relies on knowledge of induced paths, or what we...