A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem

Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those methods. The focus is put on the bounding mechanism of B&B algorithms, which is the most time consuming part of their exploration process. We propose a parallel B&B algorithm based on a GPU-accelerated bounding model. The proposed approach concentrate on optimizing data access management to further improve the performance of the bounding mechanism which uses large and intermediate data sets that do not completely fit in GPU memory. Extensive experiments of the contribution have been carried out on well known FSP benchmarks using an Nvidia Tesla C2050 GPU card. We compared the obtained performances to a single and a multithreaded CPU-based execution. Accelerations up to x100 are achieved for large problem instances

Many-core Branch-and-Bound for GPU accelerators and MIC coprocessors

International audienceCoprocessors are increasingly becoming key building blocks of High Performance Computing platforms. These many-core energy-efficient devices boost the performance of traditional processors. On the other hand, Branch-and-Bound (B&B) algorithms are tree-based exact methods for solving to optimality combinatorial optimization problems (COPs). Solving large COPs results in the generation of a very large pool of subproblems and the evaluation of their associated lower bounds. Generating and evaluating those subproblems on coprocessors raises several issues including processor-coprocessor data transfer optimization, vectorization, thread divergence, and so on. In this paper, we investigate the offload-based parallel design and implementation of B&B algorithms for coprocessors addressing these issues. Two major many-core architectures are considered and compared: Nvidia GPU and Intel MIC. The proposed approaches have been experimented using the Flow-Shop scheduling problem and two hardware configurations equivalent in terms of energy consumption: Nvidia Tesla K40 and Intel Xeon Phi 5110P. The reported results show that the GPU-accelerated approach outperforms the MIC offload-based one even in its vectorized version. Moreover, vectorization improves the efficiency of the MIC offload-based approach with a factor of two

Recent Advances on GPU Computing in Operations Research

In the last decade, Graphics Processing Units (GPUs) have gained an increasing popularity as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not only powerful graphics engines but also highly threaded parallel computing processors that can achieve sustainable speedup as compared with CPUs. In this context, researchers try to exploit the capability of this architecture to solve difficult problems in many domains in science and engineering. In this article, we present recent advances on GPU Computing in Operations Research. We focus in particular on Integer Programming and Linear Programming

Recent Advances on GPU Computing in Operations Research

Abstract-In the last decade, Graphics Processing Units (GPUs) have gained an increasing popularity as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not only powerful graphics engines but also highly threaded parallel computing processors that can achieve sustainable speedup as compared with CPUs. In this context, researchers try to exploit the capability of this architecture to solve difficult problems in many domains in science and engineering. In this article, we present recent advances on GPU Computing in Operations Research. We focus in particular on Integer Programming and Linear Programming

Algorithms for bundling and pricing trucking services: Deterministic and stochastic approaches

Bundling and pricing trucking services is an important strategic decision for carriers. This is helpful when they consider the incorporation of new businesses to their networks, look for economic and optimal operations, and develop revenue management strategies. Reverse combinatorial auctions for trucking services are real-world examples that illustrate the necessity of such strategies. In these auctions, a shipper asks carriers for quotes to serve combinations of lanes and the carriers have to bundle demand and price it properly. This dissertation explores several dimensions of the problem employing state-of-the-art analytical tools. These dimensions include: Truckload (TL) and less-than-truckload (LTL) operations, behavioral attributes driving the selection of trucking services, and consideration of deterministic and stochastic demand. Analytical tools include: advanced econometrics, network modeling, statistical network analysis, combinatorial optimization, and stochastic optimization. The dissertation is organized as follows. Chapter 1 introduces the problem and related concepts. Chapter 2 studies the attributes driving the selection of trucking services and proposes an econometric model to quantify the shipper willingness to pay using data from a discrete choice experiment. Chapter 3 proposes an algorithm for demand clustering in freight logistics networks using historical data from TL carriers. Chapter 4 develops an algorithmic approach for pricing and demand segmentation of bundles in TL combinatorial auctions. Chapter 5 expands the latter framework to consider stochastic demand. Chapter 6 uses an analytical approach to demonstrate the benefits of in-vehicle consolidation for LTL carriers. Finally, Chapter 7 proposes an algorithm for pricing and demand segmentation of bundles in LTL combinatorial auctions that accounts for stochastic demand. This research provides meaningful negotiation guidance for shippers and carriers, which is supported by quantitative methods. Likewise, numerical experiments demonstrate the benefits and efficiencies of the proposed algorithms, which are transportation modeling contributions