不确定同时取送货车辆路径问题及粒子群算法研究

研究了不确定同时取送货车辆路径问题(VRPSPD),考虑运行环境的不确定性,顾客时间窗口要求和对顾客同时进行取货和送货服务的情况,以运作成本最低和顾客满意度最高为决策目标,构建不确定VRPSPD数学模型。模型中,引入模糊随机理论来描述决策环境中的双重不确定性,假定顾客需求量(送货量)和取货量是模糊随机变量。随后,提出基于模糊随机算子的改进粒子群算法对模型进行求解。为了适应模型特点和提高算法效率,设计合理的编码和解码过程,制定多个适应度函数方案处理多目标问题,并应用更加科学的更新策略。最后在应用案例中,通过参数测试获取合理的算法参数取值,采用计算结果分析和求解算法测评验证模型和算法的有效性。     

冷链物流同时送取货车辆路径优化

针对冷链物流同时送取货车辆路径优化问题,分析冷链物流配送中的车辆固定成本、行驶成本、制冷成本和货损成本等成本构成,以总成本最小化为目标,将冷链物流配送的送货和取货业务综合到每一个客户节点,建立单个配送中心和多个客户节点的冷链物流配送车辆路径优化模型,并采用遗传算法进行求解,算例分析验证了所建模型和设计算法的适用性和可行性,结果表明优化后的同时送取货车辆配送方案能够降低配送成本,提高配送效率,研究结论对冷链物流配送决策具有重要的参考价值.     

应急物流LRP鲁棒双层优化模型研究

考虑到突发事件下受灾点对救灾物资需求的不确定性,针对应急物流设施的定位和车辆运输救灾物资路线进行协同研究,建立了应急物流设施定位-车辆路线选择问题(LRP)鲁棒双层优化模型.运用分散式决策方式下的转化定理,将所建立的含有不确定系数的层次关联协同优化模型进行确定性转化,并设计一种混合遗传算法对转化后的确定性双层规划模型进行求解,最后,通过实例验证了模型的合理性及算法的可行性.     

考虑多行程与同时取送货的电动车路径问题研究

针对城市物流配送中的电动车辆路径优化问题,考虑电动汽车的充电特性以及车辆多行程和需求点的双向货流,以最小化车辆成本、行驶成本和充电成本为目标,建立考虑多行程与同时取送货的电动车辆路径问题(EVRPMTSPD)模型,并采用列生成算法进行求解.为提高子问题求解速度,提出了基于蚁群算法的启发式寻路算法用以处理较大规模问题,数值实验验证了模型与算法的有效性,表明了考虑多行程和同时取送货能有效降低成本和提高效率.     

随机需求下单供应商与多零售商的生产—库存—运输联合优化模型

考虑随机需求下单供应商和多零售商的生产-库存-运输联合优化问题.在独立决策时,各零售商独立决策其最优订货量和最优订货点,供应商根据各零售商的决策来为之配送.在联合决策时,由供应商统一决策各零售商的送货量和送货时间,并基于此建立单供应商与多零售商的生产-库存-运输优化模型,利用粒子群算法和模拟退火算法相结合的两阶段算法求出最优送货量、最优运输路径和最大期望总利润.然后采用收入共享契约将增加的利润合理分配给供应商和各零售商,使各方利润都得到增加,从而促使各方愿意合作.最后,通过数值算例验证了联合优化模型优于独立决策模型.     

随机需求下多供应商和多零售商的生产-库存-运输联合优化模型

考虑随机需求下多供应商和多零售商的生产-库存-运输联合优化问题.在联合优化时,首先利用最近邻算法将各零售商分成不同区域,分区后问题转化为随机需求下单供应商对多零售商的生产-库存-运输联合优化问题.在每个分区内,由供应商统一决策其分区内各零售商的送货量和送货时间.利用粒子群算法和模拟退火算法相结合的两阶段算法求出最优送货量、最优运输路径和最大期望总利润.然后采用收入共享契约将增加的利润合理分配给各供应商和各零售商,使各方利润都得到增加,从而促使各方愿意合作.通过数值算例验证了联合优化模型优于独立决策模型.     

一个基于货物运输的批处理机随机调度模型研究

本文以货物运输为背景新建立了一个批处理机随机调度模型,目的是为了应付货物运输中运输时间的不确定性和货主取货时间的不确定性.首先将模型转化为与其等价的确定优化问题,接着研究给出了确定优化问题的性质,最后基于这些性质给出了一个求解确定优化问题的启发式算法.该问题的解决可望为物流公司等进一步改善服务质量提供了一些理论依据     

考虑订单取件时间和柔性时间窗的取送货车辆路径问题

研究了同城配送中考虑订单取货时间和柔性时间窗的取送货车辆路径问题,考虑同城配送中订单起终点,订单取货时间和订单配送的柔性时间窗,车容量限制等因素。首先构建以配送成本与超时惩罚成本之和最小化为目标的混合整数线性模型。其次,设计了含多种有效不等式及其对应分离算法的改进分支切割算法对该模型进行精确求解。最后通过实验测试分析了不等式的性能,验证了算法的有效性,实验表明适当的减少车辆数和增大装载能力能够有效的减少成本。     

基于遗传算法的固定起讫点危险品配送路线优化

为科学选择危险品配送路线,保障运输安全,将传统TSP(Travelling SalesmanProblem)问题加以推广和延伸,建立以路段交通事故率、路侧人口密度、环境影响因子和路段运输费用为指标的固定起讫点危险品配送路线优化模型.以遗传算法基本框架为基础,引入新的遗传算子,构建了可用于实现模型的多目标遗传算法.实例仿真表明,所建模型和算法在求解固定起讫点危险品配送路线优化问题中有较好的实用性.     

基于海空协同的群岛救援方案优化模型及算法

针对边远群岛的物资供给受突发事件影响可能出现中断,需要开展紧急救援的实际情况,以中心岛屿为救援出发地,采用海空协同运输方式,以选择救援路线和分配救援物资批量为优化内容,对中心岛屿周边各岛救援用时最短为目标,建立了考虑海空协同的群岛应急救援模型。根据所建模型的特点,对基于运输点划分的遗传算法(PB-GA)进行进一步的改进,提出一种能够同时考虑两种运输方式、多批次运输的双层搜索遗传算法进行求解。最后,以南海群岛开展紧急救援为算例进行了优化分析。采用不同算法分别进行比较后显示,本文算法在优化结果、运算时间等方面均更优,从而验证了所建模型和算法的合理性与有效性。本文研究为制定群岛海空联合救援的应急预案提供了分析方法。     

军需物资调集规划问题的研究

以军需物资调集为背景 ,在系统分析的基础上建立了全局优化问题的数学规划模型 ,并对模型求解进行了研究 ,提出两阶段规划算法 .仿真计算结果表明所建模型的有效性     

回载可分的闭环供应链配送中的多车辆运输策略

本文从车辆路径的角度研究了具有一个配送中心、多台车辆结合前向物流配送和逆向物流回载的闭环供应链运输策略,考虑回收产品的不同形态和可分批运输的特点,引入库存限制和成本惩罚,建立并分析了问题的数学模型．通过引入参数2σ原则构造了先分组后组内运用基于TSP的插入算法进行优化调整的启发式求解方法．算例分析表明该策略是合理有效的．     

Decentralized Dual-Based Algorithm for Computing Optimal Flows in a General Supply Chain

This paper addresses the issue of the optimal flow allocation in general supply chains. Our basic observation is that a distribution channel involving several reselling steps for a particular product can be viewed as a route in a supply chain network. The flow of goods or services along each route is influenced by the customer's demand, described by the corresponding utility functions, and prices charged at each node. We develop an optimization algorithm based on the primal-dual framework and the Newton's step that computes optimal prices at each node (dual problem) and then computes the optimal flow allocation (primal problem) based on these prices. Our main contribution is a discovery that the Newton's step leads to a partially decentralized algorithm which is a first step toward a decentralization schema for computing optimal prices.     

Emergency Logistics Planning in Natural Disasters

Logistics planning in emergency situations involves dispatching commodities (e.g., medical materials and personnel, specialised rescue equipment and rescue teams, food, etc.) to distribution centres in affected areas as soon as possible so that relief operations are accelerated. In this study, a planning model that is to be integrated into a natural disaster logistics Decision Support System is developed. The model addresses the dynamic time-dependent transportation problem that needs to be solved repetitively at given time intervals during ongoing aid delivery. The model regenerates plans incorporating new requests for aid materials, new supplies and transportation means that become available during the current planning time horizon. The plan indicates the optimal mixed pick up and delivery schedules for vehicles within the considered planning time horizon as well as the optimal quantities and types of loads picked up and delivered on these routes. In emergency logistics context, supply is available in limited quantities at the current time period and on specified future dates. Commodity demand is known with certainty at the current date, but can be forecasted for future dates. Unlike commercial environments, vehicles do not have to return to depots, because the next time the plan is re-generated, a node receiving commodities may become a depot or a former depot may have no supplies at all. As a result, there are no closed loop tours, and vehicles wait at their last stop until they receive the next order from the logistics coordination centre. Hence, dispatch orders for vehicles consist of sets of “broken” routes that are generated in response to time-dependent supply/demand. The mathematical model describes a setting that is considerably different than the conventional vehicle routing problem. In fact, the problem is a hybrid that integrates the multi-commodity network flow problem and the vehicle routing problem. In this setting, vehicles are also treated as commodities. The model is readily decomposed into two multi-commodity network flow problems, the first one being linear (for conventional commodities) and the second integer (for vehicle flows). In the solution approach, these sub-models are coupled with relaxed arc capacity constraints using Lagrangean relaxation. The convergence of the proposed algorithm is tested on small test instances as well as on an earthquake scenario of realistic size.     

基于正交试验的乘用车运输网络优化方法

在交通部治理公路超限运输的背景下,本文研究了乘用车物流企业多式联运模式下的网络优化问题,以运输网络总成本最小为目标,考虑物流时效、枢纽节点容量及规模经济效应等因素,构建了基于轴辐式理论的运输网络优化模型,提出了混合智能优化算法。针对多参数多水平的寻优问题,对模型的三个关键输入参数,即枢纽节点数量、枢纽节点容量和规模效应折扣系数,引入正交试验方法,降低求解多参数多水平寻优问题的工作量,为确定各参数合理取值提供了新的途径。研究结果表明:枢纽节点容量、折扣系数与枢纽数量三个输入参数对优化结果的影响具有主次顺序,影响程度依次减弱,而且只有枢纽节点容量与折扣系数对乘用车运输网络总效益的影响起显著作用。采用混合轴辐式的网络结构与多式联运的运输组织模式进行优化后的运输网络,相对于原有“点对点”公路运输网络总成本减少10%,从运营管理与成本控制两方面均可有效应对公路治超带来的风险。     

考虑交货期的生产运输联合优化问题研究

结合企业实际场景研究了考虑交货期的多个工厂、多条生产线、单一产品的生产与运输联合优化问题.已知客户订单需求量和交货时间窗,考虑了各条生产线在不同时段的生产能力约束,在满足交货时间窗约束的前提下,以生产、存储、运输费用之和极小化为目标建立了生产与运输联合优化问题的混合整数规划模型,通过分析模型结构证明了在不考虑固定生产成...     

Maritime crude oil transportation - A split pickup and split delivery problem

The maritime oil tanker routing and scheduling problem is known to the literature since before 1950. In the presented problem, oil tankers transport crude oil from supply points to demand locations around the globe. The objective is to find ship routes, load sizes, as well as port arrival and departure times, in a way that minimizes transportation costs. We introduce a path flow model where paths are ship routes. Continuous variables distribute the cargo between the different routes. Multiple products are transported by a heterogeneous fleet of tankers. Pickup and delivery requirements are not paired to cargos beforehand and arbitrary split of amounts is allowed. Small realistic test instances can be solved with route pre-generation for this model. The results indicate possible simplifications and stimulate further research.     

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

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

带批次和临时库存的越库配送车辆路径问题研究

从零售业供应链整合入手,构建供应商、配送中心和零售点构成的协同配送网络,研究带批次和临时库存的越库配送车辆路径问题.将越库过程分为取货、分拣和配货三个阶段,考虑配送中心分拣能力,分批次设置车辆协同到达配送中心的服务时刻,据此建立以最小化车辆运输成本、临时库存成本和固定成本为目标的数学模型.考虑问题特征,设计一种混合变邻...     

Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design

In collaborative manufacturing, the supply chain scheduling problem becomes more complex according to both multiple product demands and multiple production modes. Aiming to obtain a reasonable solution to this complexity, we analyze the characteristics of collaborative manufacturing and design some elements, including production parameters, order parameters, and network parameters. We propose four general types of collaborative manufacturing networks and then construct a supply chain scheduling model composed of the processing costs, inventory costs, and two penalty costs of the early completion costs and tardiness costs. In our model, by considering the urgency of different orders, we design a delivery time window based on the least production time and slack time. Additionally, due to the merit of continuously processing orders belonging to the same product type, we design a production cost function by using a piecewise function. To solve our model efficiently, we present a hybrid ant colony optimization (HACO) algorithm. More specifically, the Monte Carlo algorithm is incorporated into our HACO algorithm to improve the solution quality. We also design a moving window award mechanism and dynamic pheromone update strategy to improve the search efficiency and solution performance. Computational tests are conducted to evaluate the performance of the proposed method.