Approximate and exact algorithms for an energy minimization traveling salesman problem
Energy saving is a great challenge for clean transportation. In this paper, we study the Energy Minimization Traveling Salesman Problem (EMTSP), which is a generation of the classical Traveling Salesman Problem (TSP), and an important theoretical basis and a special case of the Energy Minimization V...
Uložené v:
| Vydané v: | Journal of cleaner production Ročník 249; s. 119433 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
10.03.2020
Elsevier |
| Predmet: | |
| ISSN: | 0959-6526, 1879-1786 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Energy saving is a great challenge for clean transportation. In this paper, we study the Energy Minimization Traveling Salesman Problem (EMTSP), which is a generation of the classical Traveling Salesman Problem (TSP), and an important theoretical basis and a special case of the Energy Minimization Vehicle Routing Problem (EMVRP). The objective of the studied problem is to minimize the sum of the product of load (including curb weight of the vehicle) and traveled distances. An approximation algorithm based on the Christofides’s Heuristic is proposed and its worst-case ratio bound is proven. A branch and bound (B&B) algorithm integrated with a fast 1-tree based lower bound is developed to obtain optimal solutions. The results of computational experiments show the efficiency and the effectiveness of the B&B algorithm, as well as the heuristic methods. |
|---|---|
| AbstractList | Energy saving is a great challenge for clean transportation. In this paper, we study the Energy Minimization Traveling Salesman Problem (EMTSP), which is a generation of the classical Traveling Salesman Problem (TSP), and an important theoretical basis and a special case of the Energy Minimization Vehicle Routing Problem (EMVRP). The objective of the studied problem is to minimize the sum of the product of load (including curb weight of the vehicle) and traveled distances. An approximation algorithm based on the Christofides's Heuristic is proposed and its worst-case ratio bound is proven. A branch and bound (B&B) algorithm integrated with a fast 1-tree based lower bound is developed to obtain optimal solutions. The results of computational experiments show the efficiency and the effectiveness of the B&B algorithm, as well as the heuristic methods. |
| ArticleNumber | 119433 |
| Author | Wang, Shijin Chu, Feng Liu, Ming |
| Author_xml | – sequence: 1 givenname: Shijin surname: Wang fullname: Wang, Shijin email: shijinwang@tongji.edu.cn organization: School of Economics & Management, Tongji University, Shanghai, 200092, China – sequence: 2 givenname: Ming surname: Liu fullname: Liu, Ming email: mingliu@tongji.edu.cn organization: School of Economics & Management, Tongji University, Shanghai, 200092, China – sequence: 3 givenname: Feng surname: Chu fullname: Chu, Feng organization: Laboratoire IBISC, Univ-Évry, Université Paris-Saclay, Évry, 91025, France |
| BackLink | https://hal.science/hal-02427206$$DView record in HAL |
| BookMark | eNqFkMFq3DAQhkVJoJs0jxDwsT14O5JtyaaHsoS2KSz0EnIVsjTeaJGlraQsSZ6-2jr00EtOgtH3_8x8F-TMB4-EXFNYU6D883691w4PMawZ0GFN6dA2zTuyor0Yaip6fkZWMHRDzTvG35OLlPYAVIBoV-R-cyjBJzurjJXypsInpXOl3C5Emx_mVE0hlo8KPcbdczVbb2f7orINvspRHdFZv6uScpjmgpWy0eH8gZxPyiW8en0vyd33b3c3t_X214-fN5ttrRvBc20MiL7lPROTQMXHsTdspGYSiosJVK91B6YRPaOtGIdm6jQ0jW6NKncKoM0l-bTUPignD7FcEZ9lUFbebrbyNAPWMsGAH0_sx4UtK_5-xJTlbJNG55TH8JgkawE6RoeBF7RbUB1DShGnf90U5Em53MtX5fKkXC7KS-7Lfzlt819VxZR1b6a_Lmkswo4Wo0zaotdobESdpQn2jYY_ypmi-g |
| CitedBy_id | crossref_primary_10_1080_23311916_2023_2231725 crossref_primary_10_1016_j_cie_2022_108024 crossref_primary_10_1016_j_aei_2022_101816 crossref_primary_10_1016_j_apenergy_2024_124092 crossref_primary_10_1007_s11116_023_10456_3 crossref_primary_10_1111_itor_12991 crossref_primary_10_1088_1674_1056_ad95f1 crossref_primary_10_1080_08839514_2021_1992138 crossref_primary_10_1016_j_istruc_2025_109926 crossref_primary_10_1016_j_aei_2023_102311 crossref_primary_10_1007_s42524_023_0265_1 crossref_primary_10_1016_j_eswa_2023_120300 crossref_primary_10_3390_en16041967 crossref_primary_10_1016_j_disopt_2022_100710 crossref_primary_10_1016_j_cie_2024_110736 |
| Cites_doi | 10.1016/j.ijpe.2016.03.008 10.1016/j.jclepro.2019.03.185 10.1016/j.ejor.2019.01.067 10.1016/j.jclepro.2019.05.344 10.1016/j.ejor.2013.12.033 10.1016/j.cor.2019.04.018 10.1016/j.asoc.2015.10.064 10.1287/opre.46.2.247 10.1016/S0377-2217(03)00377-1 10.1016/j.jclepro.2019.03.323 10.1287/trsc.2015.0651 10.1016/j.tre.2011.08.001 10.1287/trsc.2013.0500 10.1016/j.trb.2013.08.008 10.1287/trsc.2015.0593 10.1016/j.ejor.2016.11.026 10.1016/j.trb.2014.11.004 10.1016/j.trd.2010.08.003 10.1016/j.jclepro.2017.10.124 10.1016/j.eswa.2013.07.107 10.1016/j.orl.2013.07.007 10.1016/j.cor.2011.08.013 10.1016/j.trd.2017.01.003 10.1287/ijoc.2015.0666 10.1016/j.cor.2018.10.019 10.1016/j.omega.2016.06.001 10.1111/j.1937-5956.2012.01338.x 10.1016/j.cor.2017.06.023 10.1016/j.trb.2019.02.008 10.1016/0041-5553(69)90061-5 10.1287/ijoc.2018.0810 10.1016/j.tre.2017.06.003 10.1016/j.jclepro.2018.08.075 10.1016/j.ejor.2015.09.009 10.1016/j.jclepro.2016.11.115 10.1016/j.tre.2014.09.003 10.1016/j.trb.2016.09.006 10.1016/j.tre.2016.01.011 10.1016/j.jclepro.2018.05.046 10.1016/j.ejor.2013.07.038 10.1287/trsc.2015.0608 10.1016/j.trc.2015.09.009 10.1016/j.ejor.2013.08.002 10.1016/j.trb.2014.09.008 10.1287/trsc.1090.0301 10.1016/j.ijpe.2014.11.003 10.1016/j.trb.2011.02.004 10.1016/j.ejor.2014.12.009 10.1016/j.trb.2019.03.009 10.1016/j.ejor.2012.06.044 10.1016/j.eswa.2018.01.052 10.1287/trsc.2016.0734 10.1016/j.cor.2018.07.012 10.1007/BF01584346 10.1016/j.trd.2017.04.016 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier Ltd Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2019 Elsevier Ltd – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7S9 L.6 1XC |
| DOI | 10.1016/j.jclepro.2019.119433 |
| DatabaseName | CrossRef AGRICOLA AGRICOLA - Academic Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef AGRICOLA AGRICOLA - Academic |
| DatabaseTitleList | AGRICOLA |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1879-1786 |
| ExternalDocumentID | oai:HAL:hal-02427206v1 10_1016_j_jclepro_2019_119433 S0959652619343033 |
| GroupedDBID | --K --M ..I .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JM 9JN AABNK AACTN AAEDT AAEDW AAHCO AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARJD AAXUO ABFYP ABJNI ABLST ABMAC ABYKQ ACDAQ ACGFS ACRLP ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AFXIZ AGHFR AGUBO AGYEJ AHEUO AHHHB AHIDL AIEXJ AIKHN AITUG AJOXV AKIFW ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AXJTR BELTK BKOJK BLECG BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 FDB FIRID FNPLU FYGXN G-Q GBLVA HMC IHE J1W JARJE K-O KCYFY KOM LY9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RNS ROL RPZ SCC SDF SDG SDP SES SPC SPCBC SSJ SSR SSZ T5K ~G- 29K 9DU AAHBH AAQXK AATTM AAXKI AAYWO AAYXX ABFNM ABWVN ABXDB ACLOT ACRPL ACVFH ADCNI ADHUB ADMUD ADNMO AEGFY AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION D-I EFKBS EJD FEDTE FGOYB G-2 HVGLF HZ~ R2- SEN SEW WUQ ZY4 ~HD 7S9 L.6 1XC |
| ID | FETCH-LOGICAL-c376t-dd07846827f7ea6bb8d2b1df7a67f0a8cc50d3782147b93f5c033c4da0197013 |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000507856300118&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0959-6526 |
| IngestDate | Tue Oct 14 20:30:04 EDT 2025 Thu Oct 02 10:10:10 EDT 2025 Tue Nov 18 22:39:09 EST 2025 Sat Nov 29 07:03:39 EST 2025 Fri Feb 23 02:48:49 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Traveling salesman problem Energy minimization Branch and bound Approximation algorithm Christofides’s heuristic Christofides's heuristic |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c376t-dd07846827f7ea6bb8d2b1df7a67f0a8cc50d3782147b93f5c033c4da0197013 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0003-3190-5008 0000-0001-6658-924X 0000-0003-1225-8319 |
| PQID | 2400521996 |
| PQPubID | 24069 |
| ParticipantIDs | hal_primary_oai_HAL_hal_02427206v1 proquest_miscellaneous_2400521996 crossref_primary_10_1016_j_jclepro_2019_119433 crossref_citationtrail_10_1016_j_jclepro_2019_119433 elsevier_sciencedirect_doi_10_1016_j_jclepro_2019_119433 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-03-10 |
| PublicationDateYYYYMMDD | 2020-03-10 |
| PublicationDate_xml | – month: 03 year: 2020 text: 2020-03-10 day: 10 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of cleaner production |
| PublicationYear | 2020 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Felipe, Ortuño, Righini, Tirado (bib16) 2014; 71 Zachariadis, Tarantilis, Kiranoudis (bib61) 2015; 71 Bektaş, Laporte (bib5) 2011; 45 Poljak (bib41) 1969; 9 Eshtehadi, Fathian, Demir (bib15) 2017; 51 Franceschetti, Honhon, Van Woensel, Bektaş, Laporte (bib17) 2013; 56 Cattaruzza, Absi, Feillet (bib7) 2016; 50 Xiao, Zuo, Kaku, Zhou, Pan (bib59) 2019; 225 Lin, Choy, Ho, Chung, Lam (bib37) 2014; 41 Bektaş, Gouveia (bib4) 2014; 236 Li, Wang, Zhang (bib35) 2018; 201 Tran, Araujo, Beck (bib54) 2016; 28 Dabia, Demir, Woensel (bib10) 2017; 51 Qian, Eglese (bib43) 2016; 248 Shor (bib47) 1985 Kara, Laporte, Bektaş (bib27) 2004; 158 Abad, Vahdani, Sharifi, Etebari (bib1) 2018; 193 Holmberg, Hellstrand (bib25) 1998; 46 Erdoğan, Miller-Hooks (bib14) 2012; 48 Goffin (bib23) 1977; 13 Demir, Bektaş, Laporte (bib13) 2014; 232 Macrina, Pugliese, Guerriero, Laporte (bib39) 2019; 101 Laporte (bib33) 2009; 43 Li, Soleimani, Zohal (bib36) 2019; 227 Yu, Wang, Wang, Huang (bib60) 2019; 122 Çimen, Soysal (bib8) 2017; 54 Hardy, Littlewood, Polya (bib24) 1979 Toth, Vigo (bib53) 2014 Demir, Bektaş, Laporte (bib11) 2012; 223 Suzuki (bib50) 2011; 16 Andelmin, Bartolini (bib2) 2017; 51 Santos, Mateus, Cunha (bib46) 2015; 49 Fukasawa, He, Song (bib19) 2016; 50 Soysal, Çimen (bib49) 2017; 88 Kramer, Subramanian, Vidal, Cabral (bib32) 2015; 243 Xiao, Zhao, Kaku, Xu (bib58) 2012; 39 Fukasawa, He, Santos, Song (bib21) 2018; 30 Soleimani, Chaharlang, Ghaderi (bib48) 2018; 172 Bruglieri, Mancini, Pezzella, Pisacane (bib6) 2019; 103 Cook, Cunningham, Pulleyblank, Schrijver (bib9) 1998 Montoya, Guéret, Mendoza, Villegas (bib40) 2016; 70 Demir, Bektaş, Laporte (bib12) 2014; 237 Franceschetti, Demir, Honhon, Van Woensel, Laporte, Stobbe (bib18) 2017; 259 Jabali, Van Woensel, Kok (bib26) 2012; 21 Koç, Karaoglan (bib29) 2016; 39 Kara, Kara, Yetis (bib28) 2007 Tiwari, Chang (bib52) 2015; 164 Macrina, Laporte, Guerriero, Pugliese (bib38) 2019; 276 Xiao, Konak (bib57) 2017; 167 Wang, Assogba, Fan, Xu, Liu, Wang (bib55) 2019; 232 Gaur, Mudgal, Singh (bib22) 2013; 41 Xiao, Konak (bib56) 2016; 88 Koç, Bektaş, Jabali, Laporte (bib30) 2014; 70 Poonthalir, Nadarajan (bib42) 2018; 100 Qiu, Qiao, Pardalos (bib44) 2017; 68 Leggieri, Haouari (bib34) 2017; 104 Suzuki (bib51) 2016; 176 Raeesi, Zografos (bib45) 2019; 122 Fukasawa, He, Song (bib20) 2016; 94 Andelmin, Bartolini (bib3) 2019; 109 Gaur (10.1016/j.jclepro.2019.119433_bib22) 2013; 41 Qiu (10.1016/j.jclepro.2019.119433_bib44) 2017; 68 Laporte (10.1016/j.jclepro.2019.119433_bib33) 2009; 43 Leggieri (10.1016/j.jclepro.2019.119433_bib34) 2017; 104 Xiao (10.1016/j.jclepro.2019.119433_bib56) 2016; 88 Bektaş (10.1016/j.jclepro.2019.119433_bib4) 2014; 236 Montoya (10.1016/j.jclepro.2019.119433_bib40) 2016; 70 Kramer (10.1016/j.jclepro.2019.119433_bib32) 2015; 243 Xiao (10.1016/j.jclepro.2019.119433_bib57) 2017; 167 Andelmin (10.1016/j.jclepro.2019.119433_bib2) 2017; 51 Cook (10.1016/j.jclepro.2019.119433_bib9) 1998 Xiao (10.1016/j.jclepro.2019.119433_bib59) 2019; 225 Poonthalir (10.1016/j.jclepro.2019.119433_bib42) 2018; 100 Li (10.1016/j.jclepro.2019.119433_bib35) 2018; 201 Wang (10.1016/j.jclepro.2019.119433_bib55) 2019; 232 Felipe (10.1016/j.jclepro.2019.119433_bib16) 2014; 71 Goffin (10.1016/j.jclepro.2019.119433_bib23) 1977; 13 Kara (10.1016/j.jclepro.2019.119433_bib27) 2004; 158 Tiwari (10.1016/j.jclepro.2019.119433_bib52) 2015; 164 Çimen (10.1016/j.jclepro.2019.119433_bib8) 2017; 54 Lin (10.1016/j.jclepro.2019.119433_bib37) 2014; 41 Kara (10.1016/j.jclepro.2019.119433_bib28) 2007 Suzuki (10.1016/j.jclepro.2019.119433_bib50) 2011; 16 Suzuki (10.1016/j.jclepro.2019.119433_bib51) 2016; 176 Santos (10.1016/j.jclepro.2019.119433_bib46) 2015; 49 Poljak (10.1016/j.jclepro.2019.119433_bib41) 1969; 9 Macrina (10.1016/j.jclepro.2019.119433_bib39) 2019; 101 Soleimani (10.1016/j.jclepro.2019.119433_bib48) 2018; 172 Koç (10.1016/j.jclepro.2019.119433_bib30) 2014; 70 Jabali (10.1016/j.jclepro.2019.119433_bib26) 2012; 21 Tran (10.1016/j.jclepro.2019.119433_bib54) 2016; 28 Bektaş (10.1016/j.jclepro.2019.119433_bib5) 2011; 45 Erdoğan (10.1016/j.jclepro.2019.119433_bib14) 2012; 48 Franceschetti (10.1016/j.jclepro.2019.119433_bib18) 2017; 259 Koç (10.1016/j.jclepro.2019.119433_bib29) 2016; 39 Soysal (10.1016/j.jclepro.2019.119433_bib49) 2017; 88 Fukasawa (10.1016/j.jclepro.2019.119433_bib19) 2016; 50 Qian (10.1016/j.jclepro.2019.119433_bib43) 2016; 248 Dabia (10.1016/j.jclepro.2019.119433_bib10) 2017; 51 Franceschetti (10.1016/j.jclepro.2019.119433_bib17) 2013; 56 Fukasawa (10.1016/j.jclepro.2019.119433_bib21) 2018; 30 Cattaruzza (10.1016/j.jclepro.2019.119433_bib7) 2016; 50 Raeesi (10.1016/j.jclepro.2019.119433_bib45) 2019; 122 Andelmin (10.1016/j.jclepro.2019.119433_bib3) 2019; 109 Bruglieri (10.1016/j.jclepro.2019.119433_bib6) 2019; 103 Demir (10.1016/j.jclepro.2019.119433_bib12) 2014; 237 Li (10.1016/j.jclepro.2019.119433_bib36) 2019; 227 Hardy (10.1016/j.jclepro.2019.119433_bib24) 1979 Demir (10.1016/j.jclepro.2019.119433_bib13) 2014; 232 Abad (10.1016/j.jclepro.2019.119433_bib1) 2018; 193 Zachariadis (10.1016/j.jclepro.2019.119433_bib61) 2015; 71 Toth (10.1016/j.jclepro.2019.119433_bib53) 2014 Yu (10.1016/j.jclepro.2019.119433_bib60) 2019; 122 Macrina (10.1016/j.jclepro.2019.119433_bib38) 2019; 276 Fukasawa (10.1016/j.jclepro.2019.119433_bib20) 2016; 94 Holmberg (10.1016/j.jclepro.2019.119433_bib25) 1998; 46 Demir (10.1016/j.jclepro.2019.119433_bib11) 2012; 223 Eshtehadi (10.1016/j.jclepro.2019.119433_bib15) 2017; 51 Shor (10.1016/j.jclepro.2019.119433_bib47) 1985 Xiao (10.1016/j.jclepro.2019.119433_bib58) 2012; 39 |
| References_xml | – year: 1979 ident: bib24 article-title: Inequalities (Cambridge Mathematical Library) – volume: 276 start-page: 971 year: 2019 end-page: 982 ident: bib38 article-title: An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows publication-title: Eur. J. Oper. Res. – volume: 109 start-page: 43 year: 2019 end-page: 63 ident: bib3 article-title: A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation publication-title: Comput. Oper. Res. – volume: 45 start-page: 1232 year: 2011 end-page: 1250 ident: bib5 article-title: The pollution-routing problem publication-title: Transp. Res. Part B – volume: 41 start-page: 576 year: 2013 end-page: 580 ident: bib22 article-title: Routing vehicles to minimize fuel consumption publication-title: Oper. Res. Lett. – volume: 51 start-page: 607 year: 2017 end-page: 628 ident: bib10 article-title: An exact approach for a variant of the pollution-routing problem publication-title: Transp. Sci. – year: 2014 ident: bib53 article-title: The Vehicle Routing Problem – volume: 56 start-page: 265 year: 2013 end-page: 293 ident: bib17 article-title: The time-dependent pollution-routing problem publication-title: Transp. Res. Part B – volume: 158 start-page: 793 year: 2004 end-page: 795 ident: bib27 article-title: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem publication-title: Eur. J. Oper. Res. – volume: 54 start-page: 82 year: 2017 end-page: 98 ident: bib8 article-title: Time-dependent green vehicle routing problem with stochastic vehicle speeds: an approximate dynamic programming algorithm publication-title: Transp. Res. Part D – year: 1985 ident: bib47 article-title: Minimization Methods for Non-differentiable Functions – volume: 103 start-page: 109 year: 2019 end-page: 122 ident: bib6 article-title: A path-based solution approach for the green vehicle routing problem publication-title: Comput. Oper. Res. – volume: 223 start-page: 346 year: 2012 end-page: 359 ident: bib11 article-title: An adaptive large neighborhood search heuristic for the pollution-routing problem publication-title: Eur. J. Oper. Res. – volume: 104 start-page: 97 year: 2017 end-page: 112 ident: bib34 article-title: A practical solution approach for the green vehicle routing problem publication-title: Transp. Res. Part E – volume: 68 start-page: 49 year: 2017 end-page: 61 ident: bib44 article-title: A branch-and-price algorithm for production routing problems with carbon cap-and-trade publication-title: Omega – year: 1998 ident: bib9 article-title: Combinatorial Optimization – volume: 248 start-page: 840 year: 2016 end-page: 848 ident: bib43 article-title: Fuel emission optimization in vehicle routing problems with time-varying speeds publication-title: Eur. J. Oper. Res. – start-page: 62 year: 2007 end-page: 71 ident: bib28 article-title: Energy minimizing vehicle routing problem publication-title: Combinatorial Optimization and Applications – volume: 236 start-page: 820 year: 2014 end-page: 832 ident: bib4 article-title: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints publication-title: Eur. J. Oper. Res. – volume: 227 start-page: 1161 year: 2019 end-page: 1172 ident: bib36 article-title: An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives publication-title: J. Clean. Prod. – volume: 193 start-page: 784 year: 2018 end-page: 801 ident: bib1 article-title: A bi-objective model for pickup and delivery pollution-routing problem with integration and consolidation shipments in cross-docking system publication-title: J. Clean. Prod. – volume: 51 start-page: 351 year: 2017 end-page: 363 ident: bib15 article-title: Robust solutions to the pollution-routing problem with demand and travel time uncertainty publication-title: Transp. Res. Part D – volume: 176 start-page: 143 year: 2016 end-page: 153 ident: bib51 article-title: A dual-objective metaheuristic approach to solve practical pollution routing problem publication-title: Int. J. Prod. Econ. – volume: 122 start-page: 457 year: 2019 end-page: 485 ident: bib45 article-title: The multi-objective Steiner pollution-routing problem on congested urban road networks publication-title: Transp. Res. Part B – volume: 88 start-page: 297 year: 2017 end-page: 305 ident: bib49 article-title: A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem publication-title: Comput. Oper. Res. – volume: 28 start-page: 83 year: 2016 end-page: 95 ident: bib54 article-title: Decomposition methods for the parallel machine scheduling problem with setups publication-title: Inf. J. Comput. – volume: 50 start-page: 676 year: 2016 end-page: 693 ident: bib7 article-title: The multi-trip vehicle routing problem with time windows and release dates publication-title: Transp. Sci. – volume: 259 start-page: 972 year: 2017 end-page: 991 ident: bib18 article-title: A metaheuristic for the time-dependent pollution-routing problem publication-title: Eur. J. Oper. Res. – volume: 39 start-page: 154 year: 2016 end-page: 164 ident: bib29 article-title: The green vehicle routing problem: a heuristic based exact solution approach publication-title: Appl. Soft Comput. – volume: 167 start-page: 1450 year: 2017 end-page: 1463 ident: bib57 article-title: A genetic algorithm with exact dynamic programming for the green vehicle routing and scheduling problem publication-title: J. Clean. Prod. – volume: 243 start-page: 523 year: 2015 end-page: 539 ident: bib32 article-title: A mateheuristic approach for the Pollution-Routing Problem publication-title: Eur. J. Oper. Res. – volume: 50 start-page: 23 year: 2016 end-page: 34 ident: bib19 article-title: A branch-cut-and-price algorithm for the energy minimization vehicle routing problem publication-title: Transp. Sci. – volume: 21 start-page: 1060 year: 2012 end-page: 1074 ident: bib26 article-title: Analysis of travel times and CO publication-title: Prod. Oper. Manag. – volume: 164 start-page: 379 year: 2015 end-page: 387 ident: bib52 article-title: A block recombination approach to solve green vehicle routing problem publication-title: Int. J. Prod. Econ. – volume: 225 start-page: 647 year: 2019 end-page: 663 ident: bib59 article-title: Development of energy consumption optimization model for the electric vehicle routing problem with time windows publication-title: J. Clean. Prod. – volume: 122 start-page: 511 year: 2019 end-page: 527 ident: bib60 article-title: A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows publication-title: Transp. Res. Part B – volume: 201 start-page: 896 year: 2018 end-page: 908 ident: bib35 article-title: Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emissions publication-title: J. Clean. Prod. – volume: 46 start-page: 247 year: 1998 end-page: 259 ident: bib25 article-title: Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound publication-title: Oper. Res. – volume: 232 start-page: 464 year: 2014 end-page: 478 ident: bib13 article-title: The bi-objective pollution-routing problem publication-title: Eur. J. Oper. Res. – volume: 237 start-page: 775 year: 2014 end-page: 793 ident: bib12 article-title: A review of recent research on green road freight transportation publication-title: Eur. J. Oper. Res. – volume: 16 start-page: 73 year: 2011 end-page: 77 ident: bib50 article-title: A new truck-routing approach for reducing fuel consumption and pollutants emission publication-title: Transp. Res. Part D – volume: 51 start-page: 1288 year: 2017 end-page: 1303 ident: bib2 article-title: An exact algorithm for the green vehicle routing problem publication-title: Transp. Sci. – volume: 172 start-page: 960 year: 2018 end-page: 970 ident: bib48 article-title: Collection and distribution of returned-remanufactured products in a vehicle routing problem with pickup and delivery considering sustainable and green criteria publication-title: J. Clean. Prod. – volume: 30 start-page: 694 year: 2018 end-page: 709 ident: bib21 article-title: A joint vehicle routing and speed optimization problem publication-title: Inf. J. Comput. – volume: 100 start-page: 131 year: 2018 end-page: 144 ident: bib42 article-title: A fuel efficient green vehicle routing problem with varying speed constraint (F-GVRP) publication-title: Expert Syst. Appl. – volume: 41 start-page: 1118 year: 2014 end-page: 1138 ident: bib37 article-title: Survey of green vehicle routing problem: past and future trends publication-title: Expert Syst. Appl. – volume: 232 start-page: 12 year: 2019 end-page: 29 ident: bib55 article-title: Multi-depot green vehicle routing problem with shared transportation resource: integration of time-dependent speed and piecewise penalty cost publication-title: J. Clean. Prod. – volume: 39 start-page: 1419 year: 2012 end-page: 1431 ident: bib58 article-title: Development of a fuel consumption optimization model for the capacitated vehicle routing problem publication-title: Comput. Oper. Res. – volume: 70 start-page: 113 year: 2016 end-page: 128 ident: bib40 article-title: A multi-space sampling heuristic for the green vehicle routing problem publication-title: Transp. Res. Part C – volume: 88 start-page: 146 year: 2016 end-page: 166 ident: bib56 article-title: The heterogenous green vehicle routing and scheduling problem with time-varying traffic congestion publication-title: Transp. Res. Part E – volume: 49 start-page: 355 year: 2015 end-page: 368 ident: bib46 article-title: A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem publication-title: Transp. Sci. – volume: 43 start-page: 408 year: 2009 end-page: 416 ident: bib33 article-title: Fifty years of vehicle routing publication-title: Transp. Sci. – volume: 71 start-page: 111 year: 2014 end-page: 128 ident: bib16 article-title: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges publication-title: Transp. Res. Part E – volume: 13 start-page: 329 year: 1977 end-page: 347 ident: bib23 article-title: On convergence rates of subgradient optimization methods publication-title: Math. Program. – volume: 71 start-page: 158 year: 2015 end-page: 181 ident: bib61 article-title: The load-dependent vehicle routing problem and its pick-up and delivery extension publication-title: Transp. Res. Part B – volume: 48 start-page: 100 year: 2012 end-page: 114 ident: bib14 article-title: A green vehicle routing problem publication-title: Transp. Res. Part E – volume: 9 start-page: 14 year: 1969 end-page: 29 ident: bib41 article-title: Minimization of unsmooth functionals publication-title: USSR Comput. Math. Math. Phys. – volume: 70 start-page: 239 year: 2014 end-page: 254 ident: bib30 article-title: The fleet size and mix pollution-routing problem publication-title: Transp. Res. Part B – volume: 101 start-page: 183 year: 2019 end-page: 199 ident: bib39 article-title: The green mixed fleet vehicle routing problem with partial battery recharging and time windows publication-title: Comput. Oper. Res. – volume: 94 start-page: 61 year: 2016 end-page: 79 ident: bib20 article-title: A disjunctive convex programming approach to the pollution-routing problem publication-title: Transp. Res. Part B – volume: 176 start-page: 143 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib51 article-title: A dual-objective metaheuristic approach to solve practical pollution routing problem publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2016.03.008 – volume: 227 start-page: 1161 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib36 article-title: An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2019.03.185 – volume: 276 start-page: 971 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib38 article-title: An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.01.067 – volume: 232 start-page: 12 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib55 article-title: Multi-depot green vehicle routing problem with shared transportation resource: integration of time-dependent speed and piecewise penalty cost publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2019.05.344 – volume: 237 start-page: 775 year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib12 article-title: A review of recent research on green road freight transportation publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.12.033 – volume: 109 start-page: 43 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib3 article-title: A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.04.018 – year: 1998 ident: 10.1016/j.jclepro.2019.119433_bib9 – volume: 39 start-page: 154 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib29 article-title: The green vehicle routing problem: a heuristic based exact solution approach publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.10.064 – volume: 46 start-page: 247 issue: 2 year: 1998 ident: 10.1016/j.jclepro.2019.119433_bib25 article-title: Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound publication-title: Oper. Res. doi: 10.1287/opre.46.2.247 – volume: 158 start-page: 793 year: 2004 ident: 10.1016/j.jclepro.2019.119433_bib27 article-title: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(03)00377-1 – volume: 225 start-page: 647 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib59 article-title: Development of energy consumption optimization model for the electric vehicle routing problem with time windows publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2019.03.323 – volume: 51 start-page: 607 issue: 2 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib10 article-title: An exact approach for a variant of the pollution-routing problem publication-title: Transp. Sci. doi: 10.1287/trsc.2015.0651 – volume: 48 start-page: 100 issue: 1 year: 2012 ident: 10.1016/j.jclepro.2019.119433_bib14 article-title: A green vehicle routing problem publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2011.08.001 – volume: 49 start-page: 355 issue: 2 year: 2015 ident: 10.1016/j.jclepro.2019.119433_bib46 article-title: A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem publication-title: Transp. Sci. doi: 10.1287/trsc.2013.0500 – volume: 56 start-page: 265 year: 2013 ident: 10.1016/j.jclepro.2019.119433_bib17 article-title: The time-dependent pollution-routing problem publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2013.08.008 – volume: 50 start-page: 23 issue: 1 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib19 article-title: A branch-cut-and-price algorithm for the energy minimization vehicle routing problem publication-title: Transp. Sci. doi: 10.1287/trsc.2015.0593 – volume: 259 start-page: 972 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib18 article-title: A metaheuristic for the time-dependent pollution-routing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.11.026 – volume: 71 start-page: 158 year: 2015 ident: 10.1016/j.jclepro.2019.119433_bib61 article-title: The load-dependent vehicle routing problem and its pick-up and delivery extension publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2014.11.004 – volume: 16 start-page: 73 year: 2011 ident: 10.1016/j.jclepro.2019.119433_bib50 article-title: A new truck-routing approach for reducing fuel consumption and pollutants emission publication-title: Transp. Res. Part D doi: 10.1016/j.trd.2010.08.003 – volume: 172 start-page: 960 year: 2018 ident: 10.1016/j.jclepro.2019.119433_bib48 article-title: Collection and distribution of returned-remanufactured products in a vehicle routing problem with pickup and delivery considering sustainable and green criteria publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2017.10.124 – volume: 41 start-page: 1118 year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib37 article-title: Survey of green vehicle routing problem: past and future trends publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2013.07.107 – year: 1979 ident: 10.1016/j.jclepro.2019.119433_bib24 – volume: 41 start-page: 576 issue: 6 year: 2013 ident: 10.1016/j.jclepro.2019.119433_bib22 article-title: Routing vehicles to minimize fuel consumption publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2013.07.007 – volume: 39 start-page: 1419 year: 2012 ident: 10.1016/j.jclepro.2019.119433_bib58 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 – volume: 51 start-page: 351 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib15 article-title: Robust solutions to the pollution-routing problem with demand and travel time uncertainty publication-title: Transp. Res. Part D doi: 10.1016/j.trd.2017.01.003 – volume: 28 start-page: 83 issue: 1 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib54 article-title: Decomposition methods for the parallel machine scheduling problem with setups publication-title: Inf. J. Comput. doi: 10.1287/ijoc.2015.0666 – volume: 103 start-page: 109 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib6 article-title: A path-based solution approach for the green vehicle routing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.10.019 – volume: 68 start-page: 49 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib44 article-title: A branch-and-price algorithm for production routing problems with carbon cap-and-trade publication-title: Omega doi: 10.1016/j.omega.2016.06.001 – volume: 21 start-page: 1060 year: 2012 ident: 10.1016/j.jclepro.2019.119433_bib26 article-title: Analysis of travel times and CO2 emissions in time-dependent vehicle routing publication-title: Prod. Oper. Manag. doi: 10.1111/j.1937-5956.2012.01338.x – volume: 88 start-page: 297 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib49 article-title: A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2017.06.023 – volume: 122 start-page: 457 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib45 article-title: The multi-objective Steiner pollution-routing problem on congested urban road networks publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2019.02.008 – volume: 9 start-page: 14 issue: 3 year: 1969 ident: 10.1016/j.jclepro.2019.119433_bib41 article-title: Minimization of unsmooth functionals publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(69)90061-5 – volume: 30 start-page: 694 issue: 4 year: 2018 ident: 10.1016/j.jclepro.2019.119433_bib21 article-title: A joint vehicle routing and speed optimization problem publication-title: Inf. J. Comput. doi: 10.1287/ijoc.2018.0810 – volume: 104 start-page: 97 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib34 article-title: A practical solution approach for the green vehicle routing problem publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2017.06.003 – volume: 201 start-page: 896 year: 2018 ident: 10.1016/j.jclepro.2019.119433_bib35 article-title: Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emissions publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2018.08.075 – volume: 248 start-page: 840 issue: 3 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib43 article-title: Fuel emission optimization in vehicle routing problems with time-varying speeds publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.09.009 – volume: 167 start-page: 1450 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib57 article-title: A genetic algorithm with exact dynamic programming for the green vehicle routing and scheduling problem publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2016.11.115 – volume: 71 start-page: 111 year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib16 article-title: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2014.09.003 – volume: 94 start-page: 61 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib20 article-title: A disjunctive convex programming approach to the pollution-routing problem publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2016.09.006 – volume: 88 start-page: 146 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib56 article-title: The heterogenous green vehicle routing and scheduling problem with time-varying traffic congestion publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2016.01.011 – volume: 193 start-page: 784 year: 2018 ident: 10.1016/j.jclepro.2019.119433_bib1 article-title: A bi-objective model for pickup and delivery pollution-routing problem with integration and consolidation shipments in cross-docking system publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2018.05.046 – volume: 236 start-page: 820 year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib4 article-title: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.07.038 – volume: 50 start-page: 676 issue: 2 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib7 article-title: The multi-trip vehicle routing problem with time windows and release dates publication-title: Transp. Sci. doi: 10.1287/trsc.2015.0608 – volume: 70 start-page: 113 year: 2016 ident: 10.1016/j.jclepro.2019.119433_bib40 article-title: A multi-space sampling heuristic for the green vehicle routing problem publication-title: Transp. Res. Part C doi: 10.1016/j.trc.2015.09.009 – volume: 232 start-page: 464 year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib13 article-title: The bi-objective pollution-routing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.08.002 – volume: 70 start-page: 239 year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib30 article-title: The fleet size and mix pollution-routing problem publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2014.09.008 – volume: 43 start-page: 408 issue: 4 year: 2009 ident: 10.1016/j.jclepro.2019.119433_bib33 article-title: Fifty years of vehicle routing publication-title: Transp. Sci. doi: 10.1287/trsc.1090.0301 – volume: 164 start-page: 379 year: 2015 ident: 10.1016/j.jclepro.2019.119433_bib52 article-title: A block recombination approach to solve green vehicle routing problem publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2014.11.003 – volume: 45 start-page: 1232 year: 2011 ident: 10.1016/j.jclepro.2019.119433_bib5 article-title: The pollution-routing problem publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2011.02.004 – volume: 243 start-page: 523 year: 2015 ident: 10.1016/j.jclepro.2019.119433_bib32 article-title: A mateheuristic approach for the Pollution-Routing Problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.12.009 – volume: 122 start-page: 511 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib60 article-title: A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2019.03.009 – volume: 223 start-page: 346 year: 2012 ident: 10.1016/j.jclepro.2019.119433_bib11 article-title: An adaptive large neighborhood search heuristic for the pollution-routing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.06.044 – volume: 100 start-page: 131 year: 2018 ident: 10.1016/j.jclepro.2019.119433_bib42 article-title: A fuel efficient green vehicle routing problem with varying speed constraint (F-GVRP) publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2018.01.052 – volume: 51 start-page: 1288 issue: 4 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib2 article-title: An exact algorithm for the green vehicle routing problem publication-title: Transp. Sci. doi: 10.1287/trsc.2016.0734 – year: 2014 ident: 10.1016/j.jclepro.2019.119433_bib53 – year: 1985 ident: 10.1016/j.jclepro.2019.119433_bib47 – start-page: 62 year: 2007 ident: 10.1016/j.jclepro.2019.119433_bib28 article-title: Energy minimizing vehicle routing problem – volume: 101 start-page: 183 year: 2019 ident: 10.1016/j.jclepro.2019.119433_bib39 article-title: The green mixed fleet vehicle routing problem with partial battery recharging and time windows publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.07.012 – volume: 13 start-page: 329 issue: 1 year: 1977 ident: 10.1016/j.jclepro.2019.119433_bib23 article-title: On convergence rates of subgradient optimization methods publication-title: Math. Program. doi: 10.1007/BF01584346 – volume: 54 start-page: 82 year: 2017 ident: 10.1016/j.jclepro.2019.119433_bib8 article-title: Time-dependent green vehicle routing problem with stochastic vehicle speeds: an approximate dynamic programming algorithm publication-title: Transp. Res. Part D doi: 10.1016/j.trd.2017.04.016 |
| SSID | ssj0017074 |
| Score | 2.4135425 |
| Snippet | Energy saving is a great challenge for clean transportation. In this paper, we study the Energy Minimization Traveling Salesman Problem (EMTSP), which is a... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 119433 |
| SubjectTerms | algorithms Approximation algorithm Branch and bound Christofides’s heuristic Computer Science energy energy conservation Energy minimization Operations Research transportation Traveling salesman problem |
| Title | Approximate and exact algorithms for an energy minimization traveling salesman problem |
| URI | https://dx.doi.org/10.1016/j.jclepro.2019.119433 https://www.proquest.com/docview/2400521996 https://hal.science/hal-02427206 |
| Volume | 249 |
| WOSCitedRecordID | wos000507856300118&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-1786 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017074 issn: 0959-6526 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLYG7DAOaD-1AkNm4obSOYkTx8cKMcGE0A4V6s1y7GRNxVLUtFX_fJ5jJylljHHYJYqcxLHyPvu9PL_3PYROQInxJIUJGEZUezRPtMe5kh4JNFVM-4rUZNU3V-z6OhmN-E8XylvV5QRYWSarFb_7r6KGNhC2SZ19gbjbTqEBzkHocASxw_GfBD8wLOGrAixRuzOQrUwapLz9NZ0V87HlX4ALp5nN-jPcIr9dMqYpGLG0CeoVKI7K-PddxZknjFh4t4R-zF3a8tB2HnrniB4Xk6KL-ykWNljfKUxbj6q2oDPX5FwQ8L9Zx7Nt-BLjyKa-N8tqYKlI3cLo-5xaxotHa7Z1H0z6ExgyjNaE2_F-d_9DjuwN3dVGFDbBahPhuhGmG2G72UI7AYs4LHo7g8vz0Y92m4kRS9PdjL9L8fr2x_E8ZbxsjU0U7YYyry2U4Vu056SCBxYS79CrrHyPdtcIJz-gmzVwYAAHrsGBO3BgAAdcwBYceB0cuAUHbsCBHTg-ouH38-HZhecqa3gKFMrc0xosQxonActZJuM0TXSQ-jpnMmY5kYlSEdEhGI8-ZSkP80iRMFRUS_gUDH4aPqHtclpmnxGOSQY2cySpzEOqqeapYoEkOmJcp1rJHqLNFxPKsc6b4ie34q8S66F--9idpV157oGkEYdwtqO1CQXA7LlHv4L42tcYvvWLwZUwbcaAZQGJl34PHTfSFbAAm101mF7TRSVMEDbYwJzH-y8d9AF6002nQ7Q9ny2yL-i1Ws6LanbkwHoPQOWs-w |
| 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=Approximate+and+exact+algorithms+for+an+energy+minimization+traveling+salesman+problem&rft.jtitle=Journal+of+cleaner+production&rft.au=Wang%2C+Shijin&rft.au=Liu%2C+Ming&rft.au=Chu%2C+Feng&rft.date=2020-03-10&rft.issn=0959-6526&rft.volume=249&rft.spage=119433&rft_id=info:doi/10.1016%2Fj.jclepro.2019.119433&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jclepro_2019_119433 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0959-6526&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0959-6526&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0959-6526&client=summon |