In the logistics network design problem (LNDP), decisions must be made regarding the selection of suppliers, the location of plants and warehouses, the assignment of activities to these facilities, and the flows of raw materials and finished products in the network. This article introduces an...

This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by...

This paper introduces an iterated tabu search heuristic for the daily car sequencing problem in which a set of cars must be sequenced so as to satisfy requirements from the paint shop and the assembly line. The iterated tabu search heuristic combines a classical tabu search with perturbation...