共查询到20条相似文献,搜索用时 359 毫秒
1.
2.
3.
The problem of designing service sectors in a road network for the organisation of route maintenance activities is addressed in this paper. The decisions involve determining the locations of a set of depots and assigning road segments to the selected depots to form service sectors. Routing operations must be taken into consideration while partitioning service sectors in order to precisely evaluate deadhead and required number of vehicles. The problem is thus formulated as a location-arc routing problem and solved by a branch-and-cut algorithm. A three-stage heuristic algorithm with sector design component is developed to solve the medium- and large-sized problems. The computational experiments demonstrate the effectiveness of the heuristic algorithm, and the superiority of the heuristic algorithm to the exact method in terms of some specific partition evaluation criteria. 相似文献
4.
With the expansion of the application scope of social computing problems,
many path problems in real life have evolved from pure path optimization problems to
social computing problems that take into account various social attributes, cultures, and
the emotional needs of customers. The actual soft time window vehicle routing problem,
speeding up the response of customer needs, improving distribution efficiency, and
reducing operating costs is the focus of current social computing problems. Therefore,
designing fast and effective algorithms to solve this problem has certain theoretical and
practical significance. In this paper, considering the time delay problem of customer
demand, the compensation problem is given, and the mathematical model of vehicle path
problem with soft time window is given. This paper proposes a hybrid tabu search (TS) &
scatter search (SS) algorithm for vehicle routing problem with soft time windows
(VRPSTW), which mainly embeds the TS dynamic tabu mechanism into the SS
algorithm framework. TS uses the scattering of SS to avoid the dependence on the quality
of the initial solution, and SS uses the climbing ability of TS improves the ability of
optimizing, so that the quality of search for the optimal solution can be significantly
improved. The hybrid algorithm is still based on the basic framework of SS. In particular,
TS is mainly used for solution improvement and combination to generate new solutions.
In the solution process, both the quality and the dispersion of the solution are considered.
A simulation experiments verify the influence of the number of vehicles and maximum
value of tabu length on solution, parameters’ control over the degree of convergence, and
the influence of the number of diverse solutions on algorithm performance. Based on the
determined parameters, simulation experiment is carried out in this paper to further prove
the algorithm feasibility and effectiveness. The results of this paper provide further ideas
for solving vehicle routing problems with time windows and improving the efficiency of
vehicle routing problems and have strong applicability. 相似文献
5.
Dynamic source routing (DSR, introduced in 1996) is one of the most frequently used routing protocols for mobile ad-hoc networks (MANETs). Numerous MANET protocols were created based on DSR's algorithm. In addition to inheriting the overall performance specifications of DSR, these MANET protocols are designed to perform optimised for specific functionality. To name a few, these functionalities include: hierarchical routing, security-aware routing and multipath routing. Such flavoured DSR schemes (X-DSR) are often compared against the original DSR protocol through simulation results. The purpose of this survey is to first introduce DSR in detail, discuss most of the DSR flavours, point out their specific features, and to present a complete survey of the analyses given in the current literature against the original DSR protocol. Following this in-depth discussion, we introduce an X-DSR-aware management architecture, which utilises a multilayer scheme that imports parameters from different layers (network, data-link and physical) and performs current network condition matching compared to the closest pre-defined network condition groups. The output of such a match is the selection of the most optimal routing protocol, which satisfies most of the criteria of the predefined condition group. 相似文献
6.
The emergence of Segment Routing (SR) provides a novel routing paradigm that uses a routing technique called source packet routing. In SR architecture, the paths that the packets choose to route on are indicated at the ingress router. Compared with shortest-path-based routing in traditional distributed routing protocols, SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress router. Despite the advantages of SR, it may be difficult to update the existing IP network to a full SR deployed network, for economical and technical reasons. Updating partial of the traditional IP network to the SR network, thus forming a hybrid SR network, is a preferable choice. For the traffic is dynamically changing in a daily time, in this paper, we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR network. WASAR algorithm can be divided into three steps: firstly, representative Traffic Matrices (TMs) and the expected TM are obtained from the historical TMs through ultra-scalable spectral clustering algorithm. Secondly, given the network topology, the initial network weight setting and the expected TM, we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning (DRL) algorithm. Thirdly, we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands, in order to improve the network performance. In the evaluation, we exploit historical TMs to test the performance of the obtained routing configuration in WASAR. The extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization (MLU) under the dynamic traffic. 相似文献
7.
Sophie N. Parragh Jean-Fran?ois Cordeau Karl F. Doerner Richard F. Hartl 《OR Spectrum》2012,34(3):593-633
This paper introduces models and algorithms for a static dial-a-ride problem arising in the transportation of patients by non-profit organizations such as the Austrian Red Cross. This problem is characterized by the presence of heterogeneous vehicles and patients. In our problem, two types of vehicles are used, each providing a different capacity for four different modes of transportation. Patients may request to be transported either seated, on a stretcher or in a wheelchair. In addition, some may require accompanying persons. The problem is to construct a minimum-cost routing plan satisfying service-related criteria, expressed in terms of time windows, as well as driver-related constraints expressed in terms of maximum route duration limits and mandatory lunch breaks. We introduce both a three-index and a set-partitioning formulation of the problem. The linear programming relaxation of the latter is solved by a column generation algorithm. We also propose a variable neighborhood search heuristic. Finally, we integrate the heuristic and the column generation approach into a collaborative framework. The column generation algorithm and the collaborative framework provide tight lower bounds on the optimal solution values for small-to-medium-sized instances. The variable neighborhood search algorithm yields high-quality solutions for realistic test instances. 相似文献
8.
R. Punithavathi Chinnarao Kurangi S. P. Balamurugan Irina V. Pustokhina Denis A. Pustokhin K. Shankar 《计算机、材料和连续体(英文)》2021,69(1):433-449
Wireless Sensor Network (WSN) comprises a massive number of arbitrarily placed sensor nodes that are linked wirelessly to monitor the physical parameters from the target region. As the nodes in WSN operate on inbuilt batteries, the energy depletion occurs after certain rounds of operation and thereby results in reduced network lifetime. To enhance energy efficiency and network longevity, clustering and routing techniques are commonly employed in WSN. This paper presents a novel black widow optimization (BWO) with improved ant colony optimization (IACO) algorithm (BWO-IACO) for cluster based routing in WSN. The proposed BWO-IACO algorithm involves BWO based clustering process to elect an optimal set of cluster heads (CHs). The BWO algorithm derives a fitness function (FF) using five input parameters like residual energy (RE), inter-cluster distance, intra-cluster distance, node degree (ND), and node centrality. In addition, IACO based routing process is involved for route selection in inter-cluster communication. The IACO algorithm incorporates the concepts of traditional ACO algorithm with krill herd algorithm (KHA). The IACO algorithm utilizes the energy factor to elect an optimal set of routes to BS in the network. The integration of BWO based clustering and IACO based routing techniques considerably helps to improve energy efficiency and network lifetime. The presented BWO-IACO algorithm has been simulated using MATLAB and the results are examined under varying aspects. A wide range of comparative analysis makes sure the betterment of the BWO-IACO algorithm over all the other compared techniques. 相似文献
9.
This article proposes a methodology for optimizing transit networks, including both route structures and headways. Given information on transit demand, transit fleet size and street network in the transit service area, the methodology seeks to minimize transfers and total user cost while maximizing service coverage. The goal is to provide an effective mathematical solution procedure with minimal reliance on heuristics to solve large-scale transit network optimization problems. This article describes the representation of the transit route network and the associated network search spaces, the representation of route network headways and the associated search spaces, the total user cost objective functions, and a stochastic global search scheme based on a combined genetic algorithm and simulated annealing search method. The methodology has been tested with published benchmark problems and applied to a large-scale realistic network optimization problem. The results show that the methodology is capable of producing improved solutions to large-scale transit network design problems. 相似文献
10.
A multi-objective freight train routing problem with fuzzy information is investigated in this article. To handle the fuzziness in the railway transportation system, the measure ?λ (i.e. the convex combination of a possibility measure and a necessity measure) is first introduced. Then, a min–max chance-constrained programming model is constructed to obtain optimal train routing plans. In order to solve the model, a potential route algorithm, fuzzy simulation and tabu search algorithm are integrated as a hybrid algorithm. Finally, some numerical experiments are performed to show the applications of the model and the algorithm. 相似文献
11.
The concept of using signs to display graphical traffic information is now becoming increasingly popular. The main objective of this study was to design and undertake laboratory research to examine whether the content of traffic information displayed on graphical route information panel (GRIP) could be readily understood. Six kinds of GRIP signs that composed of three changeable information contents (road color only, road color with journey time, and road color with traffic speed) and two different road network types (triangle and tetragon) were proposed and tested in the experiment. Results showed that GRIP with road color only had the greatest optimum route choice percentage and the fastest response time compared to the other contents. On the contrary, GRIP with traffic speed had the slowest response time and the least optimum route choice percentage. Participants took less response time and greater optimum route choice percentage for triangle road network than for tetragon road network. Further, changeable information content interacted with road network type on response time and optimum route choice percentage. The road network type had little effect on response time and optimum route choice percentage under road color only, whereas under road color with journey time and road color with traffic speed, response times increased and optimum route choice percentage decreased significantly as road network complexity increased. Considering drivers’ comprehension and response, using road color only to present traffic condition on GRIP could be an applicable solution. Road color with traffic speed presented on GRIP was not recommended. Road color with journey time can be used for a simple road network. However, it was not suggested for a complex road network. The findings of this study could assist in displaying suitable traffic information on GRIP and in improving efficient driving for motorists. 相似文献
12.
《中国工程学刊》2012,35(5):567-577
Research on message routing in large-scale mesh multiprocessors usually focuses on routing in light traffic. Studies employ simple routing methods that are not load-balanced but do not need route initiation before message transmission. In non-light and/or non-uniform input traffic situations, maximum bandwidth utilization and average latency of such routing methods can be poor due to congestion caused by unbalanced load in global mesh regions. Existing load-balanced routing methods applied in mobile ad hoc mesh networks require route initiation before message transmission, which is not acceptable in mesh multiprocessors. In this research, we designed a load-balanced hierarchical mesh-routing method without route initiation. We organize a large-scale mesh into a virtually structured hierarchical mesh structure. Global mesh routing can thus be transformed into a number of load-balanced routing subtasks at levels of hierarchical submesh regions. In such a structure, we designed periodical hierarchical traffic state polling and distribution with very low overhead. We developed two congestion-avoidance routing methods for load-balanced routing at levels of submesh regions with polled traffic states. Experimental results show that maximum bandwidth utilization and average latency in non-light and/or non-uniform input traffic situations can be improved significantly in comparison with ordinary mesh multiprocessor routing methods. 相似文献
13.
基于混合粒子群算法的物流配送路径优化问题研究 总被引:7,自引:3,他引:4
针对物流配送路径优化问题,提出了一种融合Powell局部寻优算法和模拟退火算法的混合粒子群算法,以克服单用粒子群算法求解问题早熟收敛的不足,增加算法的开发能力,提高算法的全局搜索能力,并进行了实验计算.计算结果表明,用混合粒子群算法求解物流配送路径优化问题,可以在一定程度上提高粒子群算法在局部搜索能力和搜索全局最优解概率,从而得到质量较高的解. 相似文献
14.
Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan 《计算机、材料和连续体(英文)》2022,72(3):4525-4540
Network failures are unavoidable and occur frequently. When the network fails, intra-domain routing protocols deploying on the Internet need to undergo a long convergence process. During this period, a large number of messages are discarded, which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers (ISP). Therefore, improving the availability of intra-domain routing is a trending research question to be solved. Industry usually employs routing protection algorithms to improve intra-domain routing availability. However, existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures, which increases the cost of the network and impedes the methods deployed in practice. To address the issues, this study proposes an efficient routing protection algorithm based on optimized network topology (ERPBONT). ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes. Firstly, the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem. Then the simulated annealing algorithm ERPBONT is used to find the optimal solution. Finally, the algorithm is tested on the simulated topology and the real topology. The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path, and significantly improves the routing availability. 相似文献
15.
This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances. 相似文献
16.
目的 在传统冷链物流的车辆路径问题模型基础上,考虑服务节点和车辆运输过程中产生的碳排放,并加入客户满意度,在有限资源情况下最小化路径成本和最大化客户满意度。方法 构建多目标低碳冷链物流车辆路径问题模型,将爬山算法局部搜索思想应用到麻雀搜索算法中,形成改进麻雀搜索算法,并用其对上海市某区域内的冷链物流配送路径优化问题算例进行求解。结果 通过与改进前及其他2种智能优化算法运行结果进行对比发现,改进后的麻雀搜索算法具有更快的寻优速度和更好的寻优能力,且改进后的算法对模型的碳排放效用性更高。结论 基于国家的低碳政策,设计出符合当下实情的低碳冷链物流运输模型,通过改进优化算法设计运输方案,验证了爬山算法局部搜索思想对麻雀搜索算法进行改进的有效性及所构建低碳冷链物流车辆路径模型的合理性。 相似文献
17.
The q-mode problem is a combinatorial optimization problem that arises in the context of partitioning a given collection of data vectors with categorical attributes. A neighborhood search algorithm is proposed for solving the q-mode problem. This algorithm is based on a very large scale neighborhood that is implicitly searched using network flow techniques. The algorithm is evaluated through a computational experiment using randomly generated instances. The results show that in general this algorithm obtains very-good-quality local optima, and that in instances with strong natural clusters the algorithm consistently finds optimal or near-optimal solutions. 相似文献
18.
This paper proposes a tabu search (TS) algorithm to solve an NP-hard cyclic robotic scheduling problem. The objective is to find a cyclic robot schedule that maximises the throughput. We first formulate the problem as a linear program, provided that the robot move sequence is given, and reduce the problem to searching for an optimal robot move sequence. We find that the solution space can be divided into some specific subspaces by the maximal number of works-in-process. Then, we propose a TS algorithm to synchronously perform local searches in each subspace. To speed up our algorithm, dominated subspaces are eliminated by lower and upper bounds of the cycle time during the iterations. In the TS, a constructive heuristic is developed to generate initial solutions for each subspace and a repairing procedure is proposed to maintain the feasibility of the solutions generated in the initialisation stage and the neighbours search process. Computational comparison both on benchmark instances and randomly generated instances indicates that our algorithm is efficient for the cyclic robotic scheduling problem. 相似文献
19.
Eric Rosenberg 《Optimization and Engineering》2010,11(2):277-302
We study the complexity of computing a route in a hierarchical PNNI network, with H levels of hierarchy, in which N nodes are grouped into clusters at each level. We determine cluster sizes that minimize an upper bound on the total time
for all the path computations required to compute a route. Our model casts the problem as a nonlinear convex optimization
problem, and employs nonlinear duality theory. We derive explicit closed form upper bounds on the minimum total path computation
time, as a function of N, for H=2 and H=3, and show how the upper bound, and the optimal cluster sizes, can be computed for any H. We provide a conjecture on the complexity of PNNI routing for any H, and use this conjecture to determine the limit of the complexity as H→∞. We also prove that the minimum total path computation time is a non-increasing function of H. Our results provide counterexamples to a claim by Van Mieghem that a related top-down hierarchical routing method has lower
computational complexity. 相似文献
20.
Safety and efficiency are commonly regarded as two significant performance indicators of transportation systems. In practice, road network planning has focused on road capacity and transport efficiency whereas the safety level of a road network has received little attention in the planning stage. This study develops a Bayesian hierarchical joint model for road network safety evaluation to help planners take traffic safety into account when planning a road network. The proposed model establishes relationships between road network risk and micro-level variables related to road entities and traffic volume, as well as socioeconomic, trip generation and network density variables at macro level which are generally used for long term transportation plans. In addition, network spatial correlation between intersections and their connected road segments is also considered in the model.A road network is elaborately selected in order to compare the proposed hierarchical joint model with a previous joint model and a negative binomial model. According to the results of the model comparison, the hierarchical joint model outperforms the joint model and negative binomial model in terms of the goodness-of-fit and predictive performance, which indicates the reasonableness of considering the hierarchical data structure in crash prediction and analysis. Moreover, both random effects at the TAZ level and the spatial correlation between intersections and their adjacent segments are found to be significant, supporting the employment of the hierarchical joint model as an alternative in road-network-level safety modeling as well. 相似文献