In this paper, an integrated production and transportation scheduling model is proposed. This model is based on multi-item capacitated lot sizing and facility location type models. The objective of the integrated model is to minimize the total production and transportation cost. The integrated model is solved by Lagrangian decomposition method and the decomposed two sub-problems can be solved b...

The Osorio and Glover (2003) use of dual surrogate analysis is exploited to fix variables in capacitated facility location problems (CFLP). The surrogate constraint is obtained by weighting the original problem constraints by their associated dual values in the LP relaxation. A known solution is used to convert the objective function in a constraint that forces the solution to be less or equal ...

In the event of a catastrophic bio-terror attack, major urban centers need to efficiently distribute large amounts of medicine to the population. In this paper, we consider a facility location problem to determine the points in a large city where medicine should be handed out to the population. We consider locating capacitated facilities in order to maximize coverage, taking into account a dist...

We consider a problem of optimal order allocation faced for example by an internet trading agent who seeks to ful…l an order for speci…ed amounts of several products from a pre-arranged list of suppliers, taking into account availability and price. We present a mixed integer programming (MILP) formulation for the case that suppliers impose a …xed charge which is waived or discounted on orders a...

In this paper we present an improved cut–and–solve algorithm for the single– source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two level local branching heuristic to find an upper bound and, if optimality has not yet been establi...

This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, c...

We study several joint facility location and inventory management problems with stochastic retailer demand. In particular, we consider cases with uncapacitated facilities, capacitated facilities, correlated retailer demand, stochastic lead times, and multicommodities. We show how to formulate these problems as conic quadratic mixed-integer problems. Valid inequalities, including extended polyma...

In this chapter, an integrated production and transportation scheduling model is proposed. This model is based on multi-item capacitated lot sizing and facility location type models. The objective of the integrated model is to minimize the total production and transportation cost. The integrated model is solved by Lagrangian decomposition method and the decomposed two sub-problems can be solved...

In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using th...