Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks
The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve...
Gespeichert in:
| Veröffentlicht in: | Applied Mechanics and Materials 2014-12, Vol.701-702 (Industrial Engineering, Computation and Information Technologies), p.44-49 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 49 |
|---|---|
| container_issue | Industrial Engineering, Computation and Information Technologies |
| container_start_page | 44 |
| container_title | Applied Mechanics and Materials |
| container_volume | 701-702 |
| creator | Tian, Gui Long Li, Xian Ma, Yu Hong |
| description | The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve while going” in the shortest path is integrated to use in course of decoding. A genetic scheme is designed to solve the capacitated Chinese postman problem without translating arc routing problem into node routing problem. The simulation experiments show that the methods is feasible and efficient, it can easily solve the capacitated Chinese postman problems on all kinds of complex networks. |
| doi_str_mv | 10.4028/www.scientific.net/AMM.701-702.44 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1651403507</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3517462171</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2434-8110c9ad08eb5a8cf09339d6be9bb34764e32d021204108a565c63dc16e4ecf83</originalsourceid><addsrcrecordid>eNqNkctu1DAUQC0eEm3pP1hiA4uk1484znIU0VKpQ7uAteU4N4xLEg-2RwN_j8sggVixsLzw0fHVPYS8Y1BL4PrqeDzWyXlcs5-8q1fMV5vttm6BVS3wWspn5IwpxatWav6cXHatFiC0aITUzYtfb1B1QqhX5DylRwAlmdRn5P4Gi8s7upm_hOjzbqFTiDTvkPZ2b53PNuNI-51fMSF9CCkvdqUPMQwzLjSsdOu_F-Aj5mOIX9Nr8nKyc8LL3_cF-Xz9_lP_obq7v7ntN3eV41LISjMGrrMjaBwaq90EZbZuVAN2wyBkqyQKPgJnHCQDbRvVOCVGxxRKdJMWF-TtybuP4dsBUzaLTw7n2a4YDskw1TAJooG2oG_-QR_DIa5lukIJxnWj1JNwc6JcDClFnMw--sXGH4aBeUpgSgLzJ4EpazMlgSkJyuFGyuLoT44c7Zoyut1fX_235ScfHpWB</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1631285668</pqid></control><display><type>article</type><title>Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks</title><source>Scientific.net Journals</source><creator>Tian, Gui Long ; Li, Xian ; Ma, Yu Hong</creator><creatorcontrib>Tian, Gui Long ; Li, Xian ; Ma, Yu Hong</creatorcontrib><description>The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve while going” in the shortest path is integrated to use in course of decoding. A genetic scheme is designed to solve the capacitated Chinese postman problem without translating arc routing problem into node routing problem. The simulation experiments show that the methods is feasible and efficient, it can easily solve the capacitated Chinese postman problems on all kinds of complex networks.</description><identifier>ISSN: 1660-9336</identifier><identifier>ISSN: 1662-7482</identifier><identifier>ISBN: 9783038353485</identifier><identifier>ISBN: 3038353485</identifier><identifier>EISSN: 1662-7482</identifier><identifier>DOI: 10.4028/www.scientific.net/AMM.701-702.44</identifier><language>eng</language><publisher>Zurich: Trans Tech Publications Ltd</publisher><subject>Computer networks ; Decoding ; Encoding ; Genetic algorithms ; Genetics ; Networks ; Routing (telecommunications) ; Strategy</subject><ispartof>Applied Mechanics and Materials, 2014-12, Vol.701-702 (Industrial Engineering, Computation and Information Technologies), p.44-49</ispartof><rights>2015 Trans Tech Publications Ltd</rights><rights>Copyright Trans Tech Publications Ltd. Dec 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2434-8110c9ad08eb5a8cf09339d6be9bb34764e32d021204108a565c63dc16e4ecf83</citedby><cites>FETCH-LOGICAL-c2434-8110c9ad08eb5a8cf09339d6be9bb34764e32d021204108a565c63dc16e4ecf83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://www.scientific.net/Image/TitleCover/3682?width=600</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Tian, Gui Long</creatorcontrib><creatorcontrib>Li, Xian</creatorcontrib><creatorcontrib>Ma, Yu Hong</creatorcontrib><title>Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks</title><title>Applied Mechanics and Materials</title><description>The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve while going” in the shortest path is integrated to use in course of decoding. A genetic scheme is designed to solve the capacitated Chinese postman problem without translating arc routing problem into node routing problem. The simulation experiments show that the methods is feasible and efficient, it can easily solve the capacitated Chinese postman problems on all kinds of complex networks.</description><subject>Computer networks</subject><subject>Decoding</subject><subject>Encoding</subject><subject>Genetic algorithms</subject><subject>Genetics</subject><subject>Networks</subject><subject>Routing (telecommunications)</subject><subject>Strategy</subject><issn>1660-9336</issn><issn>1662-7482</issn><issn>1662-7482</issn><isbn>9783038353485</isbn><isbn>3038353485</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNkctu1DAUQC0eEm3pP1hiA4uk1484znIU0VKpQ7uAteU4N4xLEg-2RwN_j8sggVixsLzw0fHVPYS8Y1BL4PrqeDzWyXlcs5-8q1fMV5vttm6BVS3wWspn5IwpxatWav6cXHatFiC0aITUzYtfb1B1QqhX5DylRwAlmdRn5P4Gi8s7upm_hOjzbqFTiDTvkPZ2b53PNuNI-51fMSF9CCkvdqUPMQwzLjSsdOu_F-Aj5mOIX9Nr8nKyc8LL3_cF-Xz9_lP_obq7v7ntN3eV41LISjMGrrMjaBwaq90EZbZuVAN2wyBkqyQKPgJnHCQDbRvVOCVGxxRKdJMWF-TtybuP4dsBUzaLTw7n2a4YDskw1TAJooG2oG_-QR_DIa5lukIJxnWj1JNwc6JcDClFnMw--sXGH4aBeUpgSgLzJ4EpazMlgSkJyuFGyuLoT44c7Zoyut1fX_235ScfHpWB</recordid><startdate>20141201</startdate><enddate>20141201</enddate><creator>Tian, Gui Long</creator><creator>Li, Xian</creator><creator>Ma, Yu Hong</creator><general>Trans Tech Publications Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SR</scope><scope>7TB</scope><scope>8BQ</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BFMQW</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>KB.</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>PDBOC</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>7SC</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20141201</creationdate><title>Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks</title><author>Tian, Gui Long ; Li, Xian ; Ma, Yu Hong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2434-8110c9ad08eb5a8cf09339d6be9bb34764e32d021204108a565c63dc16e4ecf83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Computer networks</topic><topic>Decoding</topic><topic>Encoding</topic><topic>Genetic algorithms</topic><topic>Genetics</topic><topic>Networks</topic><topic>Routing (telecommunications)</topic><topic>Strategy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tian, Gui Long</creatorcontrib><creatorcontrib>Li, Xian</creatorcontrib><creatorcontrib>Ma, Yu Hong</creatorcontrib><collection>CrossRef</collection><collection>Engineered Materials Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central</collection><collection>Continental Europe Database</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>Materials Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Applied Mechanics and Materials</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tian, Gui Long</au><au>Li, Xian</au><au>Ma, Yu Hong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks</atitle><jtitle>Applied Mechanics and Materials</jtitle><date>2014-12-01</date><risdate>2014</risdate><volume>701-702</volume><issue>Industrial Engineering, Computation and Information Technologies</issue><spage>44</spage><epage>49</epage><pages>44-49</pages><issn>1660-9336</issn><issn>1662-7482</issn><eissn>1662-7482</eissn><isbn>9783038353485</isbn><isbn>3038353485</isbn><abstract>The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve while going” in the shortest path is integrated to use in course of decoding. A genetic scheme is designed to solve the capacitated Chinese postman problem without translating arc routing problem into node routing problem. The simulation experiments show that the methods is feasible and efficient, it can easily solve the capacitated Chinese postman problems on all kinds of complex networks.</abstract><cop>Zurich</cop><pub>Trans Tech Publications Ltd</pub><doi>10.4028/www.scientific.net/AMM.701-702.44</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1660-9336 |
| ispartof | Applied Mechanics and Materials, 2014-12, Vol.701-702 (Industrial Engineering, Computation and Information Technologies), p.44-49 |
| issn | 1660-9336 1662-7482 1662-7482 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1651403507 |
| source | Scientific.net Journals |
| subjects | Computer networks Decoding Encoding Genetic algorithms Genetics Networks Routing (telecommunications) Strategy |
| title | Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T02%3A04%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Genetic%20Algorithm%20for%20the%20Capacitated%20Chinese%20Postman%20Problem%20on%20Mixed%20Networks&rft.jtitle=Applied%20Mechanics%20and%20Materials&rft.au=Tian,%20Gui%20Long&rft.date=2014-12-01&rft.volume=701-702&rft.issue=Industrial%20Engineering,%20Computation%20and%20Information%20Technologies&rft.spage=44&rft.epage=49&rft.pages=44-49&rft.issn=1660-9336&rft.eissn=1662-7482&rft.isbn=9783038353485&rft.isbn_list=3038353485&rft_id=info:doi/10.4028/www.scientific.net/AMM.701-702.44&rft_dat=%3Cproquest_cross%3E3517462171%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1631285668&rft_id=info:pmid/&rfr_iscdi=true |