Set covering in fuel-considered vehicle routing problems
The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows (FVRP-TW) whose objective is to find a set covering with the minimum cardinality, which means the number of used vehicles is minimized and hence the...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science Jg. 607; S. 471 - 479 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.11.2015
|
| Schlagworte: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows (FVRP-TW) whose objective is to find a set covering with the minimum cardinality, which means the number of used vehicles is minimized and hence the fuel consumption is minimized in the real logistics. We give a bicriteria approximation algorithm for this problem. Secondly, we study the set covering in the FVRP with distance constraint and constant time windows (FVRP-CTW), which has a constant number of the time windows provided by logistics companies. We give a bicriteria approximation algorithm with (2+ϵ,O(log1/ϵ)) for this problem, in which the first term is the approximation ratio on the distance constraint and the second term is the approximation ratio on the cardinality of the covering set. Thirdly, we study the set covering in general FVRP and propose a lower bound for this problem which is based on total unimodularity. Finally, we design an algorithm framework based on the lower bound for solving the set covering in general FVRP. Simulation results demonstrate the effectiveness of the algorithms for solving the set covering in FVRP-TW and general FVRP. |
|---|---|
| AbstractList | The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows (FVRP-TW) whose objective is to find a set covering with the minimum cardinality, which means the number of used vehicles is minimized and hence the fuel consumption is minimized in the real logistics. We give a bicriteria approximation algorithm for this problem. Secondly, we study the set covering in the FVRP with distance constraint and constant time windows (FVRP-CTW), which has a constant number of the time windows provided by logistics companies. We give a bicriteria approximation algorithm with for this problem, in which the first term is the approximation ratio on the distance constraint and the second term is the approximation ratio on the cardinality of the covering set. Thirdly, we study the set covering in general FVRP and propose a lower bound for this problem which is based on total unimodularity. Finally, we design an algorithm framework based on the lower bound for solving the set covering in general FVRP. Simulation results demonstrate the effectiveness of the algorithms for solving the set covering in FVRP-TW and general FVRP. The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows (FVRP-TW) whose objective is to find a set covering with the minimum cardinality, which means the number of used vehicles is minimized and hence the fuel consumption is minimized in the real logistics. We give a bicriteria approximation algorithm for this problem. Secondly, we study the set covering in the FVRP with distance constraint and constant time windows (FVRP-CTW), which has a constant number of the time windows provided by logistics companies. We give a bicriteria approximation algorithm with (2+ϵ,O(log1/ϵ)) for this problem, in which the first term is the approximation ratio on the distance constraint and the second term is the approximation ratio on the cardinality of the covering set. Thirdly, we study the set covering in general FVRP and propose a lower bound for this problem which is based on total unimodularity. Finally, we design an algorithm framework based on the lower bound for solving the set covering in general FVRP. Simulation results demonstrate the effectiveness of the algorithms for solving the set covering in FVRP-TW and general FVRP. |
| Author | Song, Liang Chen, Haibin Gu, Hao Huang, Hejiao Du, Hongwei |
| Author_xml | – sequence: 1 givenname: Liang surname: Song fullname: Song, Liang email: songliang@hitsz.edu.cn organization: Harbin Institute of Technology, Shenzhen Graduate School, China – sequence: 2 givenname: Haibin surname: Chen fullname: Chen, Haibin email: chenhb37@gmail.com organization: Harbin Institute of Technology, Shenzhen Graduate School, China – sequence: 3 givenname: Hao surname: Gu fullname: Gu, Hao email: guhaozc@gmail.com organization: Harbin Institute of Technology, Shenzhen Graduate School, China – sequence: 4 givenname: Hejiao surname: Huang fullname: Huang, Hejiao email: hjhuang@hitsz.edu.cn organization: Harbin Institute of Technology, Shenzhen Graduate School, China – sequence: 5 givenname: Hongwei surname: Du fullname: Du, Hongwei email: hwdu@hitsz.edu.cn organization: Harbin Institute of Technology, Shenzhen Graduate School, China |
| BookMark | eNp9kD1PwzAQhi1UJNrCD2DLyJLgj8SxxYQqvqRKDMBsOc4ZXKV2sZ1K_HtSlYmht9zyPu_pngWa-eABoWuCK4IJv91U2aSKYtJUmFcYyzM0J6KVJaWynqE5ZrgumWybC7RIaYOnaVo-R-INcmHCHqLzn4XzhR1hKE3wyfUQoS_28OXMAEUMYz5EdjF0A2zTJTq3ekhw9beX6OPx4X31XK5fn15W9-vSMIZzqVtdy64WjQQmwHadNNQyyiVooztGgFBquZakw7TuuDFtYwUWtOFW90wLtkQ3x97p8PcIKautSwaGQXsIY1KkFZwILmsyRckxamJIKYJVu-i2Ov4ogtXBktqoyZI6WFKYq8nSxLT_GOOyzi74HLUbTpJ3RxKm7_cOokrGgTfQuwgmqz64E_QvcpSERA |
| CitedBy_id | crossref_primary_10_1016_j_tre_2018_01_018 |
| Cites_doi | 10.1002/net.20435 10.1016/j.tcs.2007.12.001 10.2174/1874243200802010008 10.1016/j.tcs.2012.01.046 10.1287/opre.40.2.342 10.1287/mnsc.6.1.80 10.1002/net.3230140113 10.1016/j.tcs.2003.09.010 10.1287/opre.1120.1153 10.1108/14777830810878632 10.1016/j.trc.2006.10.001 10.1007/BF02022044 10.1287/opre.40.4.790 10.1016/j.cor.2011.08.013 10.1287/opre.12.2.300 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2015.06.009 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 479 |
| ExternalDocumentID | 10_1016_j_tcs_2015_06_009 S0304397515005113 |
| GrantInformation_xml | – fundername: Shenzhen Strategic Emerging Industries Program grantid: ZDSY20120613125016389; JCYJ20120613151201451; JCYJ20130329153215152 – fundername: National Natural Science Foundation of China grantid: 11371004; 61370216 funderid: http://dx.doi.org/10.13039/501100001809 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-a7a49b4859e38efbb9c2f3269eacab31e122f6a91b024b6cc75f808256fad3a83 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366773600017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sun Sep 28 12:20:40 EDT 2025 Sat Nov 29 05:15:20 EST 2025 Tue Nov 18 22:32:56 EST 2025 Fri Feb 23 02:30:23 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Lower bound Fuel-considered vehicle routing problems Set covering Bicriteria approximation algorithms Total unimodularity |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-a7a49b4859e38efbb9c2f3269eacab31e122f6a91b024b6cc75f808256fad3a83 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2015.06.009 |
| PQID | 1786186941 |
| PQPubID | 23500 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_1786186941 crossref_primary_10_1016_j_tcs_2015_06_009 crossref_citationtrail_10_1016_j_tcs_2015_06_009 elsevier_sciencedirect_doi_10_1016_j_tcs_2015_06_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-11-01 |
| PublicationDateYYYYMMDD | 2015-11-01 |
| PublicationDate_xml | – month: 11 year: 2015 text: 2015-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Xiao, Zhao, Kaku, Xu (br0140) 2012; 39 Baldacci, Mingozzi, Roberti, Calvo (br0170) 2013; 61 Sun, Li (br0210) 2010 Toth, Vigo (br0150) 2001 Balinski, Quandt (br0030) 1964; 12 Karp (br0010) 1972 Li, Simchi-Levi, Desrochers (br0050) 1992; 40 Nagarajan, Ravi (br0060) 2012; 3 Dantzig, Ramser (br0020) 1959; 6 Ericsson, Larsson, Brundell-Freij (br0120) 2006; 14 Wohlk (br0160) 2008; 2 Desrochers, Desrosiers, Solomon (br0070) 1992; 40 Nagamochi, Ohnishi (br0090) 2008; 393 Song, Huang, Du (br0110) 2014 Thangiah (br0200) 1995; vol. 2 Karuno, Nagamochi (br0080) 2004; 312 Bao, Liu (br0190) 2012; 434 Savelsbergh (br0100) 1985; 4 Laporte, Desrochers, Nobert (br0040) 1984; 14 Bansal, Blum, Chawla, Meyerson (br0180) 2004 Tavares, Zsigraiova, Semiao, daGrac (br0130) 2008; 4 Desrochers (10.1016/j.tcs.2015.06.009_br0070) 1992; 40 Karp (10.1016/j.tcs.2015.06.009_br0010) 1972 Tavares (10.1016/j.tcs.2015.06.009_br0130) 2008; 4 Wohlk (10.1016/j.tcs.2015.06.009_br0160) 2008; 2 Savelsbergh (10.1016/j.tcs.2015.06.009_br0100) 1985; 4 Nagarajan (10.1016/j.tcs.2015.06.009_br0060) 2012; 3 Karuno (10.1016/j.tcs.2015.06.009_br0080) 2004; 312 Song (10.1016/j.tcs.2015.06.009_br0110) 2014 Dantzig (10.1016/j.tcs.2015.06.009_br0020) 1959; 6 Xiao (10.1016/j.tcs.2015.06.009_br0140) 2012; 39 Bansal (10.1016/j.tcs.2015.06.009_br0180) 2004 Toth (10.1016/j.tcs.2015.06.009_br0150) 2001 Bao (10.1016/j.tcs.2015.06.009_br0190) 2012; 434 Baldacci (10.1016/j.tcs.2015.06.009_br0170) 2013; 61 Sun (10.1016/j.tcs.2015.06.009_br0210) 2010 Balinski (10.1016/j.tcs.2015.06.009_br0030) 1964; 12 Ericsson (10.1016/j.tcs.2015.06.009_br0120) 2006; 14 Li (10.1016/j.tcs.2015.06.009_br0050) 1992; 40 Thangiah (10.1016/j.tcs.2015.06.009_br0200) 1995; vol. 2 Laporte (10.1016/j.tcs.2015.06.009_br0040) 1984; 14 Nagamochi (10.1016/j.tcs.2015.06.009_br0090) 2008; 393 |
| References_xml | – volume: 61 start-page: 298 year: 2013 end-page: 314 ident: br0170 article-title: An exact algorithm for the two-echelon capacitated vehicle routing problem publication-title: Oper. Res. – volume: 6 start-page: 80 year: 1959 end-page: 91 ident: br0020 article-title: The truck dispatching problem publication-title: Manage. Sci. – start-page: 85 year: 1972 end-page: 103 ident: br0010 article-title: Reducibility Among Combinatorial Problems – start-page: 2014 year: 2014 ident: br0110 article-title: A quasi-polynomial time approximation scheme for Euclidean CVRPTW publication-title: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications – year: 2001 ident: br0150 article-title: The Vehicle Routing Problem – volume: 40 start-page: 342 year: 1992 end-page: 354 ident: br0070 article-title: A new optimization algorithm for the vehicle routing problem with time windows publication-title: Oper. Res. – volume: 40 start-page: 790 year: 1992 end-page: 799 ident: br0050 article-title: On the distance constrained vehicle routing problem publication-title: Oper. Res. – volume: 4 start-page: 444 year: 2008 end-page: 454 ident: br0130 article-title: A case study of fuel savings through optimization of MSW transportation routes publication-title: Manag. Environ. Qual. – volume: 14 start-page: 369 year: 2006 end-page: 383 ident: br0120 article-title: Optimizing route choice for lowest fuel consumption-potential effects of a new driver support tool publication-title: Transp. Res., Part C, Emerg. Technol. – volume: 39 start-page: 1419 year: 2012 end-page: 1431 ident: br0140 article-title: Development of a fuel consumption optimization model for the capacitated vehicle routing problem publication-title: Comput. Oper. Res. – year: 2010 ident: br0210 article-title: Integer Programming – volume: 3 start-page: 209 year: 2012 end-page: 214 ident: br0060 article-title: Approximation algorithms for distance constrained vehicle routing problems publication-title: Networks – volume: 434 start-page: 1 year: 2012 end-page: 10 ident: br0190 article-title: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle publication-title: Theoret. Comput. Sci. – volume: 312 start-page: 267 year: 2004 end-page: 280 ident: br0080 article-title: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times publication-title: Theoret. Comput. Sci. – volume: 12 start-page: 300 year: 1964 end-page: 304 ident: br0030 article-title: On an integer program for a delivery problem publication-title: Oper. Res. – volume: 14 start-page: 47 year: 1984 end-page: 61 ident: br0040 article-title: Two exact algorithms for the distance constrained vehicle routing problem publication-title: Networks – volume: 393 start-page: 133 year: 2008 end-page: 146 ident: br0090 article-title: Approximating a vehicle scheduling problem with time windows and handling times publication-title: Theoret. Comput. Sci. – volume: 4 start-page: 285 year: 1985 end-page: 305 ident: br0100 article-title: Local search for routing problems with time windows publication-title: Ann. Oper. Res. – volume: 2 start-page: 8 year: 2008 end-page: 12 ident: br0160 article-title: An approximation algorithm for the capacitated arc routing problem publication-title: Open Oper. Res. J. – start-page: 166 year: 2004 end-page: 174 ident: br0180 article-title: Approximation algorithms for deadline-tsp and vehicle routing with time-windows publication-title: STOC '04 Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing – volume: vol. 2 start-page: 209 year: 1995 end-page: 214 ident: br0200 article-title: Vehicle routing with time windows using genetic algorithms publication-title: Application Handbook of Genetic Algorithms: New Frontiers – start-page: 166 year: 2004 ident: 10.1016/j.tcs.2015.06.009_br0180 article-title: Approximation algorithms for deadline-tsp and vehicle routing with time-windows – volume: 3 start-page: 209 year: 2012 ident: 10.1016/j.tcs.2015.06.009_br0060 article-title: Approximation algorithms for distance constrained vehicle routing problems publication-title: Networks doi: 10.1002/net.20435 – volume: 393 start-page: 133 year: 2008 ident: 10.1016/j.tcs.2015.06.009_br0090 article-title: Approximating a vehicle scheduling problem with time windows and handling times publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2007.12.001 – volume: 2 start-page: 8 year: 2008 ident: 10.1016/j.tcs.2015.06.009_br0160 article-title: An approximation algorithm for the capacitated arc routing problem publication-title: Open Oper. Res. J. doi: 10.2174/1874243200802010008 – volume: 434 start-page: 1 year: 2012 ident: 10.1016/j.tcs.2015.06.009_br0190 article-title: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2012.01.046 – volume: 40 start-page: 342 year: 1992 ident: 10.1016/j.tcs.2015.06.009_br0070 article-title: A new optimization algorithm for the vehicle routing problem with time windows publication-title: Oper. Res. doi: 10.1287/opre.40.2.342 – volume: 6 start-page: 80 year: 1959 ident: 10.1016/j.tcs.2015.06.009_br0020 article-title: The truck dispatching problem publication-title: Manage. Sci. doi: 10.1287/mnsc.6.1.80 – volume: 14 start-page: 47 year: 1984 ident: 10.1016/j.tcs.2015.06.009_br0040 article-title: Two exact algorithms for the distance constrained vehicle routing problem publication-title: Networks doi: 10.1002/net.3230140113 – volume: 312 start-page: 267 year: 2004 ident: 10.1016/j.tcs.2015.06.009_br0080 article-title: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2003.09.010 – year: 2001 ident: 10.1016/j.tcs.2015.06.009_br0150 – volume: 61 start-page: 298 year: 2013 ident: 10.1016/j.tcs.2015.06.009_br0170 article-title: An exact algorithm for the two-echelon capacitated vehicle routing problem publication-title: Oper. Res. doi: 10.1287/opre.1120.1153 – volume: 4 start-page: 444 year: 2008 ident: 10.1016/j.tcs.2015.06.009_br0130 article-title: A case study of fuel savings through optimization of MSW transportation routes publication-title: Manag. Environ. Qual. doi: 10.1108/14777830810878632 – volume: 14 start-page: 369 year: 2006 ident: 10.1016/j.tcs.2015.06.009_br0120 article-title: Optimizing route choice for lowest fuel consumption-potential effects of a new driver support tool publication-title: Transp. Res., Part C, Emerg. Technol. doi: 10.1016/j.trc.2006.10.001 – volume: 4 start-page: 285 year: 1985 ident: 10.1016/j.tcs.2015.06.009_br0100 article-title: Local search for routing problems with time windows publication-title: Ann. Oper. Res. doi: 10.1007/BF02022044 – volume: vol. 2 start-page: 209 year: 1995 ident: 10.1016/j.tcs.2015.06.009_br0200 article-title: Vehicle routing with time windows using genetic algorithms – start-page: 85 year: 1972 ident: 10.1016/j.tcs.2015.06.009_br0010 – volume: 40 start-page: 790 year: 1992 ident: 10.1016/j.tcs.2015.06.009_br0050 article-title: On the distance constrained vehicle routing problem publication-title: Oper. Res. doi: 10.1287/opre.40.4.790 – volume: 39 start-page: 1419 year: 2012 ident: 10.1016/j.tcs.2015.06.009_br0140 article-title: Development of a fuel consumption optimization model for the capacitated vehicle routing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.08.013 – year: 2010 ident: 10.1016/j.tcs.2015.06.009_br0210 – volume: 12 start-page: 300 year: 1964 ident: 10.1016/j.tcs.2015.06.009_br0030 article-title: On an integer program for a delivery problem publication-title: Oper. Res. doi: 10.1287/opre.12.2.300 – start-page: 2014 year: 2014 ident: 10.1016/j.tcs.2015.06.009_br0110 article-title: A quasi-polynomial time approximation scheme for Euclidean CVRPTW |
| SSID | ssj0000576 |
| Score | 2.117892 |
| Snippet | The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 471 |
| SubjectTerms | Algorithms Approximation Bicriteria approximation algorithms Constants Covering Fuel-considered vehicle routing problems Logistics Lower bound Mathematical analysis Route selection Set covering Total unimodularity Windows (intervals) |
| Title | Set covering in fuel-considered vehicle routing problems |
| URI | https://dx.doi.org/10.1016/j.tcs.2015.06.009 https://www.proquest.com/docview/1786186941 |
| Volume | 607 |
| WOSCitedRecordID | wos000366773600017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdg4wEe-BggxpeChHigCqrjfNiPE-ooqBQkOtQ3y_EcSDWlpUmm_fmc43MyFTGNB16ixoqTyvfT3fnufD9CXoMTwWDjwUMwvrBByWMWclXYW6qMAI2pOhaF77NsPufLpfiK_J11RyeQVRW_uBCb_ypqGANh26Oz_yDu_qUwAL9B6HAFscP1WoL_ZpqRtoWZeFqlaM1ZqHteztG5-WmnjLbrtnFH0TtKmfqym7q4dLxRI-_DCI1lH5PBYt4ZAOzHUCXg1NhUlXnZ4-5D68bWA4gwTD01qxKHMfRAEzyDN2goZtMqwlGfeHWaOhZbVIixI1hB2xo74pg_1LaLIKzeNdp2UKdJ11J1LAYb5fPy8y_y-GQ2k4vJcvFm8yu07GE2y45UKjfJfpQlAhT0_tHHyfLTYJOTzGWt8Q_7_HZX6bfz1b95KDu2unNAFvfJXdw5BEdO4g_IDVMdkHuelSNAJX1A7nzuO_HWDwkHOAQeDkFZBTtwCBAOAcIh8HB4RE6OJ4v30xDZMkLN2LgJVaZikcc8EYZxU-S50FEBzrkA06pyRg2NoiJVgubgluWp1llScBsgSAt1yhRnj8leta7MExKwVOQZi3XKQVvn4AQKwwXVqqDCtouLDsnYr5DU2EreMpqcSV8zuJKwqNIuquzqJsUhedtP2bg-Klc9HPtll4ht5-BJAMxV0155EUlQkjbzpSqzbmtJM255IURMn17jmWfk9oD252Sv2bbmBbmlz5uy3r5EaP0GAriHTQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Set+covering+in+fuel-considered+vehicle+routing+problems&rft.jtitle=Theoretical+computer+science&rft.au=Song%2C+Liang&rft.au=Chen%2C+Haibin&rft.au=Gu%2C+Hao&rft.au=Huang%2C+Hejiao&rft.date=2015-11-01&rft.issn=0304-3975&rft.volume=607&rft.spage=471&rft.epage=479&rft_id=info:doi/10.1016%2Fj.tcs.2015.06.009&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |