基于Memetic算法的多車型CARP問題優(yōu)化研究
[Abstract]:The limited-arc routing problem (CARP) has a wide application in real life. It is of great significance to alleviate the energy crisis, improve the production efficiency and create an economical society. However, many practical problems can not be solved by the basic CARP model, so the extended CARP model, which is formed by adding the constraint conditions, is more and more important to people. There are many extended CARP models, such as the multi-center CARP model, the multi-model CARP model, the multi-cycle CARP model, the CARP model and so on. The research on the basic limit arc routing problem model is becoming more and more mature, but the research results related to the extension of the CARP model are not much. This paper makes an in-depth study of the multi-model CARP model in the common extended CARP model. A valid Memetic algorithm MAEVSGR is proposed for the multi-model CARP model (HVCARP). First, the route cost of the multi-model CARP model (HVCARP) is divided into the variable cost and the fixed cost, and the relationship between the vehicle model and the route is closely connected through the vehicle penalty coefficient, and the specific multi-model CARP cost calculation formula is formed. In view of the characteristics of the multi-model CARP, this paper presents a vehicle operator with the same gear path for the model, which is based on the path load and the vehicle fleet, and the service model is adjusted so as to realize the optimization of the service cost; and then it is a local search operator. In this paper, a Memetic algorithm for solving the multi-model CARP is designed, and the experimental verification is carried out with the modified example of the CARP standard test set. In order not to determine the CARP model, the definition method of the CARP model is described in this paper. Several common uncertain evaluation criteria are then presented. Finally, a multi-model CARP model is proposed in combination with the multi-model CARP model.
【學(xué)位授予單位】:安慶師范大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號】:U491
【參考文獻】
相關(guān)期刊論文 前10條
1 劉天堂;江志斌;耿娜;劉冉;劉樹軍;;帶有異質(zhì)固定車隊的能力約束弧路徑問題[J];上海交通大學(xué)學(xué)報;2012年11期
2 金倩倩;林丹;;求解UCARPP問題的變鄰域搜索算法[J];計算機工程;2012年21期
3 段淵;向毅;;不同遺傳算子組合求解TSP問題的比較研究[J];科技通報;2012年05期
4 胡珊;林丹;;求解CARP-RP-ML問題的改進算法[J];計算機工程;2012年07期
5 徐凱;朱征宇;;改進遺傳算法對帶服務(wù)時間約束的弧路徑問題的求解[J];微處理機;2010年05期
6 金毅;;對“中國郵遞員問題”的數(shù)理分析[J];科技經(jīng)濟市場;2009年03期
7 朱征宇;楊永;鄧欣;謝志華;夏夢霜;李小花;;一種求解多車型CARP問題的高效進化算法[J];計算機工程與應(yīng)用;2008年08期
8 孫海雷;劉瓊蓀;胡上尉;;TSP問題的順序插入交叉算子[J];計算機工程與應(yīng)用;2007年08期
9 李念祖;;關(guān)于中國郵遞員問題的最優(yōu)完全子圖算法[J];上海師范大學(xué)學(xué)報(自然科學(xué)版);2006年04期
10 魏平,李利杰,熊偉清;求解TSP問題的一種混合遺傳算法[J];計算機工程與應(yīng)用;2005年12期
相關(guān)博士學(xué)位論文 前1條
1 梅一;基于元啟發(fā)式方法對限量弧路由問題的求解[D];中國科學(xué)技術(shù)大學(xué);2010年
,本文編號:2484002
本文鏈接:http://sikaile.net/kejilunwen/daoluqiaoliang/2484002.html