排序方式: 共有8条查询结果,搜索用时 15 毫秒
1
1.
《Omega》2015
This paper investigates the waste collection problem and characterizes the problem as a set-covering and vehicle routing problem (VRP) complicated by inter-arrival time constraints. The study proposes a bi-level optimization formulation to model the split delivery VRP with multiple trips to determine the minimum-distance route. The first stage optimally plans the collection points that cover all residential blocks. The second stage applies a heuristics method to solve the minimum vehicles used and minimum distance traveled for collecting residential waste. This research contributes to model this period VRP and to introduce the heuristics method to solve the problem efficiently. The study is important in laying the groundwork for understanding the possibility of improving the service level of municipal solid waste collection. 相似文献
2.
3.
求解带时间窗的装-卸载问题的概率式禁忌搜索算法 总被引:3,自引:1,他引:3
本文介绍一个求解有时间窗的装载—卸载问题的概率式禁忌搜索算法。论文首先回顾了求解VRP、PDP问题的主要方法,介绍了搜索算法的基本概念,给出了基于概率式禁忌搜索的详细算法。初步实验表明新算法优于传统禁忌搜索算法。 相似文献
4.
In past disasters, arrangements have been made to evacuate people without their own transportation, requiring them to gather at select locations to be evacuated. Unfortunately, this type of plan does not help those people who are unable to move themselves to the designated meeting locations. In the United States, according to the Post‐Katrina Emergency Management Reform Act of 2006, state or local governments have the responsibility to coordinate evacuation plans for all populations. These include those with disabilities. However, few, if any, have plans in place for those who are mobility‐challenged. The problem of evacuating mobility‐challenged people from their individual locations in a short‐notice disaster is a challenging combinatorial optimization problem. In order to develop the model and select a solution approach, we surveyed related literature. Based on our review, we formulate the problem and develop an Ant Colony Optimization (ACO) algorithm to solve it. We then test two different versions of the ACO algorithm on five stylized datasets with several different parameter settings. 相似文献
5.
现实中,由于配送中心选址对占地面积、土地成本等要求较高,加之物流企业资金有限或交通拥堵等限制,配送中心的设置通常会远离市中心。为了减少集货与配送车辆往返配送中心的次数以及车辆行驶距离,本文以总成本最小化,包括车辆派遣成本、行驶成本、碳排放成本、违背时间窗的惩罚成本、保温柜/箱成本、非整箱货物的配送成本,构建了1个配送中心由大型车辆为m个供应商采用蓄冷柜/蓄冷箱集货,由1个虚拟接驳点(中型车辆)结合小型车辆为n个零售门店采用蓄冷箱多温共配的路径优化模型,并设计了基于蚁群算法的混合更新信息素策略。以20个零售门店与6个海鲜供应商的三种品温海鲜品为仿真算例,验证了模型的有效性。实例分析发现:引入虚拟接驳点的配送线路数低于单纯的配送线路数;时间窗限制越宽松,引入虚拟接驳点的优越性越突出;具有虚拟接驳点的多温集配总成本低于自配送中心的集配总成本;具有虚拟接驳点的蓄冷式多温集配尤其利于低碳环保的冷链系统构建。 相似文献
6.
在经典VRP的基础上,结合实际背景提出一种缺货情况下的车辆路径问题,并给出基于蚂蚁系统寻优思想的求解方法。经大量数据测试,获得了较好的结果。 相似文献
7.
8.
考虑一个分销中心、多个零售商组成的分销网络系统中具有柔性车辆能力的带货物权重的车辆路径问题.并根据车辆的满载情况采用了不同的运输策略,即单点运输和多点运输方式.在多点运输方式下,与以往诸多研究不同的是,文章建立了一种基于货物权重的VRP模型——WVRP,即在安排车辆线路时每个零售商的货物需求量也作为一个因素考虑,尽可能使车辆优先供货需求量较大的零售商.最后,针对问题的性质,开发了一种基于划分的遗传算法PB-GA对问题进行求解,并与一般遗传算法及常用的启发式算法进行了分析比较. 相似文献
1