共查询到19条相似文献,搜索用时 218 毫秒
1.
2.
<正>近两年,我国物流行业快速发展,物流运输量逐年增加,传统的物流管理模式已经无法满足当下需求,如何更好地管理物流,提升物流管理效率与质量,是需要重点思考的问题。供应链一体化背景下,物流管理企业需要主动了解供应链理念,分析物流管理的发展趋向与需求,从而做出有效调整,满足客户群体的实际需求,优化配置现有资源,实现对管理成本与效益的控制,从而提升物流管理企业的综合竞争实力。 相似文献
3.
逆向物流回收车辆调度过程中,往往出现由于需求节点位置及需求量信息的不确定性导致难以合理决策完成回收任务所需派出回收车辆的数目,此时,第三方物流逐渐被应用于回收产品的运输服务中。然而在实际的回收过程中,通常各物流需求节点的需求量较小,需要对多个物流节点的产品集中后统一进行处理;同时由于外界因素的限制,不能保证任意两个节点间均存在可行路径,需要通过中转运输的方式寻找替代路线。针对以上问题,本文提出一种基于路径可行性与仓储集货运输模式的回收车辆路径设计方案,并根据问题的特点对传统蚁群算法(ACO)中编码方式以及概率选择操作方式进行改进,提出一种逆选择操作蚁群算法(ACO-nso)。最后通过算例证明提出模型与算法的有效性。 相似文献
4.
5.
全球气候恶化危及人类生存环境,物流运输过程中产生的大量温室气体则是祸源之一。本文考虑带有碳排放约束的车辆路径问题(VRP),以车辆行驶里程最短和碳排放量最小为目标,构建了多目标的VRP非线性规划模型。提出了一种改进的蚁群系统算法对该模型进行求解,算法在更新路径上的蚂蚁信息素时引入了混沌扰动机制,此举能降低算法运行时陷入局部最优解的概率并有效提高算法的适应性。同时,对启发因子、状态转移概率、信息素更新等环节进行了优化设计,提高了最优路径的搜索效率。最后,数值仿真实验证明了该算法的求解表现优于同类研究常用的遗传算法和禁忌搜索算法,具有较强的全局寻优能力。在灵敏性和有效性的保证下,本研究所设计的改进蚁群算法能够较好地处理低碳车辆路径问题(LCVRP)。 相似文献
6.
物流企业存在开发运输货源、淡旺季,怎样提高旺季客户的满意度、有效开发淡季货源,是目前的一个运作问题。针对这一问题,本人提出了运用ABC产品分类、20/80客户分类、旺季采取措施确保客户的满意度,对业务员提成改进等措施,使物流企业在淡、旺季有利有节地开发市场,开发客户,进一步实现企业盈利。 相似文献
7.
8.
9.
本文针对包含航线网络重叠航段的双寡头竞争市场集装箱班轮运输动态定价问题,分析了即期市场客户运价敏感度与运输需求关系,探讨了在航线网络重叠航段上运价变化对货流量分配的影响,据此结合市场竞争强度因素和竞争对手的定价策略,建立了双寡头竞争市场集装箱班轮运输分时段动态定价模型,运用库恩-塔克条件,设计了模型的求解算法。算例结果显示,采取本文的动态定价策略将会使得两家双寡头船公司的收益都显著增加。研究表明:船公司之间通过组建班轮联盟加强合作,不仅可以避免价格战,而且能够减缓市场竞争强度对运价的负面影响;船公司可以根据客户运价敏感度因素对即期市场客户进行合理地分类,从而降低客户运价敏感度对集装箱运输需求的不利影响,以提高集装箱班轮运输收益。 相似文献
10.
在运输阶段,预制构件从生产工厂运送到施工工地,长距离、大体积、易损伤等因素导致其物流成本偏高,科学合理的配送方案有助于降低物流成本。本文基于运输成本、配送效率、配送时间等多维度的现场需求,建立了将运输成本作为第一目标,收货方的客户满意度作为第二目标,车队的平均实载率作为第三目标的混合车队配送模型。最后以预制构件生产工厂为算例,利用遗传算法的交叉变异过程对多目标烟花算法进行改进并对模型进行求解,从分析求解结果可以得出,该模型在有效降低了配送成本的同时,提高了客户满意度以及平均实载率,证明了模型的实用性与可行性。 相似文献
11.
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem 总被引:1,自引:1,他引:0
Jean-Charles Créput Amir Hajjam Abderrafiaa Koukam Olivier Kuhn 《Journal of Combinatorial Optimization》2012,24(4):437-458
We consider the dynamic vehicle routing problem (dynamic VRP). In this problem, new customer demands are received along the day. Hence, they must be serviced at their locations by a set of vehicles in real time. The approach to address the problem is a hybrid method which manipulates the self-organizing map (SOM) neural network into a population based evolutionary algorithm. The method, called memetic SOM, illustrates how the concept of intermediate structure, also called elastic net or adaptive mesh concept, provided by the original SOM can naturally be applied into a dynamic setting. The experiments show that the heuristic outperforms the approaches that were applied to the Kilby et al. 22 problems with up to 385 customers. It performs better with respect to solution quality than the ant colony algorithm MACS-VRPTW, a genetic algorithm, and a multi-agent oriented approach, with a computation time used roughly 100 times lesser. 相似文献
12.
《Omega》2020
This paper addresses the integration of the planning decisions concerning inbound logistics in an industrial setting (from the suppliers to the mill) and outbound logistics (from the mill to customers). The goal is to find the minimum cost routing plan, which includes the cost-effective outbound and inbound daily routes (OIRs), consisting of a sequence of deliveries of customer orders, pickup of a full truck-load at a supplier, and its delivery to the mill. This study distinguishes between three planning strategies: opportunistic backhauling planning (OBP), integrated inbound and outbound planning (IIOP) and decoupled planning (DIOP), the latter being the commonly used, particularly in the case of the wood-based panel industry under study. From the point of view of process integration, OBP can be considered as an intermediate stage from DIOP to IIOP. The problem is modelled as a Vehicle Routing Problem with Backhauls, enriched with case-specific rules for visiting the backhaul, split deliveries to customers and the use of a heterogeneous fleet. A new fix-and-optimise matheuristic is proposed for this problem, seeking to obtain good quality solutions within a reasonable computational time. The results from its application to the wood-based panel industry in Portugal show that IIOP can help to reduce total costs in about 2.7%, when compared with DIOP, due to better use of the delivery truck and a reduction of the number of dedicated inbound routes. Regarding OBP, fostering the use of OIRs does not necessarily lead to better routing plans than DIOP, as it depends upon a favourable geographical configuration of the set of customers to be visited in a day, specifically, the relative distance between a linehaul that can be visited last in a route, a neighboring backhaul, and a mill. The paper further provides valuable managerial insights on how the routing plan is impacted by the values of business-related model parameters which are set by the planner with some degree of uncertainty. Results suggest that increasing the maximum length of the route will likely have the largest impact in reducing transportation costs. Moreover, increasing the value of a reward paid for visiting a backhaul can foster the percentage of OIR in the optimal routing plan. 相似文献
13.
14.
15.
在政府政策大力支持以及社会环境意识不断增长的背景下,电动汽车在物流配送行业快速普及。电动汽车参与的物流配送服务需要物流专员、电动汽车和顾客三方协作完成。因此,在传统车辆配送路径优化的基础上,车辆的多样性、充电策略、人车的匹配以及服务时间差异化等因素都会影响物流运营成本。本文提出了考虑差异化服务成本的多车型电动汽车路径优化与充电策略问题并建立了该问题的整数规划数学模型。其次,提出了混合启发式算法MCWGATS,并通过多组算例验证了算法的有效性。最后,采用多组算例分析了多车型和差异化服务时间对运营成本的影响。实验结果表明,该模型有助于物流企业提高人员、物流车辆、服务时间等资源的利用效率,降低运营成本。 相似文献
16.
基于改进差分进化算法的VRP-SDPTW研究 总被引:1,自引:0,他引:1
整合前向物流和逆向物流,提出带时间窗的同时送货和取货的车辆路径问题(VRP-SDPTW)的混合整数规划数学模型.首次提出改进的差分进化算法(IDE)求解该问题,算法对不可行解设计惩罚机制,当基因值超过规定的范围时,设计基于整数序规范的辅助算子解决变异问题,设计一种随进化代数自动更新的交叉率.数值实验表明,改进的差分进化算法能有效地求解VRP-SDPTW. 相似文献
17.
如何在顾客下单后协调好拣选和配送环节,在最短的时间、以较低的成本将商品从货架上拣出、打包后配送到顾客手中,已成为B2C电子商务物流管理中亟待解决的问题。本文尝试以最小化订单履行时间为目标,构建非线性拣选与配送联合调度模型,以解决订单拣选顺序、拣选作业方式、车辆行驶线路等联合决策。为求解此NP难问题,设计了三阶段启发式算法:首先采用“聚类-路径优化”思想,依据顾客位置进行配送方案确认;然后采用基于相似度聚类的订单分批规则对每条配送线路的订单进行分批合并;最后调整拣选任务与配送线路顺序。通过数据实验对模型进行验证,并与传统拣选与配送分开优化的结果进行对比。结果表明,三阶段算法能够有效缩短订单完成时间、降低配送车辆等待时间、改善配送资源利用率。 相似文献
18.
In this paper we consider the period vehicle routing problem, which is the problem of designing routes for delivery vehicles to meet customer service level requirements (not all customers require delivery on every day in the period). A heuristic algorithm, based upon the daily vehicle routing algorithm of Fisher and Jaikumar, is presented and computational results are given for test problems drawn from the literature. 相似文献