共查询到20条相似文献,搜索用时 78 毫秒
1.
针对冷链物流配送的特殊性,探索冷链物流车辆路径问题(VRP)优化方案.首先,在保证货物不超载的条件下,建立基于时间和品质因素的顾客满意度约束的多配送中心VRP(MDVRP)模型;其次,采用重心分区法和改进的精英单亲遗传算法,求解顾客在配送中心的分配,确定配送车辆数以及顾客服务次序;最后,用Matlab工具编程对模型进行求解分析.结果表明构建基于满意度的冷链物流MDVRP模型更适合冷链物流配送最优路径选择,并且改进单亲遗传算法能够有效求解这类问题. 相似文献
2.
通过引入虚拟配送中心的概念,将军交VRP转化为约束性TSP,然后构建了结构完备且能较好适应LING09.0编程规则的优化模型;最后以典型案例为对象进行仿真分析,验证了模型的正确性和求解实现的可行性和高效性. 相似文献
3.
胡志华 《数学的实践与认识》2013,43(3)
应急救援的社会化、应急物资需求的多样性、应急物资需求和补给的时变性,对应急物流的配送调度提出了挑战.应急物流的紧急性要求最大程度保障受灾点的物资供应;在经济上则要求应急物流的成本最小化.通过将时间离散化为阶段序列,在应急物资需求和补给是可预测的情况下,建立一个多储备点、多物资品种、单受灾点的应急物资配送的多目标优化模型,来最小化应急物资短缺次数和运输成本.仿真实例表明,该模型可以通过优化引擎快速求解,能够发现导致短缺的应急物资品种和加强供应补给的时间区间. 相似文献
4.
基于传统模拟退火算法,通过引入记忆函数、结合GIS手段,运用SPSS聚类分析来确定初始化状态种群、多种群并行机制和新状态的产生.依据种群规模采用不同产生算法来改进算法,并将改进算法应用于城市物流中确定的多目标车辆路径优化问题,验证了算法的可行性与实用价值.此外,改进算法分别与传统模拟退火算法和GIS图解法相比较,优化效率和准确率都得到了很大的提高. 相似文献
5.
时间窗约束下的车辆路径问题多目标优化算法 总被引:1,自引:0,他引:1
讨论了带时间窗约束的车辆路径问题(VRPTW)其数学模型,分析了以遗传算法求解该类问题时的染色体表示和有关遗传操作,将VRPTw视为一个多目标优化问题,用Pareto评等技术来求解最优解,并以Solomen基准问题为例验证了该方法的有效性.结果表明:该方法与以往文献中的最好结果具有竞争性. 相似文献
6.
提出一种改进的蚁群算法优化应急物流配送车辆路径问题算法,设计了应急物流配送车辆路径问题的数学模型,并利用计算机进行了仿真实验.实验结果表明,方法能有效解决应急物流配送车辆路径问题,具有一定的理论价值和实际意义. 相似文献
7.
卢美丽 《数学的实践与认识》2012,42(22):71-78
基于城乡物流一体化的目标设定和相应基础设施平台的支持,提出连锁经营配送网络的建设模式,依据对当前连锁经营网络发展的重点工作的分析,建立了关于配送中心和农产品收购中心选择的网络优化模型.并引入算例说明模型的可行性和适用性. 相似文献
8.
9.
针对大型连锁超市物流配送成本较高的问题,通过分析连锁超市的实际情况和越库作业的实施要求,提出越库配送运作模式.以车辆运输成本、操作成本和库存持有成本最小化为目标,建立带有多越库配送中心的车辆路径模型,将配送过程分为集货、送货两阶段,同时,考虑到产品种类需求的多样化,采取集货过程车辆协同进行和送货过程车辆需求拆分的方式.针对问题的特点设计了一个求解的遗传算法,通过扫描算法优化初始种群,最后结合算例对模型和算法进行验证分析.结果表明,越库作业能有效地提高连锁超市的运作效率,降低超市物流成本. 相似文献
10.
多供应商单配送中心的库存优化模型研究 总被引:1,自引:0,他引:1
针对有容量约束的多供应商单配送中心的库存问题,通过对影响物流运作成本各因素的分析,确定各变量之间的关系;并结合企业运作实际,首先构建了混合整数非线性规划的数学模型;进而对该模型进行优化分析,提出了最优解的解决方法;最后,运用算例对该模型做进一步的分析总结. 相似文献
11.
求解车辆路径问题的免疫算法 总被引:1,自引:0,他引:1
将免疫算法用于求解车辆路径问题,并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法.实验结果表明,免疫算法能有效地应用于车辆路径问题. 相似文献
12.
Gabriel Gutiérrez-Jarpa Guy Desaulniers Gilbert Laporte Vladimir Marianov 《European Journal of Operational Research》2010
In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers. 相似文献
13.
考虑到物流公司或者配送中心车辆实际运行过程中时间的不确定性,提出了配送服务线路包含时间窗口、车辆容量约束的随机规划模型,以最小化车辆运行成本同时尽可能降低所服务顾客的不满意度.同时,又稍作改进给出了平均-风险模型,由于VRP问题是NP难的,给出了一种基于禁忌搜索的启发式算法,并以北京市13个点的为例,给出求解结果. 相似文献
14.
Siamak Noori S. Farid Ghannadpour 《Journal of Mathematical Modelling and Algorithms》2012,11(2):159-179
This paper presents an efficient hybrid metaheuristic solution for multi-depot vehicle routing with time windows (MD-VRPTW). MD-VRPTW involves the routing of a set of vehicles with limited capacity from a set of depots to a set of geographically dispersed customers with known demands and predefined time windows. The present work aims at using a hybrid metaheuristic algorithm in the class of High-Level Relay Hybrid (HRH) which works in three levels and uses an efficient genetic algorithm as the main optimization algorithm and tabu search as an improvement method. In the genetic algorithm various heuristics incorporate local exploitation in the evolutionary search. An operator deletion- retrieval strategy is executed which shows the efficiency of the inner working of the proposed method. The proposed algorithm is applied to solve the problems of the standard Cordeau??s Instances. Results show that proposed approach is quite effective, as it provides solutions that are competitive with the best known in the literature. 相似文献
15.
John Willmer Escobar Rodrigo Linfati Paolo Toth Maria G. Baldoquin 《Journal of Heuristics》2014,20(5):483-509
In this paper, we propose a hybrid Granular Tabu Search algorithm to solve the Multi-Depot Vehicle Routing Problem (MDVRP). We are given on input a set of identical vehicles (each having a capacity and a maximum duration), a set of depots, and a set of customers with deterministic demands and service times. The problem consists of determining the routes to be performed to fulfill the demand of the customers by satisfying, for each route, the associated capacity and maximum duration constraints. The objective is to minimize the sum of the traveling costs related to the performed routes. The proposed algorithm is based on a heuristic framework previously introduced by the authors for the solution of the Capacitated Location Routing Problem (CLRP). The algorithm applies a hybrid Granular Tabu Search procedure, which considers different neighborhoods and diversification strategies, to improve the initial solution obtained by a hybrid procedure. Computational experiments on benchmark instances from the literature show that the proposed algorithm is able to produce, within short computing time, several best solutions obtained by the previously published methods and new best solutions. 相似文献
16.
17.
The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part of the tour. In this paper, the TSPPD is solved by considering a metaheuris-tic algorithm based on Iterated Local Search with Variable Neighbourhood Descent and Random neighbourhood ordering. Our aim is to propose a fast, flexible and easy to code algorithm, also capable of producing high quality solutions. The results of our computational experience show that the algorithm finds or improves the best known results reported in the literature within reasonable computational time. 相似文献
18.
蚁群系统作为一种蚁群算法是解决最短路径问题的一种行之有效的方法.然而,它自身也存在着一些缺陷,主要针对基本蚁群算法易陷入局部最优这一缺陷对其进行改进,集中体现在初始信息素求解和信息素更新这两方面.为了进一步了解改进蚁群算法的优点,进行了实验仿真:将改进的蚁群算法应用子模拟医疗救护GIS中,利用GIS的网络分析功能对城市道路网络的最短路径选择算法进行了深入地探讨研究,并以山西省太原市的交通路线作为实例进行研究.计算机仿真结果表明,改进的蚁群算法在解决最短路径问题时较基本蚁群算法的性能好,它具有一定的理论参考价值和现实意义. 相似文献
19.
提出了一种带服务优先级车辆路径问题的模型(Vehicle Routing Problem with Precedence Constraints,VRPPC),和一种扫描—禁忌搜索算法(sweep-Taboo Search Algorithm,S-TSA).然后,运用S-TSA对郑煤物资供销有限公司的带有服务优先级的危险物资配送进行优化求解,并与扫描遗传算法(sweep-Genetic Algorithm,SGA),禁忌搜索算法(Taboo Search Algorithm,TSA),人工鱼群算法(Artificial Fish Algorithm,AFA)进行比较研究,研究结果显示:扫描禁忌搜索算法能在满足服务优先级的前提下,使配送费用最少. 相似文献
20.
多车场一体化集货送货车辆路径问题的混合遗传算法 总被引:1,自引:0,他引:1
为满足电子商务客户多样化和个性化的需求,建立多车场一体化装卸混合车辆调度模型。针对模型的特点,采用混合遗传算法求解。即利用模拟退火算法的Boltzmann机制,控制遗传算法的交叉、变异操作,加强染色体的局部搜索能力,提高了算法的收敛速度和搜索效率。仿真结果表明在解决大规模实际问题时,混合遗传算法在求解质量和计算效率上好于标准遗传算法。 相似文献