具有同时送货和取货特点的单车辆配送路径优化算法

在分析具有同时送货和取货特点的单车辆配送路径问题的基础上,建立OV-VRPSDP数学模型,提出一种新的求解OV-VRPSDP问题的比值法优化算法,并通过实例验证该算法的有效性和可行性。新算法首先对配送树图的顶点和边做适当处理,计算各树枝的份量,使配送车辆优先沿着份量较大的树枝前进,选择一条最优路径。实例表明,比值法能够快速解决OV-VRPSDP问题,并且具有较好的优化效果。     

区域物流中VRPTWSDP问题的混合遗传算法

研究了区域物流中带时间窗约束的具有同时集送货需求的车辆路径问题（VRPTWSDP）,给出了VRPTWSDP的混合整数规划模型,设计了求解VRPTWSDP的混合遗传算法（HybridGA,HGA）。算法以最优划分方法计算适应值,邻域搜索法作为变异算子,设计了新颖的交叉算子和群体更新策略,定义了群体多样性结构和变异概率的变化规律。对典型VRPTWSDP实例进行测试的结果表明：HGA算法能较快地获得小规模问题的最优解,并能有效地求解大规模的问题。     

面向对象的车辆路径问题仿真研究

针对车辆路径问题的复杂性和随机性,采用离散事件仿真的方法对车辆配送过程建模,并用面向对象技术实现了仿真模型。通过对象识别和层次划分,将模型分为实体建模和仿真控制建模两部分,构建了面向对象的车辆路径问题的仿真框架。这种方法克服了精确算法和智能启发式算法较难解决具有NP—hard性质的多约束车辆路径问题的弊端,实验结果验证了新方法的有效性和可行性。     

时变条件下标号法在危险货物运输路线选择中的应用

随着经济的发展,危险货物的生产量和运输量都在不断的增长。在时变网络条件下的危险货物运输过程中,运输成本和运输风险随着时间的变化而有所不同。本文建立了危险货物运输的路线选择模型并给出其合理的解决方法,该模型不仅使运输成本、运输风险达到最低,而且将运输时间对运输风险的影响纳入其中,对减少危险货物运输事故有重要的实用价值。     

禁忌搜索算法在车辆调度决策中的应用

论文探讨了交通线路可能被敌方毁坏情况下的车辆路径优化问题，建立了不确定的两阶段整数规划数学模型，分析了路径方案的最大和最小效用值。在线路方案评价值的计算中只计算最小值和最大值，简化了方案的目标值计算。设计了求解模型的双层禁忌搜索算法。最后通过应用示例验证了模型和算法的有效性。     

综合集成法在配送车辆路径优化可接受性中的应用研究

首先介绍综合集成法的提出及应用现状,然后分析综合集成研讨厅的构建,最后,将分析结果应用到大规模城市配送车辆路径优化问题中,构建了大规模城市配送车辆路径优化综合集成研讨厅,并对方案可接受性指数进行了评价.     

有时限取送混合车辆路径问题的模型及其禁忌搜索算法研究

研究了带时间窗的取送混合车辆路径问题.问题中,每个客户带有取货和送货两个时间窗,每个客户处的取货和送货任务可以通过访问一次全部完成,也可以分两次访问分别完成送货和取货任务.在对该类问题进行描述和取送一体化战略的基础上,建立了有时限取送混合车辆路径问题的数学模型.通过设计一种新的解的表示方法构造了该问题的禁忌搜索算法.实验计算结果表明,用该禁忌搜索算法求解有时限取送混合车辆路径问题,不仅可以取得很好的计算结果,而且收敛速度较快,计算结果也较稳定.     

Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads

This paper addresses the routing problem with unpaired pickup and delivery with split loads. An interesting factor of our problem is that the quantity and place for pickup and delivery are decision variables in the network. We develop an easy-to-implement heuristic in order to gain an efficient and feasible solution quickly. Then, a local search algorithm based on the variable neighborhood search (VNS) method is developed to improve the performance of the heuristic. Computational results show that the proposed VNS method is able to obtain an optimal or near optimal solution in reasonable time for the formulated problem.     

Multi-agent-based transport planning in the newspaper industry

In many cases of today's planning tasks, the synchronization of production and distribution is becoming increasingly important in order to minimize costs and to maximize customer satisfaction. This is especially the case if transport schedules are closely connected to production schedules, as it is in the newspaper industry—where perishable goods are distributed immediately after production. In order to achieve the above mentioned competing objectives, a special kind of vehicle routing problem, the vehicle routing problem with time windows and cluster-dependent tour starts (VRPTWCD), has to be solved. Moreover, the varying print and post-processing schedules due to unknown editorial deadlines lead to the need for a dynamic online control of the newspaper production and distribution process. In this contribution, the outlined dynamic transport problem is solved online under consideration of unforeseen changes in production schedules. The solution concept is based on a multi-agent system consisting of, amongst others, several Edition and Vehicle Agents. This system is exemplarily applied to a real life application case of one of the largest German newspaper companies. It is shown that a static (centralized) optimization of the underlying problem would even lead to worse results in comparison to the current situation and that the appliance of the multi-agent system is suitable in the newspaper industry.     

珠三角绿色物流的低碳与后碳路径选择

低碳路径与后碳路径的选择,是珠江三角洲地区发展绿色物流的必然之选,各级政府、各行各业、所有物流企业郜有不容推辞的应尽义务。在我国经济社会发展的“十二五”规划中,珠三角要深化与香港、澳门的经济合作,在经济结构转型和发展方式转变的关键时期,大力推进该区域绿色物流的既好又快的发展,努力建设中华民族的共同家园。