Osman Alp

An Efficient Genetic Algorithm for the p-Median Problem

We propose a new genetic algorithm for a well-known facility location problem. The algorithm is relatively simple and it generates good solutions quickly. Evolution is facilitated by a greedy heuristic. Computational tests with a total of 80 problems from four different sources with 100 to 1,000 nodes indicate that the best solution generated by the algorithm is within 0.1% of the optimum for 85% of the problems. The coding effort and the computational effort required are minimal, making the algorithm a good choice for practical applications requiring quick solutions, or for upper-bound generation to speed up optimal algorithms.

Designing a road network for hazardous materials shipments

We consider the problem of designating hazardous materials routes in and through a major population center. Initially, we restrict our attention to a minimally connected network (a tree) where we can predict accurately the flows on the network. We formulate the tree design problem as an integer programming problem with an objective of minimizing the total transport risk. Such design problems of moderate size can be solved using commercial solvers. We then develop a simple construction heuristic to expand the solution of the tree design problem by adding road segments. Such additions provide carriers with routing choices, which usually increase risks but reduce costs. The heuristic adds paths incrementally, which allows local authorities to trade off risk and cost. We use the road network of the city of Ravenna, Italy, to demonstrate the solution of our integer programming model and our path-addition heuristic.

Tactical capacity management under capacity flexibility

In many production systems a certain level of flexibility in the production capacity is either inherent or can be acquired. In that case, system costs may be decreased by managing the capacity and inventory in a joint fashion. In this paper we consider such a make-to-stock production environment with flexible capacity subject to periodic review under non-stationary stochastic demand, where we allow for positive fixed costs both for initiating production and for acquiring external capacity. Our focus is on tactical-level capacity management which refers to the determination of in-house production capacity while the operational-level integrated capacity and inventory management is executed in an optimal manner. We first develop a simple model to represent this relatively complicated problem. Then we elaborate on the characteristics of the general problem and provide the solution to some special cases. Finally, we develop several useful managerial insights as to the optimal capacity level, the effect of operating at a suboptimal capacity level and the value of utilizing flexible capacity.

Integrated Routing and Scheduling of Hazmat Trucks with Stops En Route

We consider an integrated routing and scheduling problem in hazardous materials transportation where accident rates, population exposure, and link durations on the network vary with time of day. We minimize risk (accident probability multiplied by exposure) subject to a constraint on the total duration of the trip. We allow for stopping at the nodes of the network. We consider four versions of this problem with increasingly more realistic constraints on driving and waiting periods, and propose pseudopolynomial dynamic programming algorithms for each version. We use a realistic example network to experiment with our algorithms and provide examples of the solutions they generate. The computational effort required for the algorithms is reasonable, making them good candidates for implementation in a decision-support system. Many of the routes generated by our models do not exhibit the circuitous behavior common in risk-minimizing routes. The en route stops allow us to take full advantage of the time-varying nature of accident probabilities and exposure and result in the generation of routes that are associated with much lower levels of risk than those where no waiting is allowed.

Outsourcing Logistics: Designing Transportation Contracts Between a Manufacturer and a Transporter

In our environment, a manufacturer procures material from a supplier and the supplier brings it in bulk to a warehouse. This material is then consigned to the plant area, where it is utilized as an input of the production process. This consignment process is outsourced by the manufacturer and a transportation company is selected via a bidding mechanism. Primarily, we consider the problem of designing parameters of a given contract for the transportation activity. We define three subproblems within the contract design problem that interact with each other to a certain extent. These subproblems are the vehicle dispatching problem, inventory control problem, and contract value problem. We define these problems, exploit their interactions, and propose solution methods. Moreover, we present an approach to design such transportation contracts, which is based on solving these subproblems in an order for an adequate number of contract parameter combinations and selecting the one that minimizes expected total costs for the manufacturer.

Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs

We characterize optimal policies of a dynamic lot-sizing/vehicle-dispatching problem under dynamic deterministic demands and stochastic lead times. An essential feature of the problem is the structure of the ordering cost, where a fixed cost is incurred every time a batch is initiated (or a vehicle is hired) regardless of the portion of the batch (or vehicle) utilized. Moreover, for every unit of demand not satisfied on time, holding and backorder costs are incurred. Under mild assumptions we show that the demand of a period is satisfied from at most three distinct production (dispatching) epochs. We devise a dynamic programming algorithm to compute the production/dispatching quantities and times.

A joint replenishment policy with individual control and constant size orders

We consider inventory systems with multiple items under stochastic demand and jointly incurred order setup costs. The problem is to determine the replenishment policy that minimises the total expected ordering, inventory holding, and backordering costs–the so-called stochastic joint replenishment problem. In particular, we study the settings in which order setup costs reflect the transportation costs and have a step-wise cost structure, each step corresponding to an additional transportation vehicle. For this setting, we propose a new policy that we call the (s, 𝒬) policy, under which a replenishment order of constant size 𝒬 is triggered whenever the inventory position of one of the items drops to its reorder point s. The replenishment order is allocated to multiple items so that the inventory positions are equalised as much as possible. The policy is designed for settings in which backorder and setup costs are high, as it allows the items to independently trigger replenishment orders and fully exploits the economies of scale by consistently ordering the same quantity. A numerical study is conducted to show that the proposed (s, 𝒬) policy outperforms the well-known (𝒬, S) policy when backorder costs are high and lead times are small.

Integrated capacity and inventory management with capacity acquisition lead times

We model a make-to-stock production system that utilizes permanent and contingent capacity to meet non-stationary stochastic demand, where a constant lead time is associated with the acquisition of contingent capacity. We determine the structure of the optimal solution concerning both the operational decisions of integrated inventory and flexible capacity management, and the tactical decision of determining the optimal permanent capacity level. Furthermore, we show that the inventory (either before or after production), the pipeline contingent capacity, the contingent capacity to be ordered, and the permanent capacity are economic substitutes. We also show that the stochastic demand variable and the optimal contingent capacity acquisition decisions are economic complements. Finally, we perform numerical experiments to evaluate the value of utilizing contingent capacity and to study the effects of capacity acquisition lead time, providing useful managerial insights.

Integrated workforce capacity and inventory management under labour supply uncertainty

In a manufacturing environment with volatile demand, inventory management can be coupled with dynamic capacity adjustments for handling the fluctuations more effectively. In this study, we consider the problem of integrated capacity and inventory management under non-stationary stochastic demand and capacity uncertainty. The capacity planning problem is investigated from the workforce planning perspective where the capacity can be temporarily increased by utilising contingent workers from an external labour supply agency. The contingent capacity received from the agency is subject to an uncertainty, but the supply of a certain number of workers can be guaranteed through contracts. There may also be uncertainty in the availability of the permanent and contracted workers due to factors such as absenteeism and fatigue. We formulate a dynamic programming model to make the optimal capacity decisions at a tactical level (permanent workforce size and contracted number of workers) as well as the operational level (number of workers to be requested from the external labour supply agency in each period), integrated with the optimal operational decision of how much to produce in each period. We analyse the characteristics of the optimal policies and we conduct an extensive numerical analysis that helps us provide several managerial insights.

An integrated approach to inventory and flexible capacity management subject to fixed costs and non-stationary stochastic demand

In a manufacturing system with flexible capacity, inventory management can be coupled with capacity management in order to handle fluctuations in demand more effectively. Typical examples include the effective use of temporary workforce and overtime production. In this paper, we discuss an integrated model for inventory and flexible capacity management under non-stationary stochastic demand with the possibility of positive fixed costs, both for initiating production and for using contingent capacity. We analyze the characteristics of the optimal policies for the integrated problem. We also evaluate the value of utilizing flexible capacity under different settings, which enable us to develop managerial insights.