基于混合整数规划的配送中心选址研究

目前关于选址问题研究有很多,基于混合整数规划的选址问题研究也有一些,但是还存在一些问题。其中一个是,在目前的多源供应模型中(即多工厂),只考虑了单位产品的运输费用,都没有考虑到工厂到配送中心和配送中心到客户路线开启的固定成本投入,即一条线路上不管运多运少其单位价格都一样,这显然是不合理的。因此本文在原来混合整数规划模型的基础上考虑以上线路开启的固定成本投入,建立了新的模型,并且进行实例求解。     

物流系统中的运输决策

基于目标规划理论,综合考虑了解决运输问题时所面临的多个目标,为企业物流中的运输决策提出了科学合理的解决方法。     

A goal programming model for achieving racial balance in public schools

This paper develops a goal programming model for achieving racial balance in segregated public schools. The model is illustrated and offered as an improvement upon linear programming, a model previously applied in the literature which allows a single objective function only and, in comparison with goal programming, requires more variables and constraints. Goal programming, a member of the general multiple objective linear programming (MOLP) model, improves upon these among other disadvantages thereby emerging as a more efficient tool for student assignment problems.     

Analytical methods for planning educational facilities in an era of declining enrollments

With declining enrollments, metropolitan school districts are faced with problems of property disposition. A school facilities planning and management model utilizing a linear programming approach enables assessment of alternative uses for school facilities. The objective in this study is to minimize expenditures subject to constraints which include a limit to distance traveled, racial ethnic quotas, and overhead costs, such as transportation, maintenance and energy. An economic post-optimal cost sensitivity analysis of the proposed options is presented and also a comparison of this approach to school management with others found in the literature.     

基于双层规划的综合运输网内承载运输量研究

提出了综合运输通道内运输量分配的双层规划模型．以便找到在综合交通运输通道内分配运输量的最优策略．从定量角度出发，既保证运输商使自己的运输费用最小，又能使上层部门优化分配运输量．使得综合交通运输通道内的系统经济效益最大。同时运用层次分析法，来计算多种交通方式之间的相对广义运输费用。最后给出一个算例说明了模型的应用。     

循环经济理论下的城市固体废物物流系统优化模型

基于循环经济理论的减量化、再使用和再循环原则,分析了城市固体废物物流系统和固体废物处理的物流流程,以运输成本、处理成本、固定成本减去回收收益得到的固体废物处理总成本最低为目标,建立了城市固体废物物流系统设施选址、设施数量和物流流量优化的混合整数规划模型,并对模型中的参数估计问题进行了讨论。     

考虑碳成本的成品油库选址问题研究

将碳成本考虑到运输成本中去,通过LINGO编程计算将核算了碳成本的总成本与没核算碳成本的总成本进行比较,并给出一个包含碳成本的成品油库选址方案。     

Joint decision of procurement lot-size,supplier selection,and carrier selection

The joint decision making of procurement lot-size, supplier selection, and carrier selection has potential to reduce buyer's purchasing expenditures. Furthermore, the total logistics cost can also come down through economies of scale in the purchasing and transportation costs, and reduction in supply chain disruptions such as rejections and late deliveries. We study a procurement setting in which a buyer needs to purchase a single product from a set of suppliers over finite discrete time periods to satisfy service level requirements. The suppliers offer all-unit quantity discounts, and transportation cost depends on carrier capacity as well as geographical location of suppliers. This paper proposes an integer linear programming model to simultaneously determine the timings of procurement, lot-sizes, suppliers and carriers to be chosen so as to incur the least total cost over the planning horizon. A numerical example is included to demonstrate the effectiveness of the proposed model in establishing tradeoffs among purchasing cost, transaction cost, and inventory holding cost. Sensitivity analysis has been carried out to understand the effects of the model parameters on the purchasing decisions and total cost. Managerial insights of this study serve as a reference for decision makers to develop effective procurement strategies.     

基于网络单纯形法的冷链物流运输优化研究

冷链物流运输的特殊性使得从事冷链物流运输的企业支付了高额的成本,针对目前的现实情况,从降低冷链物流运输过程中成本的角度,对冷链物流运输问题进行优化,使用线性规划的方法,对冷链物流运输过程中空箱的进出、中转构建模型,结合所构建的模型,给出相关的算例,根据给定的数据计算出结果验证了所构建模型的合理性,使冷链物流运输货物成本最低问题的研究又多了一种新的定量分析的方法。     

流水型CONWIP生产系统研究

本文研究了流水型CONWIP生产系统中在制品常量、批量和加工次序的问题。以机床加工准备成本及工件库存成本和加工流动时间为优化目标．建立了CONWIP系统整数规划模型，并提出了求解问题的启发式算法。在优化机床准备及库存成本的基础上．得到各产品的生产批量和系统在制品常量。同时，提出了流水型CONWIP生产系统的排序算法（CFA），依此得到产品的较优加工次序。本研究使CONWIP模型求解得到简化且易于应用，并获得满意解。     

集装箱空箱调运优化问题的研究

在分析集装箱空箱流转过程的基础上,提出建立基于海陆运整体成本最优的集装箱空箱调运随机性优化模型,并将粒子群算法与随机模拟技术相结合用于求解机会约束规划。最后通过对测试算例进行求解,验证了该模型和算法的合理性和有效性。     

An application of goal programming to the desegregration busing problem

This paper develops a goal programming model for obtaining solutions to the desegregation busing problem. The model is compared with the linear programming approach and is applied to 31 schools serving over 14,000 students. Solutions result in potential cost savings of over one-half million dollars.     

低碳经济视角下闭环供应链网络优化研究

在低碳经济背景下,研究具有多个供应商、多个制造商、多个消费者市场以及多个回收中心的闭环供应链网络。综合考虑碳减排和废旧产品回收因素,以总运营成本最小化为优化目标,建立混合整数规划模型,从而解决网络节点的建设、节点间运量、运输方式选择、减排技术投资、回收中心选址以及回收中心环保水平等供应链网络资源配置问题。通过lingo12软件对低碳闭环供应链网络进行优化模拟,得到对生产实践有指导作用的结论。     

新华书店的区域配送中心选址模型

文章针对省新华书店配送中心选址问题,综合考虑了书籍运输成本与区域配送中心运营成本等成本因素。建立了以区域配送中心总成本最小化为目标的一个混合整数选址模型;在模型求解方法的选择上,根据混合整数模型的特点,提出了将模型的求解分成两个部分：线性部分采用运输规划法求解,非线性部分采用隐枚举法求解;最后通过实例论证了模型对求解配送中心选址问题的可行性并得到了比较满意的选址结果。     

国际集装箱海铁联运计划优化

集装箱海铁联运具有经济、安全、效率快、运量大等突出优势,是未来集装箱多式联运的重要模式,合理优化集装箱海铁联运计划对于我国国际贸易的发展具有十分重要的意义。文中提出一个海铁联运的计划优化模型,目标函数为总成本最低。文中最后使用真实数据配合Lingo软件求解了此混合整数规划模型并得出结论。     

A note on distribution analysis in a linear programming model

A linear programming model is used to examine the correspondence between population projections for the provinces and projections for production sectors in Sweden. Furthermore the model is used for analyzing the conflict between the two objectives – regional equality in per capita income and minimal investment requirements. The calculations of the model show that it is possible simultaneously to attain the production targets for the sectors and the population targets for the provinces. The cost in terms of investment resources for a reduction of the difference in regional income is comparatively modest at the beginning of the equalization process bu the cost increases sharply as the equalization process proceeds. Finally a comparison is made with an extended dynamized version of the model also including transportation costs.     

An alternative solution method for goal programming problems: The lexicographic goal programming case

This article provides an example of the use of an alternative goal programming solution procedure. The solution procedure is applied to solve a lexicographic goal programming problem. In the process of illustrating the problem, a number of unique technical problems and their solution procedures are discussed. This study provides a flowchart as a procedural guide to aid in its use. This article also provides a comparative analysis of GP algorithms. The results demonstrate the tableau element reduction capabilities of the proposed alternative goal programming solution procedure.     

Currently practiced formulations for the assembly line balance problem

New formulations for the assembly line balance problem are proposed based on interviews and surveys of practicing engineers. These formulations are the basis for a model in goal programming form. A branch-and-bound algorithm is developed which can solve the model for an optimum solution. Computational studies show that computer run time is very modest for moderate size problems.Interviews and a survey of practicing engineers were used to develop a list of goals or constraints germane to the assembly line balance problem. These included minimizing working areas or employees, making sure tasks assigned to a station do not exceed the cycle time, and adhering to sequence constraints. These constraints are included in most traditional models. However, additional goals were mentioned. These included avoiding changes in workload assigned to a work area, adhering to layout requirements of the plant, making combinations of tasks interesting, avoiding the combination of physiologically demanding tasks, etc.The additional goals above are incorporated in a new formulation for the assembly line balance problem. This formulation is in goal programming form. The goal programming model attempts to minimize deviations from goals. If deviations are necessary, lowest ranked goals are violated first. The objective function of the model is based on an ordinal ranking of goals only. The survey mentioned above showed that engineers did not find it difficult to rank the importance of goals.The proposed goal programming model is a mixed integer linear program. Previous studies have shown that cutting plane and implicit enumeration techniques are inferior to branch-and-bound algorithms. A branch-and-bound method, called GoalOriented Algorithm for Line Balance (GOAL), is developed to solve the formulations proposed in the paper.GOAL was computationally tested with 50 problems. These problems varied in size from 4 to 35 tasks. One of the problems was an engine cradle assembly problem encountered by an automobile manufacturer. Computer run times appeared reasonable. For example, the engine cradle problem 35 tasks) required only 16.3 seconds CPU on the DEC PDF at California State University, Northridge. GOAL's execution time appeared linearly proportional to the number of tasks required for most problems.     

库存-运输系统整合优化Excel模型求解

提出了库存-运输整合优化模型,将库存与运输问题看作一个系统整体考虑,比传统的将库存、运输单独考虑的物流成本要少的多。通过Excel模型的建立与求解,展现了Excel软件在规划求解方面的不可忽视的作用。     

A goal programming model for readiness and the optimal redeployment of resources

Organizations such as the military and those involved with disaster relief are vitally concerned with their ability to redeploy resources between various geographical locations in response to cataclysmic events. Measuring the effectiveness of a redeployment plan involves multiple objectives and differing priorities. The primary objective of redeployment is meeting requirements at affected locations with a secondary concern for transportation costs. In order to reflect these features, the problem is formulated as a goal programming model. Several variations of the model are investigated that can enhance its value. An example redeployment problem is formulated and solved to illustrate the approach.