Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms
This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits mu...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on cybernetics 2016-03, Vol.46 (3), p.582-594 |
|---|---|
| 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 | 594 |
|---|---|
| container_issue | 3 |
| container_start_page | 582 |
| container_title | IEEE transactions on cybernetics |
| container_volume | 46 |
| creator | Wang, Jiahai Zhou, Ying Wang, Yong Zhang, Jun Chen, C. L. Philip Zheng, Zibin |
| description | This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances. |
| doi_str_mv | 10.1109/TCYB.2015.2409837 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pubme</sourceid><recordid>TN_cdi_pubmed_primary_25794408</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7062012</ieee_id><sourcerecordid>1816085640</sourcerecordid><originalsourceid>FETCH-LOGICAL-c382t-8393f342893682c55c6891c8956d7c07beeee513b8509b8697f955854cb8d8a3</originalsourceid><addsrcrecordid>eNqFkc1O3DAUha2qqCDKA6BKlaVuWDCDf-L4ujuYAkWiAsGoVVdR4njA0yQe7KSIF-C5ucMMs-imd2PL_s6xjg8h-5yNOWfmaDr5fTIWjKuxyJgBqd-RHcFzGAmh1fvNPtfbZC-lOcMBPDLwgWwLpU2WMdghzz-Gpvehmjvb-7-O_nT33jaO3oSh990dvY6halyb6C_f39Nb3yJedi4MiX5zDSriEy27ml57-2dYvG6nvnWId3V4TF_pWYioKfGN7pBedAnV1qXDV_K4uQsRfdv0kWzNyia5vfW6S6Znp9PJ99Hl1fnF5PhyZCWIfgTSyJnMBBiZg7BKWQzELRiV19oyXTkcxWUFipkKcqNnRilQma2ghlLukoOV7SKGh8Glvmh9sq5pVpEKjj_EQOUZ-z-qc82AGZEh-uUfdB6G2GEOpEALKXhmkOIrysaQUnSzYhF9W8angrNi2WixbLRYNlqsG0XN57XzULWu3ije-kPg0wrwGHxzrVmONkK-APbPpDw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1787232149</pqid></control><display><type>article</type><title>Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms</title><source>IEEE Electronic Library (IEL)</source><creator>Wang, Jiahai ; Zhou, Ying ; Wang, Yong ; Zhang, Jun ; Chen, C. L. Philip ; Zheng, Zibin</creator><creatorcontrib>Wang, Jiahai ; Zhou, Ying ; Wang, Yong ; Zhang, Jun ; Chen, C. L. Philip ; Zheng, Zibin</creatorcontrib><description>This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances.</description><identifier>ISSN: 2168-2267</identifier><identifier>EISSN: 2168-2275</identifier><identifier>DOI: 10.1109/TCYB.2015.2409837</identifier><identifier>PMID: 25794408</identifier><identifier>CODEN: ITCEB8</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Benchmark testing ; Bi-directional logistics ; Computer simulation ; Cybernetics ; Delays ; Logistics ; Molybdenum ; multiobjective optimization ; Optimization ; Route selection ; Routing ; Search problems ; simultaneous delivery and pickup ; Supply chains ; vehicle routing problem with time windows (VRPTW) ; Vehicles ; Windows (intervals)</subject><ispartof>IEEE transactions on cybernetics, 2016-03, Vol.46 (3), p.582-594</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c382t-8393f342893682c55c6891c8956d7c07beeee513b8509b8697f955854cb8d8a3</citedby><cites>FETCH-LOGICAL-c382t-8393f342893682c55c6891c8956d7c07beeee513b8509b8697f955854cb8d8a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7062012$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/25794408$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Wang, Jiahai</creatorcontrib><creatorcontrib>Zhou, Ying</creatorcontrib><creatorcontrib>Wang, Yong</creatorcontrib><creatorcontrib>Zhang, Jun</creatorcontrib><creatorcontrib>Chen, C. L. Philip</creatorcontrib><creatorcontrib>Zheng, Zibin</creatorcontrib><title>Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms</title><title>IEEE transactions on cybernetics</title><addtitle>TCYB</addtitle><addtitle>IEEE Trans Cybern</addtitle><description>This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Benchmark testing</subject><subject>Bi-directional logistics</subject><subject>Computer simulation</subject><subject>Cybernetics</subject><subject>Delays</subject><subject>Logistics</subject><subject>Molybdenum</subject><subject>multiobjective optimization</subject><subject>Optimization</subject><subject>Route selection</subject><subject>Routing</subject><subject>Search problems</subject><subject>simultaneous delivery and pickup</subject><subject>Supply chains</subject><subject>vehicle routing problem with time windows (VRPTW)</subject><subject>Vehicles</subject><subject>Windows (intervals)</subject><issn>2168-2267</issn><issn>2168-2275</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><recordid>eNqFkc1O3DAUha2qqCDKA6BKlaVuWDCDf-L4ujuYAkWiAsGoVVdR4njA0yQe7KSIF-C5ucMMs-imd2PL_s6xjg8h-5yNOWfmaDr5fTIWjKuxyJgBqd-RHcFzGAmh1fvNPtfbZC-lOcMBPDLwgWwLpU2WMdghzz-Gpvehmjvb-7-O_nT33jaO3oSh990dvY6halyb6C_f39Nb3yJedi4MiX5zDSriEy27ml57-2dYvG6nvnWId3V4TF_pWYioKfGN7pBedAnV1qXDV_K4uQsRfdv0kWzNyia5vfW6S6Znp9PJ99Hl1fnF5PhyZCWIfgTSyJnMBBiZg7BKWQzELRiV19oyXTkcxWUFipkKcqNnRilQma2ghlLukoOV7SKGh8Glvmh9sq5pVpEKjj_EQOUZ-z-qc82AGZEh-uUfdB6G2GEOpEALKXhmkOIrysaQUnSzYhF9W8angrNi2WixbLRYNlqsG0XN57XzULWu3ije-kPg0wrwGHxzrVmONkK-APbPpDw</recordid><startdate>201603</startdate><enddate>201603</enddate><creator>Wang, Jiahai</creator><creator>Zhou, Ying</creator><creator>Wang, Yong</creator><creator>Zhang, Jun</creator><creator>Chen, C. L. Philip</creator><creator>Zheng, Zibin</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7X8</scope></search><sort><creationdate>201603</creationdate><title>Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms</title><author>Wang, Jiahai ; Zhou, Ying ; Wang, Yong ; Zhang, Jun ; Chen, C. L. Philip ; Zheng, Zibin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c382t-8393f342893682c55c6891c8956d7c07beeee513b8509b8697f955854cb8d8a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Benchmark testing</topic><topic>Bi-directional logistics</topic><topic>Computer simulation</topic><topic>Cybernetics</topic><topic>Delays</topic><topic>Logistics</topic><topic>Molybdenum</topic><topic>multiobjective optimization</topic><topic>Optimization</topic><topic>Route selection</topic><topic>Routing</topic><topic>Search problems</topic><topic>simultaneous delivery and pickup</topic><topic>Supply chains</topic><topic>vehicle routing problem with time windows (VRPTW)</topic><topic>Vehicles</topic><topic>Windows (intervals)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Jiahai</creatorcontrib><creatorcontrib>Zhou, Ying</creatorcontrib><creatorcontrib>Wang, Yong</creatorcontrib><creatorcontrib>Zhang, Jun</creatorcontrib><creatorcontrib>Chen, C. L. Philip</creatorcontrib><creatorcontrib>Zheng, Zibin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</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><collection>MEDLINE - Academic</collection><jtitle>IEEE transactions on cybernetics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Jiahai</au><au>Zhou, Ying</au><au>Wang, Yong</au><au>Zhang, Jun</au><au>Chen, C. L. Philip</au><au>Zheng, Zibin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms</atitle><jtitle>IEEE transactions on cybernetics</jtitle><stitle>TCYB</stitle><addtitle>IEEE Trans Cybern</addtitle><date>2016-03</date><risdate>2016</risdate><volume>46</volume><issue>3</issue><spage>582</spage><epage>594</epage><pages>582-594</pages><issn>2168-2267</issn><eissn>2168-2275</eissn><coden>ITCEB8</coden><abstract>This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>25794408</pmid><doi>10.1109/TCYB.2015.2409837</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2168-2267 |
| ispartof | IEEE transactions on cybernetics, 2016-03, Vol.46 (3), p.582-594 |
| issn | 2168-2267 2168-2275 |
| language | eng |
| recordid | cdi_pubmed_primary_25794408 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Benchmark testing Bi-directional logistics Computer simulation Cybernetics Delays Logistics Molybdenum multiobjective optimization Optimization Route selection Routing Search problems simultaneous delivery and pickup Supply chains vehicle routing problem with time windows (VRPTW) Vehicles Windows (intervals) |
| title | Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T11%3A01%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pubme&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multiobjective%20Vehicle%20Routing%20Problems%20With%20Simultaneous%20Delivery%20and%20Pickup%20and%20Time%20Windows:%20Formulation,%20Instances,%20and%20Algorithms&rft.jtitle=IEEE%20transactions%20on%20cybernetics&rft.au=Wang,%20Jiahai&rft.date=2016-03&rft.volume=46&rft.issue=3&rft.spage=582&rft.epage=594&rft.pages=582-594&rft.issn=2168-2267&rft.eissn=2168-2275&rft.coden=ITCEB8&rft_id=info:doi/10.1109/TCYB.2015.2409837&rft_dat=%3Cproquest_pubme%3E1816085640%3C/proquest_pubme%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1787232149&rft_id=info:pmid/25794408&rft_ieee_id=7062012&rfr_iscdi=true |