A column generation approach for location-routing problems with pickup and delivery

In this paper we formulate an integer programming model for the Location and Routing Problem with Pickup and Delivery. We propose a column generation scheme and implement, for the subproblem, a label-setting algorithm for the shortest path with pickup and delivery and time windows problem. We also propose a set of heuristics to speed up this process. To validate the model, we implement the column generation scheme and test it on different instances developed in this paper. We also provide an analysis of how the costs of opening depots and the fixed cost of routes affect the optimal solution.     

Solving Large Quadratic Assignment Problems in Parallel

Quadratic Assignment problems are in practice among the mostdifficult to solve in the class of NP-complete problems. Theonly successful approach hitherto has been Branch-and-Bound-basedalgorithms, but such algorithms are crucially dependent on good boundfunctions to limit the size of the space searched. Much work hasbeen done to identify such functions for the QAP, but with limitedsuccess.Parallel processing has also been used in order to increase the sizeof problems solvable to optimality. The systems used have, however, oftenbeen systems with relatively few, but very powerful vector processors, andhave hence not been ideally suited for computations essentially involving non-vectorizable computations on integers.In this paper we investigate the combination of one of the best bound functions for a Branch-and-Bound algorithm (the Gilmore-Lawler bound) and various testing, variable binding and recalculation of bounds between branchings when used in aparallel Branch-and-Bound algorithm. The algorithm has been implemented on a 16-processor MEIKO Computing Surface with Intel i860processors. Computational results from the solution of a number of large QAPs, including the classical Nugent 20 are reported.     

Gross–Pitaevskii dynamics of Bose–Einstein condensates and superfluid turbulence

The Gross–Pitaevskii equation, also called the nonlinear Schrödinger equation (NLSE), describes the dynamics of low-temperature superflows and Bose–Einstein Condensates (BEC). We review some of our recent NLSE-based numerical studies of superfluid turbulence and BEC stability. The relations with experiments are discussed.     

Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm

In this paper we study two-dimensional Ising spin glasses on a grid with nearest neighbor and periodic boundary interactions, based on a Gaussian bond distribution, and an exterior magnetic field. We show how using a technique called branch and cut, the exact ground states of grids of sizes up to 100×100 can be determined in a moderate amount of computation time, and we report on extensive computational tests. With our method we produce results based on more than 20,000 experiments on the properties of spin glasses whose errors depend only on the assumptions on the model and not on the computational process. This feature is a clear advantage of the method over other, more popular ways to compute the ground state, like Monte Carlo simulation including simulated annealing, evolutionary, and genetic algorithms, that provide only approximate ground states with a degree of accuracy that cannot be determineda priori. Our ground-state energy estimation at zero field is –1.317.     

Moving eccentric crack in a piezoelectric strip bonded to elastic materials

Summary  The steady-state of a propagation eccentric crack in a piezoelectric ceramic strip bonded between two elastic materials under combined anti-plane mechanical shear and in-plane electrical loadings is considered in this paper. The analysis based on the integral transform approach is conducted on the permeable crack condition. Field intensity factors and energy release rate are obtained in terms of a Fredholm integral equation of the second kind. It is shown for this geometry that the crack propagation speed has influence on the dynamic energy release rate. The initial crack branching angle for a PZT-5H piezoceramic structure is predicted by the maximum energy release rate criterion. Received 23 January 2001; accepted for publication 18 October 2001     

An efficient solver for weighted Max-SAT

We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence that our solver is very competitive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers on a wide range of instances.     

Urban rapid transit network capacity expansion

This paper examines a multi-period capacity expansion problem for rapid transit network design. The capacity expansion is realized through the location of train alignments and stations in an urban traffic context by selecting the time periods. The model maximizes the public transportation demand using a limited budget and designing lines for each period. The location problem incorporates the user decisions about mode and route. The network capacity expansion is a long-term planning problem because the network is built over several periods, in which the data (demand, resource price, etc.) are changing like the real problem changes. This complex problem cannot be solved by branch and bound, and for this reason, a heuristic approach has been defined in order to solve it. Both methods have been experimented in test networks.     

Packing Steiner trees: a cutting plane algorithm and computational results

In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational experience. This includes a brief discussion of separation algorithms, a new LP-based primal heuristic and implementation details. The paper is based on the polyhedral theory for the Steiner tree packing polyhedron developed in our companion paper (this issue) and meant to turn this theory into an algorithmic tool for the solution of practical problems.     

Special ordered sets and an application to gas supply operations planning

Special Ordered Sets provide a powerful means of modeling nonconvex functions and discrete requirements, though there has been a tendency to think of them only in terms of multiple-choice zero-one programming. This paper emphasizes the origins and generality of the special ordered set concept, and describes an application in which type 2 sets are used in several forms to model both logical conditions and nonlinear functions.Now at IBM Almaden Research Center, San Jose, CA 95120.