检索结果-内蒙古大学图书馆

Multi-distribution Center Inventory Demand Forecast Model In Regional Logistics Network

Multi-distribution Center Inventory Demand Forecast Model In...

2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management(2010年IEEE第17届工业工程与工程管理国际学术会议)

作者： Xi HUANG An-quan ZOU Hai-tao LI Hui XIONG Department of Business Administration Changsha UniversityChangsha 410003China Changsha Institute o Changsha Institute of Logistics Technology and Application Changsha 410003China

This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and n-retailers. We analyze the characteristics of the regional logistics network. Use the dijkstra shortest path algorithm and gain the shortest path distribution, based on which the inventory demand forecasting model which can obtain the total demand of each distribution center is established. Finally, an example is given to show that the model is correct and feasible.

关键词： regional logistics network distribution center dijkstra algorithm demand forecast

来源：评论

学校读者我要写书评

暂无评论

Multi-distribution Center Inventory Demand Forecast Model In Regional Logistics Network

Multi-distribution Center Inventory Demand Forecast Model In...

引用

第17届工业工程与工程管理国际学术会议(IE&EM2010)

作者： Xi HUANG~(1,2),Hui XIONG~2,An-quan ZOU~(1,2),Hai-tao LI~2 1.Department of Business Administration,Changsha University,Changsha 410003,China 2.Changsha Institute of Logistics Technology and Application,Changsha 410003,China

This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and *** analyze the characteristics of the regional logistics network. Use the dijkstra shortest path algorithm and gain the shortest path distribution,based on which the inventory demand forecasting model which can obtain the total demand of each distribution center is ***,an example is given to show that the model is correct and feasible.

关键词： regional logistics network distribution center dijkstra algorithm demand forecast

来源：评论

学校读者我要写书评

暂无评论

New Optimal Dynamic Route Guidance algorithm Based on dijkstra

New Optimal Dynamic Route Guidance Algorithm Based on Dijkst...

引用

2009 International Conference on Modeling, Simulation and Optimization

作者： Chongchen Xiang,Hailong Li,Dan Ma,Quan Lin,Shuopeng Wang,Yuansi Zhang School of Science China University of Mining & Technology Xuzhou 221008,China

Since the number of private cars in cities is growing increasingly and the phenomenon of traffic jams is more and more severe,how to utilize the current road network and improve the transportation efficiency more rational has become a research which highlights in today's academic world. With regard to this issue,Beijing ring road traffic system is taken as the model in this paper,what's more,a new dynamic route guidance algorithm is proposed to provide the humanized"optimal route"for the *** study builds a graph theory model of road network for Beijing ring road traffic system,and realizes the optimal route of calculation by classic dijkstra ***,based on the particularity of ring road traffic city,the study improves the calculation priority of ring road node in dijkstra algorithm. Compared with traditional dijkstra algorithm,the time complexity of this new algorithm decreases to 1/16k（k equals to the number of ring road in the road network）.In addition, when referring to control the middle and long distance of route guidance,the extra miles is less than 5%,which effectively promotes the algorithm practicability on large-scale ring road network.

关键词： Dynamic route guidance humanized route searching ring road priority algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Multistage Method for Multiobjective Route Selection

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2009年第10期E92A卷 2618-2625页

作者： Wen, Feng Gen, Mitsuo Waseda Univ Grad Sch Informat Kitakyushu Fukuoka 8080135 Japan

The multiobjective route selection problem (m-RSP) is a key research topic in the car navigation system (CNS) for ITS (Intelligent Transportation System). In this paper, we propose an interactive multistage weight-based dijkstra genetic algorithm (mwD-GA) to solve it. The purpose of the proposed approach is to create enough Pareto-optimal route's with good distribution for the car driver depending on his/her preference. At the same time, the routes can be recalculated according to the driver's preferences by the multistage framework proposed. In the solution approach proposed, the accurate route searching ability of the dijkstra algorithm and the exploration ability of the Genetic algorithm (GA) are effectively combined together for solving the m-RSP problems. Solutions provided by the proposed approach are compared with the current research to show the effectiveness and practicability of the solution approach proposed.

关键词： multiobjective route selection problem (m-RSP) multistage genetic algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

DEVELOPING CO-OPERATIVE TRANSPORT SYSTEM AND ROUTE PLANNING

引用

TRANSPORT 2009年第1期24卷 21-25页

作者： Szucs, Gabor Budapest Univ Technol & Econ Dept Telecommun & Media Informat H-1117 Budapest Hungary

This paper consists of two parts: planning Co-operative Transport Systems (CTS) with general rules (communication is a new idea in this system) and an investigation into route planning as a part of services provided in CTS. Part one reveals developing new systems for cooperative sensing and predicting flow, infrastructure and environmental conditions surrounding traffic, with a view to improve the safety and efficiency of road transport operations. Part two introduces the enhancement of the performance of the route planning algorithms. The key issues of these parts are communication and co-operation between the elements of the whole Co-operative Transport System.

关键词： eSafety intelligent transport system communication co-operation dijkstra algorithm speed-up techniques

来源：评论

学校读者我要写书评

暂无评论

A Routing Agent Using Cross-Layer Method for Collision Avoidance in Ad Hoc Networks

引用

3rd KES International Symposium on Agent and Multi-Agent Systems

作者： Liu, Zhipeng Park, Chan-Heum Lee, Bokman Kim, Chonggun Yeungnam Univ Dept Comp Engn Gyongsan Gyeongbuk South Korea

ISBN: (纸本)9783642016646

The cross-layer design approach is an important concept in ad-hoc networks which is adopted to solve several open issues. It aims to overcome MANET performance problems by allowing protocols belonging to different layers to cooperate and share network status information while still maintaining separated layers. In this work, we provide a routing agent of cross layer method which is based on the cooperation between Adjacency matrix routing protocol and the IEEE 802.11e MAC protocol. This proposal aims to avoid the congested nodes and guarantee better performance in terms of delay, packet delivery ratio, and so on. In the proposed method, each node maintains an adjacency matrix representing the network topology and MAC conditions with neighbors. The number of retransmissions in MAC layer is introduced as an indication of congestion. When the congestion occurs, the source node works as the routing agent to detect new route by checking MAC information and the adjacency matrix to the destination. The simulation results show that Cross layer give better performance than network layer only methods, especially in the frequent congestion condition.

关键词： Ad hoc networks Cross-layer design Adjacency matrix routing protocol dijkstra algorithm Quality of service

来源：评论

学校读者我要写书评

暂无评论

OpenMP Parallel Optimal Path algorithm and Its Performance Analysis

OpenMP Parallel Optimal Path Algorithm and Its Performance A...

引用

World Congress on Software Engineering

作者： Cao, Han Wang, Fei Fang, Xin Tu, Hong-lei Shi, Jun Shaanxi Normal Univ Dept Comp Sci Xian Peoples R China Beijing Normal Univ Coll Informat Tech Beijing 100875 Peoples R China

ISBN: (纸本)9780769535708

With the research and application of Intelligent Transportation System, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effective optimal path algorithms for the actual transportation networks, three optimal path algorithms are chosen to be parallelized. The parallel optimal path algorithms are then implemented based on dual-core processor and the speed-up ratio and efficiency of parallel algorithms are tested and analyzed in actual Xi'an road networks with 4525 nodes and 6616 paths. The experiment results show that the parallel algorithms devised in this paper are efficient and the speed-up ratio of the three parallel algorithms are satisfied in solving optimal path problems in large scale networks.

关键词： dijkstra algorithm A* algorithm parallel algorithm openMP multi-core

来源：评论

学校读者我要写书评

暂无评论

Vehicle Path Planning with Constraint on Turning Radius

Vehicle Path Planning with Constraint on Turning Radius

引用

2nd Internationl Conference on Intelligent Computation Technology and Automation

作者： Wang, Nengjian Zhang, Defu Liu, Qinhui Zhou, Lijie Harbin Engn Univ Coll Mech & Elect Engn Harbin Peoples R China

ISBN: (纸本)9780769538044

The shortest path based on MAKLINK graph is composed of straight line segments, and there may have not sufficient space for path smoothing when the vehicle is bounded by turning radius. Both the necessary conditions that the vehicle makes a turn safely at the vertex of swell annulus and the space constraint equation of the path nodes are considered. Transition arcs can be employed directly to wipe off the inflexions of the path, which are intersections of the line segments on the shortest path obtained by the ACS algorithm. To speed up the convergence speed and avoid falling into local optimal solution, the ACS algorithm is improved in this paper by introducing the global-distance heuristic factor, using pheromone evaporation coefficient with the function of automatic adjustment and restricting the pheromone concentration within some range. The pheromone evaporation coefficient can adjust automatically. The simulation results show that the method can find a collision-free path quickly under different conditions. The quickness and feasibility are demonstrated.

关键词： path planning ACS algorithm Turning Radius dijkstra algorithm MAKLINK graph swell annulus

来源：评论

学校读者我要写书评

暂无评论

Global Path Planning for Mobile Robot Based Genetic algorithm and Modified Simulated Annealing algorithm 09

Global Path Planning for Mobile Robot Based Genetic Algorith...

引用

World Summit on Genetic and Evolutionary Computation (GEC 09)

作者： Liang, Yuming Xu, Lihong Tongji Univ Sch Elect & Informat Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9781605583266

Global path planning for mobile robot using genetic algorithm and simulated annealing algorithm is investigated in this paper. In view of the slow convergence speed of the conventional simulated annealing algorithm, a modified simulated annealing algorithm is presented, and a hybrid algorithm based on the modified simulated annealing algorithm and genetic algorithm is proposed. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then dijkstra algorithm is utilized for finding a feasible collision-free path and fixing on the sub-search-space where the global optimal path inside,. finally the global optimal path of mobile robots is obtained based on the hybrid algorithm of modified simulated annealing algorithm and genetic algorithm. Experimental results indicate that the proposed algorithm has better performance than simulated annealing algorithm and ant system algorithm in term of both solution quality and computational time, and thus it is a viable approach to mobile robot global path planning.

关键词： dijkstra algorithm Mobile Robot Global Optimal Path Planning Genetic algorithm Modified Simulated Annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

ACO for solving a Multimodal Transport Problems using a transfer graph model

ACO for solving a Multimodal Transport Problems using a tran...

引用

International Conference on Computers and Industrial Engineering (CIE39)

作者： Hedi, Ayed Habbas, Zineb Khadraoui, Djamel Univ Paul Verlaine Metz Metz France CRP Henri Tudor Esch Sur Alzette Luxembourg

ISBN: (纸本)9781424441358

This paper proposes an algorithm based on a transfer graph model to compute a Multimodal Shortest Path (MSP) between a given source node s and a destination node d. The first step of this algorithm consists of computing a database saving a large part of necessary data to provide a response to a user itinerary request. Whe show in this paper that using Ant Colony Optimization metaheuristic (ACO) to compute this database, reduces considerably the memory space complexity comparing to the Dijskstra algorithm.

关键词： Multimodal transport transfer graph Shortest Path Problem Time dependent network problem dijkstra algorithm ACO

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：