Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption
In logistic system, a Vehicle Routing Problem with time windows (VRPTW) is defined as a problem to decide the optimal set of logistic routes used by homogeny vehicles to deliver customers' demand within scheduled service time. The objective is to minimize the total travel cost (related to the t...
Gespeichert in:
| Veröffentlicht in: | Journal of physics. Conference series 2019-08, Vol.1255 (1), p.12072 |
|---|---|
| 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 | |
|---|---|
| container_issue | 1 |
| container_start_page | 12072 |
| container_title | Journal of physics. Conference series |
| container_volume | 1255 |
| creator | Susilawati, Enny Mawengkang, Herman Opim, S. Sitompul Sutarman |
| description | In logistic system, a Vehicle Routing Problem with time windows (VRPTW) is defined as a problem to decide the optimal set of logistic routes used by homogeny vehicles to deliver customers' demand within scheduled service time. The objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the time to deliver and the time departing from a customer are restricted. The problem also include service disruption. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model. |
| doi_str_mv | 10.1088/1742-6596/1255/1/012072 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2566409075</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2566409075</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2742-4ad1d1577fba7bc7372c6be82193f93566c63b646aa4a106bed41bb555b2a33f3</originalsourceid><addsrcrecordid>eNqFkF1LwzAUhosoOKe_wYB3wlw-mqa9HJvzg4HDTb0MaZpumVtTk3bijb_dhMlEEMxNXnKe95yTN4rOEbxCME37iMW4l9As6SNMaR_1IcKQ4YOos68c7nWaHkcnzq0gJP6wTvQ5Ulu1NrWuFmCshNP5WoGZElYuwaCurRFejI0FcyFf14GaCLtQ4FkttfToo2mb8Dq1xjs34EU3SzDXG-VVVZh3MDSV04WyAZopu9VSgZF2tq0bbarT6KgUa6fOvu9u9DS-ng9ve5OHm7vhYNKTOCweiwIViDJW5oLlkhGGZZKrFKOMlBmhSSITkidxIkQsEPSlIkZ5TinNsSCkJN3oYtfX_-itVa7hK9Payo_k2LtjmEFGPcV2lLTGOatKXlu9EfaDI8hD2DzEyEOkPITNEd-F7Z2XO6c29U_r--lw9hvkdRGWIX_A_434AjRVj5k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2566409075</pqid></control><display><type>article</type><title>Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption</title><source>Institute of Physics IOPscience extra</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Institute of Physics Open Access Journal Titles</source><source>Alma/SFX Local Collection</source><source>Free Full-Text Journals in Chemistry</source><creator>Susilawati, Enny ; Mawengkang, Herman ; Opim, S. Sitompul ; Sutarman</creator><creatorcontrib>Susilawati, Enny ; Mawengkang, Herman ; Opim, S. Sitompul ; Sutarman</creatorcontrib><description>In logistic system, a Vehicle Routing Problem with time windows (VRPTW) is defined as a problem to decide the optimal set of logistic routes used by homogeny vehicles to deliver customers' demand within scheduled service time. The objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the time to deliver and the time departing from a customer are restricted. The problem also include service disruption. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.</description><identifier>ISSN: 1742-6588</identifier><identifier>EISSN: 1742-6596</identifier><identifier>DOI: 10.1088/1742-6596/1255/1/012072</identifier><language>eng</language><publisher>Bristol: IOP Publishing</publisher><subject>Customer services ; Customers ; Delivery scheduling ; Disruption ; Integer programming ; Operating costs ; Route planning ; Travel time ; Vehicle routing ; Vehicles ; Windows (intervals)</subject><ispartof>Journal of physics. Conference series, 2019-08, Vol.1255 (1), p.12072</ispartof><rights>Published under licence by IOP Publishing Ltd</rights><rights>2019. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2742-4ad1d1577fba7bc7372c6be82193f93566c63b646aa4a106bed41bb555b2a33f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://iopscience.iop.org/article/10.1088/1742-6596/1255/1/012072/pdf$$EPDF$$P50$$Giop$$Hfree_for_read</linktopdf><link.rule.ids>314,776,780,27901,27902,38845,38867,53815,53842</link.rule.ids></links><search><creatorcontrib>Susilawati, Enny</creatorcontrib><creatorcontrib>Mawengkang, Herman</creatorcontrib><creatorcontrib>Opim, S. Sitompul</creatorcontrib><creatorcontrib>Sutarman</creatorcontrib><title>Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption</title><title>Journal of physics. Conference series</title><addtitle>J. Phys.: Conf. Ser</addtitle><description>In logistic system, a Vehicle Routing Problem with time windows (VRPTW) is defined as a problem to decide the optimal set of logistic routes used by homogeny vehicles to deliver customers' demand within scheduled service time. The objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the time to deliver and the time departing from a customer are restricted. The problem also include service disruption. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.</description><subject>Customer services</subject><subject>Customers</subject><subject>Delivery scheduling</subject><subject>Disruption</subject><subject>Integer programming</subject><subject>Operating costs</subject><subject>Route planning</subject><subject>Travel time</subject><subject>Vehicle routing</subject><subject>Vehicles</subject><subject>Windows (intervals)</subject><issn>1742-6588</issn><issn>1742-6596</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>O3W</sourceid><sourceid>BENPR</sourceid><recordid>eNqFkF1LwzAUhosoOKe_wYB3wlw-mqa9HJvzg4HDTb0MaZpumVtTk3bijb_dhMlEEMxNXnKe95yTN4rOEbxCME37iMW4l9As6SNMaR_1IcKQ4YOos68c7nWaHkcnzq0gJP6wTvQ5Ulu1NrWuFmCshNP5WoGZElYuwaCurRFejI0FcyFf14GaCLtQ4FkttfToo2mb8Dq1xjs34EU3SzDXG-VVVZh3MDSV04WyAZopu9VSgZF2tq0bbarT6KgUa6fOvu9u9DS-ng9ve5OHm7vhYNKTOCweiwIViDJW5oLlkhGGZZKrFKOMlBmhSSITkidxIkQsEPSlIkZ5TinNsSCkJN3oYtfX_-itVa7hK9Payo_k2LtjmEFGPcV2lLTGOatKXlu9EfaDI8hD2DzEyEOkPITNEd-F7Z2XO6c29U_r--lw9hvkdRGWIX_A_434AjRVj5k</recordid><startdate>20190801</startdate><enddate>20190801</enddate><creator>Susilawati, Enny</creator><creator>Mawengkang, Herman</creator><creator>Opim, S. Sitompul</creator><creator>Sutarman</creator><general>IOP Publishing</general><scope>O3W</scope><scope>TSCCA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>L7M</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20190801</creationdate><title>Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption</title><author>Susilawati, Enny ; Mawengkang, Herman ; Opim, S. Sitompul ; Sutarman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2742-4ad1d1577fba7bc7372c6be82193f93566c63b646aa4a106bed41bb555b2a33f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Customer services</topic><topic>Customers</topic><topic>Delivery scheduling</topic><topic>Disruption</topic><topic>Integer programming</topic><topic>Operating costs</topic><topic>Route planning</topic><topic>Travel time</topic><topic>Vehicle routing</topic><topic>Vehicles</topic><topic>Windows (intervals)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Susilawati, Enny</creatorcontrib><creatorcontrib>Mawengkang, Herman</creatorcontrib><creatorcontrib>Opim, S. Sitompul</creatorcontrib><creatorcontrib>Sutarman</creatorcontrib><collection>Institute of Physics Open Access Journal Titles</collection><collection>IOPscience (Open Access)</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</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><jtitle>Journal of physics. Conference series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Susilawati, Enny</au><au>Mawengkang, Herman</au><au>Opim, S. Sitompul</au><au>Sutarman</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption</atitle><jtitle>Journal of physics. Conference series</jtitle><addtitle>J. Phys.: Conf. Ser</addtitle><date>2019-08-01</date><risdate>2019</risdate><volume>1255</volume><issue>1</issue><spage>12072</spage><pages>12072-</pages><issn>1742-6588</issn><eissn>1742-6596</eissn><abstract>In logistic system, a Vehicle Routing Problem with time windows (VRPTW) is defined as a problem to decide the optimal set of logistic routes used by homogeny vehicles to deliver customers' demand within scheduled service time. The objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the time to deliver and the time departing from a customer are restricted. The problem also include service disruption. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.</abstract><cop>Bristol</cop><pub>IOP Publishing</pub><doi>10.1088/1742-6596/1255/1/012072</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1742-6588 |
| ispartof | Journal of physics. Conference series, 2019-08, Vol.1255 (1), p.12072 |
| issn | 1742-6588 1742-6596 |
| language | eng |
| recordid | cdi_proquest_journals_2566409075 |
| source | Institute of Physics IOPscience extra; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Institute of Physics Open Access Journal Titles; Alma/SFX Local Collection; Free Full-Text Journals in Chemistry |
| subjects | Customer services Customers Delivery scheduling Disruption Integer programming Operating costs Route planning Travel time Vehicle routing Vehicles Windows (intervals) |
| title | Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T20%3A14%3A00IST&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=Developing%20Feasible%20Search%20Approach%20For%20Tackling%20Large%20Vehicle%20Routing%20Problem%20With%20Time%20Window%20Considering%20Service%20Disruption&rft.jtitle=Journal%20of%20physics.%20Conference%20series&rft.au=Susilawati,%20Enny&rft.date=2019-08-01&rft.volume=1255&rft.issue=1&rft.spage=12072&rft.pages=12072-&rft.issn=1742-6588&rft.eissn=1742-6596&rft_id=info:doi/10.1088/1742-6596/1255/1/012072&rft_dat=%3Cproquest_cross%3E2566409075%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=2566409075&rft_id=info:pmid/&rfr_iscdi=true |