Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …

CONTENTS 11.1 Introduction.................................................... 694 11.2 Concepts of
Metaheuristic Techniques.................................. 69711.2. 1 Optimization …

This book arose from a realization that modeling using mathematical programming should
be tightly linked with algorithms and their software implementation to solve optimization …

In this paper, a machine learning framework based on Kaizen Programming is proposed for
building a soft-sensor using real historical data from an oil refinery. The soft-sensor …

Capabilities of enhanced simulated-annealing-based algorithms in solving process
planning problems in reconfigurable manufacturing are investigated. The algorithms are …

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization
problem. We develop a parallel algorithm for the VRP that combines a heuristic local search …

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 …

In this paper, three simulated annealing based algorithms that exploit auxiliary knowledge in
different ways are devised and employed to handle a manufacturing process planning …

In this paper we study different parallel implementations of the Savings based Ant System
algorithm developed for solving the Vehicle Routing Problem. We analyze the effects of low …

To date, reconfigurable manufacturing systems (RMSs) are among the most effective
manufacturing styles that can offer manufacturers an alternative way of facing up to the …