Abstract
This paper presents a Variable Neighborhood Search (VNS) algorithm for the container loading problem. The algorithm combines a constructive procedure based on the concept of maximal-space, with five new movements defined directly on the physical layout of the packed boxes, which involve insertion and deletion strategies. The new algorithm is tested on the complete set of Bischoff and Ratcliff problems, ranging from weakly to strongly heterogeneous instances, and outperforms all the reported algorithms which have used those test instances.

Abstract
We address the short-term production planning and scheduling problem coming from the glass container industry. A furnace melts the glass that is distributed to a set of parallel molding machines. Both furnace and machine idleness are not allowed. The resulting multi-machine multi-item continuous setup lotsizing problem with a common resource has sequence-dependent setup times and costs. Production losses are penalized in the objective function since we deal with a capital intensive industry. We present two mixed integer programming formulations for this problem, which are reduced to a network flow type problem. The two formulations are improved by adding valid inequalities that lead to good lower bounds. We rely on a Lagrangian decomposition based heuristic for generating good feasible solutions. We report computational experiments for randomly generated instances and for real-life data on the aforementioned problem, as well as on a discrete lotsizing and scheduling version.

Abstract

Abstract
A virtual enterprise (VE) is a temporary organisation that pools member enterprises core competencies and exploits fast changing market opportunities. VEs offer new opportunities to companies operating with a growing number of participants (consumers, vendors, partners and others) in a global business environment. The success of such an organisation is strongly dependent on its composition, and the selection of partners therefore becomes a crucial issue. Partner selection can be viewed as a multi-criteria decision making problem that involves assessing trade-offs between conflicting tangible and intangible criteria, and stating preferences based on incomplete or non-available information. In general, this is a very complex problem due to the large number of alternatives and criteria of different types (quantitative, qualitative and stochastic). In this paper we propose an integrated approach to rank alternative VE configurations using an extension of TOPSIS (a technique for ordering preferences by similarity to an ideal solution) for fuzzy data, improved through the use of a tabu search meta-heuristic. A sensitivity analysis is also presented. Preliminary computational results clearly demonstrate the potential of the approach for practical application.

Abstract
We propose a multiobjective local search metaheuristic for a mean-risk multistage capacity investment problem with irreversibility, lumpiness and economies of scale in capacity costs. Conditional value-at-risk is considered as a risk measure. Results of a computational study are presented and indicate that the approach is capable of producing high-quality approximations to the efficient sets with a modest computational effort. The best results are achieved with a new hybrid approach, combining Tabu Search and Variable Neighbourhood Search.

Abstract
In this paper we address two major challenges presented by stochastic discrete optimisation problems: the multiobjective nature of the problems, once risk aversion is incorporated, and the frequent difficulties in computing exactly, or even approximately, the objective function. The latter has often been handled with methods involving sample average approximation, where a random sample is generated so that population parameters may be estimated from sample statistics-usually the expected value is estimated from the sample average. We propose the use of multiobjective metaheuristics to deal with these difficulties, and apply a multiobjective local search metaheuristic to both exact and sample approximation versions of a mean-risk static stochastic knapsack problem. Variance and conditional value-at-risk are considered as risk measures. Results of a computational study are presented, that indicate the approach is capable of producing high-quality approximations to the efficient sets, with a modest computational effort.