The goal of this paper is to study a profit-maximization location-inventory problem in a multicommodity supply chain distribution network with price-sensitive demands. The problem determines location, allocation, price and order-size decisions in order to maximize the total profit of serving the customers. The problem is formulated as a mixed-integer nonlinear programming model and solved using...

In this paper we consider an extended version of the classical capacitated single allocation hub location problem in which the size of the hubs must be chosen from a finite and discrete set of allowable capacities. We develop a Lagrangian relaxation approach that exploits the problem structure and decomposes the problem into a set of smaller subproblems that can be solved efficiently. Upper bou...

A constraint satisfaction optimization model is established for just-in-time HFS scheduling problem with limited waiting time. Considering the problem’s complicated characteristic of having binary variables, this paper decomposes it into a Multiple Capacitated Flow Shop Scheduling (MCFS) problem and a machine allocation problem. During the process of solving the MCFS problem, a local search is ...

Given a set of items with associated deterministic weights and random rewards, the Adaptive Stochastic Knapsack Problem (Adaptive SKP) maximizes the probability of reaching a predetermined target reward level when items are inserted sequentially into a capacitated knapsack before the reward of each item is realized. This model arises in resource allocation problems which permit or require seque...

The main purpose of any facility location is to select the optimal places that satisfy project's goals. In location problems, the object is usually to optimize a function objective function that defines the problem conditions and efficient decision parameters. Numerous methods are proposed to challenge the location facility issues. In this paper, we consider a class of location/allocation probl...

Distribution network design as a strategic decision has long-term effect on tactical and operational supply chain management. In this research, a supply chain design problem based on a two level capacity location allocation problem (TLCLAP) is presented. A product must be transported from a set of seaport to meet stores demands, passing out by intermediate warehouses. The objective is to locate...

The aim of this study is to present a Genetic Algorithm (GA) for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) and to demonstrate its robustness and effectiveness for solving this problem. The appropriate objective function is correcting infeasible individuals to be feasible. These corrections are frequent in the initial population, so that in the subsequent generation...

The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in [36] that provides a unifying analysis of a wide class of hub location models. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also st...

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...