This paper examines the Local Container Drayage Problem (LCDP) under an operation mode in which a tractor can be detached from its companion trailer and assigned to a new task. We have incorporated a set of temporal constraints into the classical VRP to realize this operation by utilizing the...

The vehicle routing problem with stochastic demand (VRPSD) is a well known NP-hard problem. The uncharacteristic behaviour associated with the problem enhances the computational efforts required to obtain a feasible and near-optimal solution. This paper proposes an algorithm portfolio...

To date, most methods for direct blockmodeling of social network data have focused on the optimization of a single objective function. However, there are a variety of social network applications where it is advantageous to consider two or more objectives simultaneously. These applications can...

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 approach for a multiprocessor scheduling problem, where a list of jobs has to be scheduled on identical parallel processors. Each job in the list has a release date, a due date, a processing time and a set of predecessors. The objective is to minimize the...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the...