运筹学在汽车零部件入厂物流中的应用

汽车物流包括供应物流(零部件入厂物流)、生产物流、销售物流和回收物流,其中零部件入厂物流因其技术性强、复杂度高,被公认为汽车物流系统良性运作的关键环节.在分析汽车零部件入厂物流的基础上,研究运筹学在汽车零部件入厂物流中的应用, 构建数学模型,并用贪婪算法求解.     

强化学习在运筹学的应用:研究进展与展望

强化学习已经成为人工智能领域一个新的研究热点,并已成功应用于各领域,强化学习将运筹优化领域的很多问题视为序贯决策问题,建模为马尔可夫决策过程并进行求解,在求解复杂、动态、随机运筹优化问题具有较大的优势。本文主要对强化学习在运筹优化领域的应用进行综述,首先介绍了强化学习的基本原理及其应用于运筹优化领域的研究框架,然后回顾并总结了强化学习在库存控制、路径优化、装箱配载和车间作业调度等方面的研究成果,并将最新的深度强化学习以及传统方法在运筹学领域的应用研究进行了对比分析,以突出深度强化学习的优越性。最后提出几个值得进一步探讨的研究方向,期望能为强化学习在运筹优化领域的研究提供参考。     

基于启发式算法的乘用车物流运输计划问题研究

主要解决的是乘用车整车物流的运输调度问题,通过对轿运车的空间利用率和运输成本进行优化,建立整数规划模型,设计了启发式算法,求解出了各种运输条件下的详细装载与运输方案.     

基于遗传算法的汽车整车销售物流配送路径优化

为了优化汽车整车销售物流配送网络,提高配送服务质量,构建了以配送费用最小为目标的带时间窗的整车配送路径优化模型,采用改进遗传算法对模型进行求解,结合上汽通用五菱公司的配送实例,对其整车销售物流配送路径进行研究,并将改进遗传算法所确定的优化路径、节约里程法的优化路径、企业实际的配送路径进行比较,改进遗传算法确定的最优路径其配送费用比其它两种路径的配送费用降低了5.5%和8.9%,研究结果可以为企业确定经济、合理的配送路径提供参考.     

随机需求应急物流多阶段定位-路径鲁棒优化研究

为提高应急物流系统的应急反应能力,论文针对需求随机变化的应急物流定位-路径问题,利用鲁棒优化的思想将灾区物资需求量表示为区间型数据,将应急救援过程划分为多个阶段,以总救援时间和系统总成本最小为目标,构建了多物资多运输车辆应急物流定位-路径优化模型,设计了改进的遗传算法对其进行求解。实例计算结果表明,该模型和算法可以有效地解决应急物流系统中需求随机变化的定位-路径问题,为政府机构应对重大突发事件提供科学的决策参考。     

基于有向图规划的最佳物流路径策略分析及应用

本着重讨论基于有向图规划的最佳物流路径策略分析及应用。通过分析物流结构的一般模型，提出最短路径和关键路径物流策略分析方法，给出具体的分析和计算方法，并举实例加以说明，为解决现代物流结构性中存在的系统设计和运作等问题提供理论依据和技术方法。该方法也适用于其他动态规划问题的研究。     

大型水电工程物资调运建模及算法

根据小湾水电工程物资供应管理的实际情况,提出了物资调运的三级节点概念模型,论述了物资采购与调运的数学模型,并给出了具体算法。模型已应用于该工程物资调运决策支持系统中,运行实践表明,该模型能够辅助调度人员制定合理的物资采购与调运方案。     

部分联合运输策略下的物流车辆路径优化问题研究

论文分析了物流车辆路径优化问题的特点,提出了企业自营物流和第三方物流协同运输的部分联合运输策略。根据客户需求节点的特点进行了节点分类,建立了以车辆调用成本、车辆运输成本、第三方物流运输成本之和最小为目标的整数线性规划模型。根据部分联合运输策略下各类客户需求点运输方式特点,构造了一种新的变维数矩阵编码结构,并对传统算法中概率选择操作方式进行修改,提出了一种新的智能优化算法并与枚举法和遗传算法的运算结果进行了算法性能对比分析。结果显示,本文提出的逆选择操作蚁群算法具有较快的运算速度和较高的稳定性,是求解此类问题的一种有效算法。     

基于电动汽车的物流配送优化问题研究综述

随着人们对环境保护以及能源危机意识的增强,电动汽车以其低排放、低消耗、低污染的优势,逐渐被应用到日常的物流活动中.以电动汽车在物流配送中的应用为研究对象,综述了国内外学者对电动汽车在车辆调度优化、智能求解算法、服务设施选址以及充电策略等相关配送问题的研究现状,并讨论了电动汽车物流配送优化问题在模型构建、算法求解以及问题研究中存在的问题,并展望了未来物流配送方式的发展方向.     

基于精英单亲遗传算法的冷链物流VRP模型优化研究

针对冷链物流配送的特殊性,探索冷链物流车辆路径问题(VRP)优化方案.首先,在保证货物不超载的条件下,建立基于时间和品质因素的顾客满意度约束的多配送中心VRP(MDVRP)模型;其次,采用重心分区法和改进的精英单亲遗传算法,求解顾客在配送中心的分配,确定配送车辆数以及顾客服务次序;最后,用Matlab工具编程对模型进行求解分析.结果表明构建基于满意度的冷链物流MDVRP模型更适合冷链物流配送最优路径选择,并且改进单亲遗传算法能够有效求解这类问题.     

带退货和软时间窗的多仓库选址-路径问题研究

选址-路径问题(location routing problems, LRP)是集成物流网络研究中的难题,也是任何一个大型物流配送企业必须面对的管理决策问题。本文在仓库容量约束和车辆容量约束的基础上,结合送取货一体化的配送模式和客户服务时间要求,建立了带退货和软时间窗的多仓库选址-路径(MDLRP)数学模型。针对MDLRP问题求解的复杂性,引入局部搜索算法和重组策略,设计了自适应混合遗传算法,对模型进行整体求解。最后进行数值实验,表明本文提出的模型和改进算法具有实用性和优越性,可为选址和车辆运输决策提供重要参考依据。     

企业物流运营模式的选择分析

首先对多局中人动态冲突分析理论进行创新研究。然后结合BJ企业物流模式选择的现实问题，把多局中人动态冲突分析理论应用到企业当中，为企业进行预测决策提供科学依据，从而在企业物流运营模式选择的应用中得到了有意义的结论。     

A preference disaggregation decision support system for financial classification problems

Classification is one of the most extensively studied problems in the fields of multivariate statistical analysis, operations research and artificial intelligence. Decisions involving a classification of the alternative solutions are of major interest in finance, since several financial decision problems are best studied by classifying a set of alternative solutions (firms, loan applications, investment projects, etc.) in predefined classes. This paper proposes an alternative approach to the classical statistical methodologies that have been extensively used for the study of financial classification problems. The proposed methodology combines the preference disaggregation approach (a multicriteria decision aid method) with decision support systems. More specifically, the FINancial CLASsification (FINCLAS) multicriteria decision support system is presented. The system incorporates a plethora of financial modeling tools, along with powerful preference disaggregation methods that lead to the development of additive utility models for the classification of the considered alternatives into predefined classes. An application in credit granting is used to illustrate the capabilities of the system.     

Model and algorithm for inventory/routing decision in a three-echelon logistics system

This paper addresses an integrated inventory and routing problem in a three-echelon logistics system, which consists of a supplier, a central warehouse and a group of retailers. The inventory decision of each member and the routing decision among members of the system are made simultaneously, with the objective of minimizing the overall average cost of the system. A strategy named fixed partition and power-of-two (FP–POT) is proposed for the considered problem and a variable large neighborhood search (VLNS) algorithm, which is a special case of variable neighborhood search (VNS) algorithm, is developed. The efficiency of the strategy as well as the algorithm is illustrated by comparing computational results with a lower bound. The advantage of the proposed VLNS algorithm is further shown by getting better results for the problems in a two-echelon logistics system, which have been solved by a Tabu Search algorithm recently.     

Finished-vehicle transporter routing problem solved by loading pattern discovery

This work addresses a new transportation problem in outbound logistics in the automobile industry: the finished-vehicle transporter routing problem (FVTRP). The FVTRP is a practical routing problem with loading constraints, and it assumes that dealers have deterministic demands for finished vehicles that have three-dimensional irregular shapes. The problem solution will identify optimal routes while satisfying demands. In terms of complex packing, finished vehicles are not directly loaded into the spaces of transporters; instead, loading patterns matching finished vehicles with transporters are identified first by mining successful loading records through virtual and manual loading test procedures, such that the packing problem is practically solved with the help of a procedure to discover loading patterns. This work proposes a mixed-integer linear programming (MILP) model for the FVTRP considering loading patterns. As a special class of routing models, the FVTRP is typically difficult to solve within a manageable computing time. Thus, an evolutionary algorithm is designed to solve the FVTRP. Comparisons of the proposed algorithm and a commercial MILP solver demonstrate that the proposed algorithm is more effective in solving medium- and large-scale problems. The proposed scheme for addressing the FVTRP is illustrated with an example and tested with benchmark instances that are derived from well-studied vehicle routing datasets.     

联合勤务保障体系网络化建模与研究方法

为了研究联合勤务保障体系在作战行动中的作用,并为体系作战建立网络化的研究方法,提出了一种包含联合勤务网络的四层复杂作战网络,建立了相应的网络化模型。首先,对联合勤务保障体系进行了网络化的定义与描述,得到了认知域、信息域、物理域、联合勤务网络内每个节点的状态属性值;然后,建立了不同网络之间的涌现性模型,提出了作战链与勤务保障链的概念,通过定义涌现满足度曲线,得到了每个节点的网络涌现程度值;最后,针对同层网络和不同层网络分别提出了对应的网络体系同步能力提高方法。研究结果表明:建立的网络化模型与提高同步能力的方法合理有效,对于体系作战的量化研究有一定的实践意义。     

选址-库存-路径问题模型及其集成优化算法

设施选址、库存控制和车辆路径安排是物流系统优化中的三个关键问题,三者之间存在相互依赖的关系,应该根据这种关系来相应地进行综合优化与管理物流活动。以典型的单一生产基地、单一产品、采用不断审查的(Q, r)库存策略的供应链二级分销网络为研究对象,建立了一个随机型选址-库存-路径问题优化模型;在将非线性混合整数规划转化为线性整数集合覆盖模型的基础上,采用列生成算法来获得一个近似最优解,再用分支定价法对初始解进行改进,以实现对整个问题“完全集成”的优化。最后,用随机生成的方式,产生了10至160个客户的计算实例,分析了运输费用和库存费用对总成本的影响,算法运算时间表明本文给出的算法能较快地求解这一复杂问题。     

Modeling and solution of the joint quay crane and truck scheduling problem

This paper addresses the joint quay crane and truck scheduling problem at a container terminal, considering the coordination of the two types of equipment to reduce their idle time between performing two successive tasks. For the unidirectional flow problem with only inbound containers, in which trucks go back to quayside without carrying outbound containers, a mixed-integer linear programming model is formulated to minimize the makespan. Several valid inequalities and a property of the optimal solutions for the problem are derived, and two lower bounds are obtained. An improved Particle Swarm Optimization (PSO) algorithm is then developed to solve this problem, in which a new velocity updating strategy is incorporated to improve the solution quality. For small sized problems, we have compared the solutions of the proposed PSO with the optimal solutions obtained by solving the model using the CPLEX software. The solutions of the proposed PSO for large sized problems are compared to the two lower bounds because CPLEX could not solve the problem optimally in reasonable time. For the more general situation considering both inbound and outbound containers, trucks may go back to quayside with outbound containers. The model is extended to handle this problem with bidirectional flow. Experiment shows that the improved PSO proposed in this paper is efficient to solve the joint quay crane and truck scheduling problem.     

Design of an IT-driven decision support system for vehicle routing and scheduling

This paper presents the development of a decision support system used by an oil downstream company for routing and scheduling purposes. The studied problem refers to a complex delivery process of oil products from a number of distribution centers to all customers. The latest rapid advance of operations research (OR) applications, in the form of advanced planning and scheduling (APS) systems, has shown that OR algorithms can be applied in practice if (a) they are embodied in packaged information technology (IT) solutions, (b) the interface problems to mainstream ERP software applications are solved. In this study the utilisation of advanced IT systems supports effectively the planning and management of distribution operations. The combination of a supply chain management (SCM) application with a geographical information system (GIS) integrated with an enterprise resource planning (ERP) software resulted to this innovative decision support tool. The objectives of this new tool are: optimum use of the distribution network resources, transportation cost reduction and customer service improvement. The paper concludes with the benefits of the new system, emphasising at how new technologies can support transportation processes with the help of operations research algorithms embedded in software applications.