【摘要】：作為一種新型的農(nóng)機(jī)社會(huì)化服務(wù)模式,聯(lián)合收割機(jī)跨區(qū)作業(yè)解決了我國農(nóng)戶小規(guī)模經(jīng)營和大生產(chǎn)之間的矛盾,提高了農(nóng)機(jī)資源的利用率,已成為中國特色農(nóng)業(yè)機(jī)械化發(fā)展道路的有益探索和成功實(shí)踐。隨著作業(yè)范圍的逐漸擴(kuò)大和聯(lián)合收割機(jī)數(shù)量的增加,聯(lián)合收割機(jī)跨區(qū)作業(yè)市場出現(xiàn)激烈的競爭,而聯(lián)合收割機(jī)機(jī)具資源調(diào)度問題日漸成為影響跨區(qū)作業(yè)經(jīng)濟(jì)效益的主要因素之一。本文以引導(dǎo)聯(lián)合收割機(jī)資源合理配置,根據(jù)農(nóng)場及農(nóng)村的具體情況,資源整合為導(dǎo)向,對當(dāng)前主要的聯(lián)合收割機(jī)跨區(qū)作業(yè)模式進(jìn)行分析,建立了切合實(shí)際的聯(lián)合收割機(jī)跨區(qū)作業(yè)調(diào)度模型,并進(jìn)行優(yōu)化仿真獲得最佳調(diào)度決策方案。主要研究內(nèi)容如下:(1)針對當(dāng)前主要的三種聯(lián)合收割機(jī)跨區(qū)作業(yè)模式進(jìn)行分析,確定出典型的聯(lián)合收割機(jī)跨區(qū)作業(yè)模式:以農(nóng)機(jī)合作社為代表的面向訂單的機(jī)收服務(wù)作業(yè)模式。在此基礎(chǔ)上,對該作業(yè)模式中聯(lián)合收割機(jī)資源調(diào)度方式及存在的問題進(jìn)行分析。(2)針對典型的跨區(qū)作業(yè)模式,本文分析了影響聯(lián)合收割機(jī)跨區(qū)調(diào)度的關(guān)鍵因素,在考慮多農(nóng)機(jī)點(diǎn)、多機(jī)型、作業(yè)時(shí)間窗、空間距離等因素的前提下,以高收入低成本,準(zhǔn)時(shí)化為主要調(diào)度目標(biāo),綜合考慮調(diào)配路程、機(jī)械效率、等待時(shí)間等指標(biāo),應(yīng)用路徑優(yōu)化及車間作業(yè)調(diào)度理論,最終構(gòu)建適用于聯(lián)合收割機(jī)跨區(qū)作業(yè)調(diào)度的多目標(biāo)規(guī)劃數(shù)學(xué)模型。(3)考慮到聯(lián)合收割機(jī)跨區(qū)作業(yè)調(diào)度問題是多目標(biāo)規(guī)劃和NP-hard難問題,本文選擇帶精英策略的非支配排序遺傳算法(NSGA-Ⅱ)將其應(yīng)用于聯(lián)合收割機(jī)跨區(qū)調(diào)度模型的求解。此外。針對模型特點(diǎn),對算法進(jìn)行設(shè)計(jì)和改進(jìn),包括染色體編碼、初始種群產(chǎn)生、選擇、交叉、變異過程,并通過MATLAB編程實(shí)現(xiàn)。(4)本文結(jié)合黑龍江省五常市水稻收獲作業(yè)的實(shí)際情況,將上述調(diào)度理論進(jìn)行應(yīng)用研究,并對具體的實(shí)驗(yàn)結(jié)果進(jìn)行分析,驗(yàn)證調(diào)度模型及求解算法的有效性和可行性。本文的研究成果可為跨區(qū)作業(yè)管理者或者機(jī)手提供有效的決策,解決了跨區(qū)作業(yè)中農(nóng)機(jī)資源調(diào)配的技術(shù)問題,還為跨區(qū)作業(yè)下一階段發(fā)展獲得最佳的經(jīng)濟(jì)效益和社會(huì)效益提供理論依據(jù),對我國農(nóng)業(yè)規(guī)�；l(fā)展、農(nóng)機(jī)社會(huì)化服務(wù)有長遠(yuǎn)影響,具有重要的研究意義和重大的現(xiàn)實(shí)應(yīng)用價(jià)值。
[Abstract]:As a new type of socialized service mode of agricultural machinery, the cross area operation of combine harvester resolves the contradiction between small-scale management and large-scale production of farmers in our country, and improves the utilization rate of agricultural machinery resources. It has become the beneficial exploration and successful practice of developing agricultural mechanization with Chinese characteristics. With the gradual expansion of the scope of work and the increase in the number of combine harvesters, there is fierce competition in the cross-area operation market of combine harvesters. The resource scheduling problem of combine harvester has become one of the main factors that affect the economic benefit of cross-area operation. In order to guide the rational allocation of the combine harvester resources, according to the specific conditions of the farm and the countryside, and the resource integration as the guide, this paper analyzes the main cross-area operation mode of the combine harvester. In this paper, a practical cross-area job scheduling model of combine harvester is established, and the optimal scheduling decision scheme is obtained by optimizing simulation. The main research contents are as follows: (1) the analysis of the three main cross-area operation modes of combine harvester is carried out. The typical cross-area operation mode of combine harvester is determined: the order-oriented service mode represented by agricultural machinery cooperative. On this basis, the resource scheduling mode of combine harvester and its existing problems are analyzed. (2) aiming at the typical cross-area operation mode, this paper analyzes the key factors that affect the cross-area scheduling of combine harvester. On the premise of considering many agricultural machinery points, multiple models, operating time windows, space distance and so on, with high income and low cost, punctual as the main dispatching target, comprehensive consideration is given to the allocation of distance, mechanical efficiency, waiting time and other indicators. Applying path optimization and job shop scheduling theory, Finally, a multi-objective programming mathematical model suitable for cross-area job scheduling of combine harvester is constructed. (3) considering that the problem of cross-area job scheduling of combine harvester is multi-objective programming and NP-hard difficult problem, In this paper, the non-dominated sorting genetic algorithm (NSGA- 鈪，

本文編號：2388015