Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem
A new variant of classical VRP, called 1-PDVRP, is introduced in this paper. It differs from the general VRP with pickup and delivery in that the commodity provided by the pickup customers is the same as that needed by delivery customers. We established the mathematical model for 1-PDVRP, and utiliz...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 179 |
|---|---|
| container_issue | |
| container_start_page | 175 |
| container_title | |
| container_volume | 1 |
| creator | Xiaoyan Shi Fanggeng Zhao Yancheng Gong |
| description | A new variant of classical VRP, called 1-PDVRP, is introduced in this paper. It differs from the general VRP with pickup and delivery in that the commodity provided by the pickup customers is the same as that needed by delivery customers. We established the mathematical model for 1-PDVRP, and utilized genetic algorithm to solve it. In the proposed genetic algorithm, we implemented a pheromone-based crossover operator for this problem and the algorithm is tested on 100 randomly generated instances. |
| doi_str_mv | 10.1109/ICICISYS.2009.5357913 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5357913</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5357913</ieee_id><sourcerecordid>5357913</sourcerecordid><originalsourceid>FETCH-LOGICAL-i105t-d4393feac23411fb65710c70d2ba785a115bb7615719af71a045cd9e624b28973</originalsourceid><addsrcrecordid>eNpNUE1Lw0AUXJGCWvMLRNg_kLhvP7LZoxRtCwUP1YOnstm8NKtJNmzTQv-9EXtw5jDM8HgMQ8gjsAyAmaf1YuL2c5txxkymhNIGxBVJjC5AcimlFgVc__dKwozc_Z4bpsCwG5IcDl9sglQCuLgl2yX2OHpHbbsP0Y9NR-sQ6dggDT2mLnRdqPx4poN338chtX2VVtj6E8YzPWHjXYs0huPo-z0dYihb7O7JrLbtAZOLzsnH68v7YpVu3pbrxfMm9cDUmFZSGFGjdVxIgLrMlQbmNKt4aXWhLIAqS53DFBtba7BTaVcZzLkseWG0mJOHv78eEXdD9J2N591lF_EDekZVUw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Xiaoyan Shi ; Fanggeng Zhao ; Yancheng Gong</creator><creatorcontrib>Xiaoyan Shi ; Fanggeng Zhao ; Yancheng Gong</creatorcontrib><description>A new variant of classical VRP, called 1-PDVRP, is introduced in this paper. It differs from the general VRP with pickup and delivery in that the commodity provided by the pickup customers is the same as that needed by delivery customers. We established the mathematical model for 1-PDVRP, and utilized genetic algorithm to solve it. In the proposed genetic algorithm, we implemented a pheromone-based crossover operator for this problem and the algorithm is tested on 100 randomly generated instances.</description><identifier>ISBN: 9781424447541</identifier><identifier>ISBN: 1424447542</identifier><identifier>EISBN: 9781424447381</identifier><identifier>EISBN: 1424447380</identifier><identifier>DOI: 10.1109/ICICISYS.2009.5357913</identifier><identifier>LCCN: 2009905190</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automobiles ; Genetic algorithm ; Genetic algorithms ; Greedy algorithms ; Heuristic algorithms ; Instruments ; Mathematical model ; Pheromone-based crossover ; Pickup-and-delivery ; Routing ; Testing ; Traveling salesman problems ; Vehicle routing problem ; Vehicles</subject><ispartof>2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, 2009, Vol.1, p.175-179</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5357913$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5357913$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xiaoyan Shi</creatorcontrib><creatorcontrib>Fanggeng Zhao</creatorcontrib><creatorcontrib>Yancheng Gong</creatorcontrib><title>Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem</title><title>2009 IEEE International Conference on Intelligent Computing and Intelligent Systems</title><addtitle>ICICISYS</addtitle><description>A new variant of classical VRP, called 1-PDVRP, is introduced in this paper. It differs from the general VRP with pickup and delivery in that the commodity provided by the pickup customers is the same as that needed by delivery customers. We established the mathematical model for 1-PDVRP, and utilized genetic algorithm to solve it. In the proposed genetic algorithm, we implemented a pheromone-based crossover operator for this problem and the algorithm is tested on 100 randomly generated instances.</description><subject>Automobiles</subject><subject>Genetic algorithm</subject><subject>Genetic algorithms</subject><subject>Greedy algorithms</subject><subject>Heuristic algorithms</subject><subject>Instruments</subject><subject>Mathematical model</subject><subject>Pheromone-based crossover</subject><subject>Pickup-and-delivery</subject><subject>Routing</subject><subject>Testing</subject><subject>Traveling salesman problems</subject><subject>Vehicle routing problem</subject><subject>Vehicles</subject><isbn>9781424447541</isbn><isbn>1424447542</isbn><isbn>9781424447381</isbn><isbn>1424447380</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpNUE1Lw0AUXJGCWvMLRNg_kLhvP7LZoxRtCwUP1YOnstm8NKtJNmzTQv-9EXtw5jDM8HgMQ8gjsAyAmaf1YuL2c5txxkymhNIGxBVJjC5AcimlFgVc__dKwozc_Z4bpsCwG5IcDl9sglQCuLgl2yX2OHpHbbsP0Y9NR-sQ6dggDT2mLnRdqPx4poN338chtX2VVtj6E8YzPWHjXYs0huPo-z0dYihb7O7JrLbtAZOLzsnH68v7YpVu3pbrxfMm9cDUmFZSGFGjdVxIgLrMlQbmNKt4aXWhLIAqS53DFBtba7BTaVcZzLkseWG0mJOHv78eEXdD9J2N591lF_EDekZVUw</recordid><startdate>200911</startdate><enddate>200911</enddate><creator>Xiaoyan Shi</creator><creator>Fanggeng Zhao</creator><creator>Yancheng Gong</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200911</creationdate><title>Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem</title><author>Xiaoyan Shi ; Fanggeng Zhao ; Yancheng Gong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i105t-d4393feac23411fb65710c70d2ba785a115bb7615719af71a045cd9e624b28973</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Automobiles</topic><topic>Genetic algorithm</topic><topic>Genetic algorithms</topic><topic>Greedy algorithms</topic><topic>Heuristic algorithms</topic><topic>Instruments</topic><topic>Mathematical model</topic><topic>Pheromone-based crossover</topic><topic>Pickup-and-delivery</topic><topic>Routing</topic><topic>Testing</topic><topic>Traveling salesman problems</topic><topic>Vehicle routing problem</topic><topic>Vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Xiaoyan Shi</creatorcontrib><creatorcontrib>Fanggeng Zhao</creatorcontrib><creatorcontrib>Yancheng Gong</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xiaoyan Shi</au><au>Fanggeng Zhao</au><au>Yancheng Gong</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem</atitle><btitle>2009 IEEE International Conference on Intelligent Computing and Intelligent Systems</btitle><stitle>ICICISYS</stitle><date>2009-11</date><risdate>2009</risdate><volume>1</volume><spage>175</spage><epage>179</epage><pages>175-179</pages><isbn>9781424447541</isbn><isbn>1424447542</isbn><eisbn>9781424447381</eisbn><eisbn>1424447380</eisbn><abstract>A new variant of classical VRP, called 1-PDVRP, is introduced in this paper. It differs from the general VRP with pickup and delivery in that the commodity provided by the pickup customers is the same as that needed by delivery customers. We established the mathematical model for 1-PDVRP, and utilized genetic algorithm to solve it. In the proposed genetic algorithm, we implemented a pheromone-based crossover operator for this problem and the algorithm is tested on 100 randomly generated instances.</abstract><pub>IEEE</pub><doi>10.1109/ICICISYS.2009.5357913</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781424447541 |
| ispartof | 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, 2009, Vol.1, p.175-179 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5357913 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Automobiles Genetic algorithm Genetic algorithms Greedy algorithms Heuristic algorithms Instruments Mathematical model Pheromone-based crossover Pickup-and-delivery Routing Testing Traveling salesman problems Vehicle routing problem Vehicles |
| title | Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T16%3A12%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Genetic%20algorithm%20for%20the%20one-commodity%20pickup-and-delivery%20vehicle%20routing%20problem&rft.btitle=2009%20IEEE%20International%20Conference%20on%20Intelligent%20Computing%20and%20Intelligent%20Systems&rft.au=Xiaoyan%20Shi&rft.date=2009-11&rft.volume=1&rft.spage=175&rft.epage=179&rft.pages=175-179&rft.isbn=9781424447541&rft.isbn_list=1424447542&rft_id=info:doi/10.1109/ICICISYS.2009.5357913&rft_dat=%3Cieee_6IE%3E5357913%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424447381&rft.eisbn_list=1424447380&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5357913&rfr_iscdi=true |