Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA

Yuxi Shen*, Tomohiro Murata

*この研究の対応する著者

研究成果

2 被引用数 (Scopus)

抄録

This study considers the application of a genetic algorithm (GA) to the basic vehide routing problem with tow-dimensional loading constraints (2L-CVRP). Vehicle routing problem encompasses a whole class of complex optimization problems that target the derivation of minimum total cost routes for a number of resources (vehicles, etc.) located at a central depot in order to service efficiently a number of demand customers. Several practical issues in the industry involving both production and transportation decisions are modeled as VRP instances and the hard combinatorial problems in the strong sense (NP-hard). 2L-CVRP is a generalization of the Capacitated Vehicle Routing Problem, in which customer demand is formed by a set of rectangular, weighted items. In this paper, computational results are given for the pure GA which is put forward. As compare with the mathematic method, we can find the advantage of using GA to solve the problem especially in large sizeproblems.

本文言語English
ホスト出版物のタイトルInternational MultiConference of Engineers and Computer Scientists, IMECS 2012
出版社Newswood Limited
ページ1532-1537
ページ数6
ISBN(印刷版)9789881925190
出版ステータスPublished - 2012 1 1
イベント2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 - Kowloon, Hong Kong
継続期間: 2012 3 142012 3 16

出版物シリーズ

名前Lecture Notes in Engineering and Computer Science
2196
ISSN(印刷版)2078-0958

Other

Other2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012
国/地域Hong Kong
CityKowloon
Period12/3/1412/3/16

ASJC Scopus subject areas

  • コンピュータ サイエンス(その他)

フィンガープリント

「Pick-up scheduling of two-dimensional loading in vehicle routing problem by using GA」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル