In this paper we propose a hybrid ACO approach to solve a full truckload transportation problem. Hybridization is achieved through the use of a problem specific heuristic.(...)

In this paper we propose a multi-colony Ant System, where the colonies solve a multi-objective optimization problem concerned with goods transportation.

In this paper we propose an ACO algorithm to optimize the total costs associated with the pickup and delivery of full truckloads under time window constraints in a hub network.(...)

The ant system is a new meta-heuristic for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP), but has been also...

In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS). On the one hand, a coarse-grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best...