transportation algorithm 中文意思是什麼

transportation algorithm 解釋
運輸演算法
  • transportation : n. 運輸，輸送；轉運，搬運；遷移；〈美國〉運輸機關；運輸工具；運輸票；運費；【歷史】流放。adj. -al
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce. it can increase logistic economic benefit and realize logistic rationalization. the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism, the establishment of modem chain of command, the development of its and ec. now, the problem is not only applied to the field of auto transportation, but also to ship avigation communication electricity industry management computer application etc. the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company

    對貨運車輛進行調度優化，可以提高物流經濟效益、實現物流科學化。對貨運車輛調度優化理論與方法進行系統研究是物流集約化發展、建立現代調度指揮系統、發展智能交通運輸系統和開展電子商務的基礎。目前，問題的形式已有很大發展，該問題以不僅僅局限於汽車運輸領域，在水運、航空、通訊、電力、工業管理、計算機應用等領域也有一定的應用，其演算法已用於航空乘務員輪班安排、輪船公司運送貨物經過港口與貨物安排的優化設計、交通車線路安排、生產系統中的計劃與控制等多種組合優化問題。
  2. Besides, of the several algorithms those have been proposed in the literature for solving the transportation problem, previous computational results indicated that the primal algorithm ( modi method ) is more efficient, so we have compared the amedv versus the modi method. because very little experimentation was carried out on algorithmic techniques used in the codes of amedv, we have also performed a number of runs that test the overall solution time as the number of significant digits in each of the parameters is varied

    因為元素判別值分配法是運輸問題引發出的求解新方法，並且階石法是目前解運輸問題的較快速解法，所以特別針對運輸問題通過若干組有代表性的檢驗數據進行數值測試，在實際問題中對比元素判別值分配法與階石法的演算法執行時間，研究兩對演算法執行效率上的差別，並分析差別產生的原因。
  3. In order to calculate difficult transportation cost between plants and distribution centers in the fitness value function, flow prediction algorithm was presented to find an minimum - cost flow patterns on an network composed of plants, consolidation centers and distribution centers with concave transportation costs and to obtain the appropriate fitness value

    為了解決適應度函數中的工廠與分銷中心之間的運輸成本計算困難的問題，提出了流預測演算法，用於確定產品在工廠、集貨中心和分銷中心構成的凹費用流網路中的最優運輸路徑，進而獲得適應度函數值。
  4. However, according to ann ' s theory, making use of visual basic development tool, friendly - interface single output three layers " artificial neural network generator base on improved bp algorithm has been developed by the author, and after constructing the model, the value of d _ ( cmax ), finally the gross bed - load transport rate of non - uniform sediment with a wide distribution in flume experiment of stead sediment transportation have been forecasted

    筆者採用的途徑則是根據人工神經網路理論，利用vb開發出界面友好、基於改進bp演算法的多輸入單輸出三層神經網路生成器軟體，並採用該生成器建模，對平衡輸沙狀態下的水槽輸沙試驗的d _ （ cmax ）和總輸沙率進行預測計算。
  5. On the basis of analysis of factors impacting on earthwork allocation and transportation, a new kind of earthwork allocation and transportation method based on ant algorithm ( aa ) and particle swarm optimizer ( pso ) is presented in this paper, and it has the advantages of being able to consider nonlinear restrictions and uncertain factors

    摘要本文分析了水利工程中土石方調運的影響因素及其特點，提出了一種基於螞蟻演算法和粒子群演算法的土石方調運優化方法。
  6. In this paper, in the connection with optimizing of mine transportation vechile scheduling some theories, methods and models are researched in the instructor of system engineering, especially the vechile scheduling aiid genetic algorithm theory

    本文在系統工程特別是車輛調度和遺傳演算法的基礎理論指導下，針對礦山運輸車輛的調度優化問題，進行了一些理論、方法與模型的研究工作。
  7. In this paper, genetic programming is applied to optimize the mine transportation vehicles scheduling, which realized automation and intelligence in mine transportation vehicles scheduling. application program is also developed to optimize mine transportation vechiles scheduling, and the probability character of genetic algorithm is also analysed and researched

    本文將遺傳規劃應用於礦山運輸車輛優化調度之中，實現了礦山運輸車輛調度的智能化和自動化，對遺傳演算法的概率特性進行了分析研究，並研製了礦山運輸車輛調度優化的應用程序。
  8. Finally, jinduicheng mo. company open - pit is quoted as an instance for building mine transportation vechile scheduling system model, and according to the model, adopt genetic algorithm to study the optimization of mine transportation vechile scheduling system. a rational project is given to this problem, the paper also analysized the optimial design of mine transortation vechile scheduling, the model offering in this paper, convergence of optimal algorithm and data bank management, and transportation project of minerals and disposals is optimized, which realize the decision of transportation project and data visibilization, and wich improves the science and information process of transportation department management

    最後，論文以金堆城鉬業公司露天礦為例建立礦山運輸車輛優化調度模型，結合所建立的礦山車輛優化調度模型，採用遺傳演算法對礦山運輸車輛系統進行優化研究，為其提供合理的體系方案。並對礦山車輛優化調度系統設計進行了詳細分析，提出的礦山車輛優化調度系統，集優化演算法與數據庫管理分析於一體，進行礦巖運輸方案的優化，實現調度方案決策的可視化、運行數據的可視化，促進運輸部門管理的科學化、信息化進程。
  9. By this algorithm, the optimal solution can been obtained in transportation problem n assignment problem, traveling salesman problenu flow shop sequencing problems hamilton problem. in addition, numerical examples have been given to demonstrate the actual applicant procedure

    並且通過對排序問題、貨郎擔貨問題、指派問題、 hamilton問題等線形規劃問題典型算例的求解，表明新的分配原則在一定程度上簡化了原有的分配過程，具有更強的通用性。
  10. The article reviews four kinds of optimization algorithm for transportation problem of open - pit, and presented the range of applications and defects of these algorithm each and puts forward some views such as establishing type storehouse of open - pit trans portation problems for rational rational of optimization algorithm of open - pit transportation problem

    摘要綜述了四種露天礦運輸優化問題的方法，給出了它們各自的適用范圍和不足之處，並提出了合理解決露天礦運輸優化問題的建議，如建設露天礦運輸問題庫等。
  11. An algorithm for solving the problem of maximum flow in the transportation network

    求解網路最大流問題的一個演算法
  12. The application study of improved bp algorithm in sediment science - using two set of experiment data mentioned above, the value of d _ ( cmax ) and gross bed - load transport rate in non - uniform sediment with a wide distribution in flume experiment of stead sediment transportation have been forecasted by ann generator

    改進bp演算法在泥沙科學中的應用研究?將收集整理后的兩次水槽試驗實測資料作為數據來源，利用生成器生成網路對水槽平衡輸沙試驗中的最大起動粒徑和總輸沙率進行預測。
  13. ( 5 ) user management system is built by asp technology on the server - side. user ' s register and logging is accepted and the user permission for different group is designed ( program files referred to appendix 1 ) ; the connection between web server and plastic die material database system realized by ado, odbc technology, which will guarantee the mutual information transportation between the database system and different terminals ; ( 6 ) further study of expert system is discussed and the implementing reasoning base on plastics mould material selection neural networks is put forward and key problems is also discussed. according to the requirements of sustainability, extended knowledge frame of mould selection and track algorithm meeting the requirements of dynamics, history, structuralism, illegibility, unintegrity and uncertainty are verified and corresponding examples are also put forward

    （ 3 ）通過ado 、 odbc技術實現web服務器與塑料模具材料數據庫系統的連接，從而保證了塑料模具材料數據庫系統和各終端之間信息的雙向傳遞； （ 4 ）在服務器端利用asp技術建立塑料模具材料遠程選擇優化專家系統交互界面，通過標準數據庫查詢語言，客戶能對數據庫中的塑料模具材料信息進行查詢（程序文件列表參見附錄1 ） ；廣東丁業人學1學m學位淪義門）在服務器端利用sp技術建立用戶管理系統，接受用戶的注冊、登錄消求，為不同等級的用戶設定相應的權限（程序文件列表參見附錄1 ） ； （ 6 ）討論了進一步完善該專家系統所需做的工作，提出塑料模具選材神經網路批理的實現方案，並對其中的關鍵問題進行了討論：按照可持續發展的要求，對擴展的模具選材知識框架、滿足動忐性、歷史性、結構性、模糊性、個大根性、不硯定性等需求的跟蹤演算法進行了論證並給出計算示例。
  14. The thesis got the advantage of the octree algorithm to make a common indexing system of the air transportation information resources

    本文採用octree演算法對于空中交通管理信息資源和其他空中交通信息建立了數據庫數據模型。
  15. Afterwards, in the second phase, based on the inventory supplement plan in the first phase, this paper transforms the sub - problem in this phase into vehicle routing problem with time window constrains through the theories and methods of vrp, and solves this problem by way of genetic algorithm, to make a final complete inventory supplement and transportation plan

    然後，在第二階段借用車輛路線安排問題（ vrp ）的理論和方法，以第一階段的庫存補充計劃為基礎，將第二階段的子問題規劃成有時間窗約束的車輛路線安排問題，利用混合遺傳演算法求解該問題，從而最終形成完西南交通大學碩士研究生學位論文第11頁一整的庫存補充和運輸計劃。
  16. When the interaction of links is asymmetric, the equivalent model is difficult to present, so the paper changes the algorithm, and applies the new algorithm in the urban transportation plan of dan dong

    同時考慮基於交叉口的平衡問題，提出了改進的演算法，並結合丹東市交通網路進行了計算，與不考慮交叉口的演算法進行了數值比較。
  17. Now we shall list our contribution to the transportation problem : ( 1 ) expected value goal programming, chance - constrained goal programming model and dependent - chanced goal programming model of random transportation are constructed ; ( 2 ) expected value goal programming, chance - constrained goal programming model and dependent - chanced goal programming model of fuzzy transportation are constructed ; ( 3 ) expected value goal programming, chance constrained goal programming model and dependent - chance goal programming model of rough transportation problem are constructed ; ( 4 ) enlightened by liu ’ s thought that solve the uncertain programming with hybrid intelligent algorithm, we design a hybrid intelligent algorithm, that is, genetic algorithms based on simulation to achieve the approximate best solution of the nine above mentioned models

    得到如下主要結果: （ 1 ）建立了隨機運輸問題目標規劃的期望值模型、機會約束規劃模型、相關機會規劃模型; （ 2 ）建立了模糊運輸問題目標規劃的期望值模型、機會約束規劃模型、相關機會規劃模型; （ 3 ）建立了粗糙運輸問題目標規劃的期望值模型、機會約束規劃模型、相關機會規劃模型; （ 4 ）受liu等人提出的用混合智能演算法求解不確定規劃的思想的啟發，結合運輸模型的特殊結構，設計了一種基於模擬的、求解不確定性運輸問題的遺傳演算法。
  18. Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years. others are heuristic methods like genetic algorithm

    近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。
  19. Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries. up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication, we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system

    三維布局問題屬于組合最優化問題和np完全問題，具有高度復雜性，用一般的數學方法根本無法求解，目前解決三維布局問題多為各種啟發式方法，本文在對啟發式方法進行深入探討的基礎上，採用了用於解決一般三維布局問題的模擬退火演算法作為布局系統的操作演算法。
  20. New algorithm for the transportation problem

    求解運輸問題的一種新演算法
分享友人
分享到 Line

分享到臉書