Allocation Strategies in Hub Networks

Cataloged from PDF version of article.In this paper, we study allocation strategies and their effects on total routing costs in hub networks. Given a set of nodes with pairwise traffic demands, the p-hub median problem is the problem of choosing p nodes as hub locations and routing traffic through these hubs at minimum cost. This problem has two versions; in single allocation problems, each node can send and receive traffic through a single hub, whereas in multiple allocation problems, there is no such restriction and a node may send and receive its traffic through all p hubs. This results in high fixed costs and complicated networks. In this study, we introduce the r-allocation p-hub median problem, where each node can be connected to at most r hubs. This new problem generalizes the two versions of the p-hub median problem. We derive mixed-integer programming formulations for this problem and perform a computational study using well-known datasets. For these datasets, we conclude that single allocation solutions are considerably more expensive than multiple allocation solutions, but significant savings can be achieved by allowing nodes to be allocated to two or three hubs rather than one. We also present models for variations of this problem with service quality considerations, flow thresholds, and non-stop service. (C) 2011 Elsevier B.V. All rights reserved

The splittable flow arc set with capacity and minimum load constraints

Cataloged from PDF version of article.We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capacity constraint and the convex hull of the set with a minimum load constraint

Star p-hub median problem with modular arc capacities

Cataloged from PDF version of article.We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost.We propose two formulations and a heuristic algorithm to solve this problem. The heuristic is based on Lagrangian relaxation and local search.We present computational results where formulations are compared and the quality of the heuristic solutions are tested. 2007 Elsevier Ltd. All rights reserved

Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution

Cataloged from PDF version of article.We consider a production planning problem for two items where the high quality item can substitute the demand for the low quality item. Given the number of periods, the demands, the production, inventory holding, setup and substitution costs, the problem is to find a minimum cost production and substitution plan. This problem generalizes the well-known uncapacitated lot-sizing problem.Westudy the projection of the feasible set onto the space of production and setup variables and derive a family of facet defining inequalities for the associated convex hull. We prove that these inequalities together with the trivial facet defining inequalities describe the convex hull of the projection if the number of periods is two. We present the results of a computational study and discuss the quality of the bounds given by the linear programming relaxation of the model strengthened with these facet defining inequalities for larger number of periods. 2009 Elsevier B.V. All rights reserved

The hierarchical hub median problem with single assignment

Cataloged from PDF version of article.We study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting the remaining hubs to central hubs and the demand centers to hubs and central hubs, respectively. The problem is to decide on the locations of a predetermined number of hubs and central hubs and the connections in order to minimize the total routing cost in the resulting network. This problem includes the classical p-hub median problem as a special case. We also consider a version of this problem where service quality considerations are incorporated through delivery time restrictions. We propose mixed integer programming models for these two problems and report the outcomes of a computational study using the CAB data and the Turkey data. 2009 Elsevier Ltd. All rights reserved

The vendor location problem

Cataloged from PDF version of article.The vendor location problem is the problem of locating a given number of vendors and determining the number of vehicles and the service zones necessary for each vendor to achieve at least a given profit. We consider two versions of the problem with different objectives: maximizing the total profit and maximizing the demand covered. The demand and profit generated by a demand point are functions of the distance to the vendor. We propose integer programming models for both versions of the vendor location problem. We then prove that both are strongly NP-hard and we derive several families of valid inequalities to strengthen our formulations. We report the outcomes of a computational study where we investigate the effect of valid inequalities in reducing the duality gaps and the solution times for the vendor location problem

Manufacturer's mixed pallet design problem

Cataloged from PDF version of article.We study a problem faced by a major beverage producer. The company produces and distributes several brands to various customers from its regional distributors. For some of these brands, most customers do not have enough demand to justify full pallet shipments. Therefore, the company decided to design a number of mixed or ‘‘rainbow’’ pallets so that its customers can order these unpopular brands without deviating too much from what they initially need. We formally state the company’s problem as determining the contents of a pre-determined number of mixed pallets so as to minimize the total inventory holding and backlogging costs of its customers over a finite horizon. We first show that the problem is NP-hard. We then formulate the problem as a mixed integer linear program, and incorporate valid inequalities to strengthen the formulation. Finally, we use company data to conduct a computational study to investigate the efficiency of the formulation and the impact of mixed pallets on customers’ total costs. 2007 Elsevier B.V. All rights reserved

Mark Up Margin Dan Implikasinya Pada Pembiayaan Murabahah Di Baitul Maal Wattamwil

The purpose of this research is to analyze the influence of Third Party Fund, Non Performing Financing (NPF) and Financing Deposit to Ratio (FDR) toward Mark up margin and its implication to Murabahah Financing in BMT.. BMT study population is located in South Jakarta and Tangerang, which had stood at least 5 years and already have a good financial statements and according to standards that have been set. All sample was determined using convenience sampling, the samples were chosen based on the ease of obtaining data and not troublesome to measure and cooperative. This research used path analysis method with decomposition model. The result of substructure I indicate that Third Party Fund, Non Performing Financing (NPF) and Financing Deposit to Ratio (FDR) variabels have significantly effect to the Mark up margin. The result of substructure II indicate that Third Party Fund and Financing Deposit to Ratio (FDR) have significantly effect to the Murabahah Financing.DOI: 10.15408/sjie.v2i1.237

A multi-stage stochastic programming approach in master production scheduling

Master Production Schedules (MPS) are widely used in industry, especially within Enterprise Resource Planning (ERP) software. The classical approach for generating MPS assumes infinite capacity, fixed processing times, and a single scenario for demand forecasts. In this paper, we question these assumptions and consider a problem with finite capacity, controllable processing times, and several demand scenarios instead of just one. We use a multi-stage stochastic programming approach in order to come up with the maximum expected profit given the demand scenarios. Controllable processing times enlarge the solution space so that the limited capacity of production resources are utilized more effectively. We propose an effective formulation that enables an extensive computational study. Our computational results clearly indicate that instead of relying on relatively simple heuristic methods, multi-stage stochastic programming can be used effectively to solve MPS problems, and that controllability increases the performance of multi-stage solutions

Large and dynamical tuning of a chalcogenide Fabry-Perot cavity mode by temperature modulation

Cataloged from PDF version of article.Te-enriched chalcogenide glass Ge15As25Se15Te45 (GAST) is synthesized, thermo-optically characterized and used to fabricate a one dimensional photonic crystal cavity mode that is dynamically and reversibly tuned by temperature modulation. The optical cavity mode is designed using GAST and As2S3 glasses after fully determining their temperature dependence of the complex refractive indices in the visible and near infrared spectrum using spectroscopic ellipsometry. By making use of the very large thermo-optic coefficient (dn/dT = 4x10(-4)/degrees C) of GAST glass at 1.2 mu m, the cavity mode of the multilayer was tuned reversibly more than 16 nm, which is, to the best of our knowledge, an order of magnitude larger for this kind of cavity modulation. Wide and dynamical spectral tuning of low bandgap chalcogenide glasses via temperature modulation can be utilized in photonic crystal based integrated optics, quantum dot resonance matching, solid state and gas laser components, and infrared photonic crystal fibers. (C) 2010 Optical Society of Americ