An effective PSO-inspired algorithm for the team orienteering problem
•A new fast optimal split for the team orienteering problem.•An effective particle swarm algorithm (PSOiA).•PSOiA is robust and outperforms the state-of-the-art algorithms in the literature. The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the aim is to maximize t...
Saved in:
| Published in | European journal of operational research Vol. 229; no. 2; pp. 332 - 344 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
01.09.2013
Elsevier Elsevier Sequoia S.A |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0377-2217 1872-6860 1872-6860 |
| DOI | 10.1016/j.ejor.2013.02.049 |
Cover
| Abstract | •A new fast optimal split for the team orienteering problem.•An effective particle swarm algorithm (PSOiA).•PSOiA is robust and outperforms the state-of-the-art algorithms in the literature.
The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired Algorithm (PSOiA) to solve the problem. Experiments conducted on the standard benchmark of TOP clearly show that our algorithm outperforms the existing solving methods. PSOiA reached a relative error of 0.0005% whereas the best known relative error in the literature is 0.0394%. Our algorithm detects all but one of the best known solutions. Moreover, a strict improvement was found for one instance of the benchmark and a new set of larger instances was introduced. |
|---|---|
| AbstractList | The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired Algorithm (PSOiA) to solve the problem. Experiments conducted on the standard benchmark of TOP clearly show that our algorithm outperforms the existing solving methods. PSOiA reached a relative error of 0.0005% whereas the best known relative error in the literature is 0.0394%. Our algorithm detects all but one of the best known solutions. Moreover, a strict improvement was found for one instance of the benchmark and a new set of larger instances was introduced. The team orienteering problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profi t gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired algorithm (PSOiA) to solve the problem. Experiments conducted on the standard benchmark of TOP clearly show that our algorithm outperforms the existing solving methods. PSOiA reached a relative error of 0.0005% whereas the best known relative error in the literature is 0.0394%. Our algorithm detects all but one of the best known solutions. Moreover, a strict improvement was found for one instance of the benchmark and a new set of larger instances was introduced. The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired Algorithm (PSOiA) to solve the problem. Experiments conducted on the standard benchmark of TOP clearly show that our algorithm outperforms the existing solving methods. PSOiA reached a relative error of 0.0005% whereas the best known relative error in the literature is 0.0394%. Our algorithm detects all but one of the best known solutions. Moreover, a strict improvement was found for one instance of the benchmark and a new set of larger instances was introduced. [PUBLICATION ABSTRACT] •A new fast optimal split for the team orienteering problem.•An effective particle swarm algorithm (PSOiA).•PSOiA is robust and outperforms the state-of-the-art algorithms in the literature. The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired Algorithm (PSOiA) to solve the problem. Experiments conducted on the standard benchmark of TOP clearly show that our algorithm outperforms the existing solving methods. PSOiA reached a relative error of 0.0005% whereas the best known relative error in the literature is 0.0394%. Our algorithm detects all but one of the best known solutions. Moreover, a strict improvement was found for one instance of the benchmark and a new set of larger instances was introduced. |
| Author | Dang, Duc-Cuong Guibadj, Rym Nesrine Moukrim, Aziz |
| Author_xml | – sequence: 1 givenname: Duc-Cuong surname: Dang fullname: Dang, Duc-Cuong email: duc-cuong.dang@hds.utc.fr organization: Université de Technologie de Compiègne, Département Génie Informatique, Heudiasyc, CNRS UMR 7253, BP 20529, 60205 Compiègne, France – sequence: 2 givenname: Rym Nesrine surname: Guibadj fullname: Guibadj, Rym Nesrine organization: Université de Technologie de Compiègne, Département Génie Informatique, Heudiasyc, CNRS UMR 7253, BP 20529, 60205 Compiègne, France – sequence: 3 givenname: Aziz surname: Moukrim fullname: Moukrim, Aziz organization: Université de Technologie de Compiègne, Département Génie Informatique, Heudiasyc, CNRS UMR 7253, BP 20529, 60205 Compiègne, France |
| BackLink | http://www.econis.eu/PPNSET?PPN=75020141X$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften https://hal.science/hal-00934974$$DView record in HAL |
| BookMark | eNqNkV9rFDEUxYNUcFv9Ar444Is-zJh_M0nAl6VUKyxUUMG3kCZ3uhlmkzXJrvTbm2WKQh-KT4HL79zcc845OgsxAEKvCe4IJsOHqYMppo5iwjpMO8zVM7QiUtB2kAM-QyvMhGgpJeIFOs95whiTnvQrdLUODYwj2OKP0Hz9dtP6kPc-gWvMfBeTL9tdM8bUlC00BcyuqTMIBSD5cNfsU7ydYfcSPR_NnOHVw3uBfny6-n553W5uPn-5XG9ayxUvrZLjcNv3jHOHWS-wM0wKJ4YRKyqJNXYQwBRWgyWOjYQpR-zgmBKjlIQ7xi4QW_Yewt7c_zbzrPfJ70y61wTrUxJ60qck9CkJjamuSVTV-0W1Nf_4aLy-Xm_0aYaxYlwJfiSVfbew1dmvA-Sidz5bmGcTIB6yJkzQgTFC-4q-fYRO8ZBC9V8pLsnAlKSVerNQYGPw-e__osf1Rk5-VoIuhE0x5wTj_3mSj0TWF1N8DCUZPz8t_fhwUW3q6CHpbGulFlyt3Rbton9K_gcI8L04 |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1080_00207543_2015_1058982 crossref_primary_10_1016_j_cie_2017_10_020 crossref_primary_10_1016_j_engappai_2019_01_014 crossref_primary_10_1016_j_ejor_2025_01_009 crossref_primary_10_1111_itor_13302 crossref_primary_10_1016_j_asr_2024_04_003 crossref_primary_10_1016_j_ifacol_2016_07_819 crossref_primary_10_1016_j_asoc_2019_04_038 crossref_primary_10_3390_app112412092 crossref_primary_10_1002_net_22214 crossref_primary_10_1016_j_ins_2019_05_075 crossref_primary_10_1016_j_cie_2019_106084 crossref_primary_10_1007_s10732_014_9242_5 crossref_primary_10_1016_j_tre_2023_103172 crossref_primary_10_3390_a17050200 crossref_primary_10_3390_math10162856 crossref_primary_10_1016_j_asoc_2021_107877 crossref_primary_10_3390_math10203788 crossref_primary_10_1016_j_ejor_2015_06_071 crossref_primary_10_1016_j_cie_2019_06_051 crossref_primary_10_1016_j_omega_2015_08_003 crossref_primary_10_1287_trsc_2019_0923 crossref_primary_10_1016_j_cie_2021_107776 crossref_primary_10_1016_j_ejor_2022_04_007 crossref_primary_10_1287_trsc_2019_0963 crossref_primary_10_1007_s11042_022_12167_w crossref_primary_10_1016_j_ejor_2017_08_027 crossref_primary_10_1002_net_22023 crossref_primary_10_3390_math12193140 crossref_primary_10_1016_j_asoc_2017_07_024 crossref_primary_10_1016_j_trb_2024_103066 crossref_primary_10_1016_j_cor_2020_105175 crossref_primary_10_1016_j_cor_2024_106944 crossref_primary_10_1016_j_cor_2022_105974 crossref_primary_10_1016_j_asoc_2018_11_005 crossref_primary_10_1016_j_ejor_2013_12_023 crossref_primary_10_1007_s11590_015_0878_3 crossref_primary_10_1016_j_trb_2018_10_011 crossref_primary_10_1016_j_eswa_2024_123561 crossref_primary_10_1016_j_energy_2018_12_062 crossref_primary_10_1016_j_omega_2021_102518 crossref_primary_10_3390_math8091461 crossref_primary_10_1016_j_trpro_2020_03_095 crossref_primary_10_3390_math12111758 crossref_primary_10_1016_j_simpat_2025_103084 crossref_primary_10_1007_s10479_020_03540_9 crossref_primary_10_1007_s10514_017_9691_4 crossref_primary_10_1051_matecconf_201823203039 crossref_primary_10_1007_s00500_019_04438_w crossref_primary_10_1016_j_ejor_2016_04_059 crossref_primary_10_1016_j_ejor_2020_02_020 crossref_primary_10_1016_j_heliyon_2020_e04202 crossref_primary_10_1016_j_tre_2017_01_002 crossref_primary_10_1016_j_cor_2024_106954 crossref_primary_10_1016_j_eswa_2023_121457 crossref_primary_10_1080_0305215X_2017_1417398 crossref_primary_10_1016_j_asoc_2020_106280 crossref_primary_10_1016_j_swevo_2025_101858 crossref_primary_10_1109_ACCESS_2019_2920736 crossref_primary_10_1016_j_asoc_2017_09_004 crossref_primary_10_1016_j_ejor_2014_01_001 crossref_primary_10_1016_j_asoc_2021_108264 crossref_primary_10_1080_00207543_2022_2162146 crossref_primary_10_1016_j_ejor_2022_06_052 crossref_primary_10_1111_itor_13111 crossref_primary_10_1016_j_cor_2020_105039 crossref_primary_10_1016_j_ejor_2024_06_015 crossref_primary_10_1007_s10732_018_9395_8 crossref_primary_10_1007_s12597_023_00678_5 crossref_primary_10_1016_j_ejor_2021_06_035 crossref_primary_10_1007_s00291_018_0541_3 crossref_primary_10_1016_j_cie_2014_06_004 crossref_primary_10_1016_j_ejor_2018_02_011 crossref_primary_10_1109_TITS_2023_3279391 crossref_primary_10_1016_j_cor_2020_105034 crossref_primary_10_1109_TSTE_2016_2582927 crossref_primary_10_1016_j_cor_2016_04_008 crossref_primary_10_1016_j_ejor_2024_06_009 crossref_primary_10_4018_ijncr_2014070102 crossref_primary_10_1016_j_trpro_2020_03_147 crossref_primary_10_1088_1757_899X_895_1_012014 crossref_primary_10_1016_j_asoc_2021_107269 |
| Cites_doi | 10.1016/j.cor.2009.05.012 10.1007/s10288-006-0009-1 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D 10.1016/j.ejor.2013.02.053 10.1109/ICNN.1995.488968 10.1007/978-3-642-20520-0_48 10.1016/0377-2217(94)90247-X 10.1016/B978-0-12-141050-6.50006-4 10.1287/ijoc.10.2.133 10.1007/s10288-008-0094-4 10.1016/j.cie.2006.09.002 10.1016/j.ejor.2007.12.014 10.1016/0305-0483(83)90033-6 10.1007/s12293-011-0071-x 10.1016/0305-0548(94)90065-5 10.1287/ijoc.3.4.376 10.1007/s11047-007-9049-5 10.1016/0377-2217(95)00035-6 10.1080/00207540802426599 10.1016/j.cor.2003.11.008 10.1057/jors.1984.162 10.1016/j.cor.2010.09.010 10.1016/j.cie.2007.10.001 10.1016/j.ejor.2008.02.037 10.1007/s10732-006-9004-0 10.1016/S0305-0548(98)00071-9 10.1016/j.ejor.2008.04.037 10.1016/j.cor.2009.05.002 10.1007/s11047-007-9050-z 10.1016/j.asoc.2009.06.010 10.1016/0377-2217(89)90388-3 10.1016/0377-2217(94)00289-4 10.1587/transinf.E92.D.1354 10.1016/j.ejor.2010.03.045 |
| ContentType | Journal Article |
| Copyright | 2013 Elsevier B.V. Copyright Elsevier Sequoia S.A. Sep 1, 2013 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2013 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Sep 1, 2013 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION OQ6 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 1XC VOOES ADTOC UNPAY |
| DOI | 10.1016/j.ejor.2013.02.049 |
| DatabaseName | CrossRef ECONIS Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Materials Business File Materials Research Database Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Materials Research Database Materials Business File |
| DatabaseTitleList | Materials Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 344 |
| ExternalDocumentID | oai:HAL:hal-00934974v1 2961131121 75020141X 10_1016_j_ejor_2013_02_049 S0377221713001987 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ AAAKG AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD AAYOK OQ6 7SC 7TB 8FD AFXIZ AGCQF AGRNS FR3 JQ2 L7M L~C L~D SSH 7TA JG9 1XC VOOES ADTOC UNPAY |
| ID | FETCH-LOGICAL-c494t-98f6b55344d03570da387d76f09281cac67e39096c1d3f139d1c6d397f8814d33 |
| IEDL.DBID | UNPAY |
| ISSN | 0377-2217 1872-6860 |
| IngestDate | Sun Oct 26 04:04:26 EDT 2025 Tue Oct 14 20:38:11 EDT 2025 Sat Sep 27 21:12:27 EDT 2025 Fri Jul 25 06:56:34 EDT 2025 Sat Mar 08 16:22:49 EST 2025 Thu Apr 24 23:16:09 EDT 2025 Wed Oct 01 00:57:41 EDT 2025 Fri Feb 23 02:32:26 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Interval graph Swarm intelligence Vehicle routing Optimal split Knapsack problem |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 other-oa |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c494t-98f6b55344d03570da387d76f09281cac67e39096c1d3f139d1c6d397f8814d33 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ORCID | 0000-0003-0151-6327 0000-0003-3448-3912 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://hal.science/hal-00934974 |
| PQID | 1348163982 |
| PQPubID | 45678 |
| PageCount | 13 |
| ParticipantIDs | unpaywall_primary_10_1016_j_ejor_2013_02_049 hal_primary_oai_HAL_hal_00934974v1 proquest_miscellaneous_1372633125 proquest_journals_1348163982 econis_primary_75020141X crossref_primary_10_1016_j_ejor_2013_02_049 crossref_citationtrail_10_1016_j_ejor_2013_02_049 elsevier_sciencedirect_doi_10_1016_j_ejor_2013_02_049 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2013-09-01 |
| PublicationDateYYYYMMDD | 2013-09-01 |
| PublicationDate_xml | – month: 09 year: 2013 text: 2013-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Banks, Vincent, Anyakoha (b0020) 2008; 7 L. Bonnefoy, L’optimisation par essaims particulaires appliquée au team orienteering problem, 2010. Preprint D.-C. Dang, R.N. Guibadj, A. Moukrim, A pso-based memetic algorithm for the team orienteering problem, in: EvoApplications, 2011, pp. 471–480. Tricoire, Romauch, Doerner, Hartl (b0175) 2010; 37 Boussier, Feillet, Gendreau (b0050) 2007; 5 Vansteenwegen, Souffriau, Vanden Berghe, Van Oudheusden (b0190) 2009; 196 Tang, Miller-Hooks (b0165) 2005; 32 Leifer, Rosenwein (b0120) 1994; 73 ao, H. Viana, E. Uchoa, The team orienteering problem: formulations and branch-cut and price, in: ATMOS, 2010, pp. 142–155. Yamada, Kataoka, Watanabe (b0205) 2002; 43 H. Bouly, A. Moukrim, D. Chanteur, L. Simon, Un algorithme de destruction/construction itératif pour la résolution d’un problème de tournées de véhicules spécifique, in: MOSIM’08, 2008. Kameyama (b0100) 2009; 92-D R. Sadykov, F. Vanderbeck, Bin packing with conflicts: a generic branch-and-price algorithm, INFORMS Journal on Computing, in press (Available online, May 4, 2012). Bouly, Dang, Moukrim (b0040) 2010; 8 Beasley (b0025) 1983; 11 Butt, Cavalier (b0055) 1994; 21 Reinelt (b0145) 1991 Tsiligirides (b0180) 1984; 35 Bérubé, Gendreau, Potvin (b0030) 2009; 194 Chao, Golden, Wasil (b0070) 1996; 88 T. Vidal, T.G. Crainic, M. Gendreau, C. Prins, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Technical report, CIRRELT, 2012. Pant, Thangaraj, Abraham (b0130) 2008 Vansteenwegen, Souffriau, Van Oudheusden (b0185) 2011; 209 Vansteenwegen, Souffriau, Vanden Berghe, Van Oudheusden (b0195) 2009; vol. 624 Butt, Ryan (b0060) 1999; 26 Keller (b0110) 1989; 41 Muthuswamy, Lam (b0125) 2011; 3 Duhamel, Lacomme, Prodhon (b0085) 2011; 38 Sha, Hsu (b0155) 2006; 51 Ke, Archetti, Feng (b0105) 2008; 54 Souffriau, Vansteenwegen, Vanden Berghe, Van Oudheusden (b0160) 2010; 37 Aráoz, Fernández, Meza (b0005) 2009; 196 Chao, Golden, Wasil (b0065) 1996; 88 J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, 1995, pp. 1942–1948. Zhao (b0210) 2010; 10 Golden, Levy, Vohra (b0095) 1987; 34 Archetti, Hertz, Speranza (b0010) 2007; 13 Fischetti, González, Toth (b0090) 1998; 10 . Banks, Vincent, Anyakoha (b0015) 2007; 6 M. Poggi de Arag Prins, Labadi, Reghioui (b0140) 2009; 47 Christofides, Mingozzi, Toth (b0075) 1979 R.E. Tarjan, Graph theory and gaussian elimination, Technical report, Stanford University, 1975. Zhao (10.1016/j.ejor.2013.02.049_b0210) 2010; 10 Tsiligirides (10.1016/j.ejor.2013.02.049_b0180) 1984; 35 Vansteenwegen (10.1016/j.ejor.2013.02.049_b0195) 2009; vol. 624 Reinelt (10.1016/j.ejor.2013.02.049_b0145) 1991 Pant (10.1016/j.ejor.2013.02.049_b0130) 2008 10.1016/j.ejor.2013.02.049_b0080 Kameyama (10.1016/j.ejor.2013.02.049_b0100) 2009; 92-D 10.1016/j.ejor.2013.02.049_b0045 Vansteenwegen (10.1016/j.ejor.2013.02.049_b0185) 2011; 209 Duhamel (10.1016/j.ejor.2013.02.049_b0085) 2011; 38 10.1016/j.ejor.2013.02.049_b0200 Chao (10.1016/j.ejor.2013.02.049_b0065) 1996; 88 Vansteenwegen (10.1016/j.ejor.2013.02.049_b0190) 2009; 196 Christofides (10.1016/j.ejor.2013.02.049_b0075) 1979 Butt (10.1016/j.ejor.2013.02.049_b0055) 1994; 21 Yamada (10.1016/j.ejor.2013.02.049_b0205) 2002; 43 Bouly (10.1016/j.ejor.2013.02.049_b0040) 2010; 8 Leifer (10.1016/j.ejor.2013.02.049_b0120) 1994; 73 Boussier (10.1016/j.ejor.2013.02.049_b0050) 2007; 5 Tricoire (10.1016/j.ejor.2013.02.049_b0175) 2010; 37 Golden (10.1016/j.ejor.2013.02.049_b0095) 1987; 34 Tang (10.1016/j.ejor.2013.02.049_b0165) 2005; 32 Butt (10.1016/j.ejor.2013.02.049_b0060) 1999; 26 Sha (10.1016/j.ejor.2013.02.049_b0155) 2006; 51 Beasley (10.1016/j.ejor.2013.02.049_b0025) 1983; 11 Archetti (10.1016/j.ejor.2013.02.049_b0010) 2007; 13 Souffriau (10.1016/j.ejor.2013.02.049_b0160) 2010; 37 Muthuswamy (10.1016/j.ejor.2013.02.049_b0125) 2011; 3 10.1016/j.ejor.2013.02.049_b0170 Prins (10.1016/j.ejor.2013.02.049_b0140) 2009; 47 10.1016/j.ejor.2013.02.049_b0150 Aráoz (10.1016/j.ejor.2013.02.049_b0005) 2009; 196 10.1016/j.ejor.2013.02.049_b0135 10.1016/j.ejor.2013.02.049_b0035 Chao (10.1016/j.ejor.2013.02.049_b0070) 1996; 88 10.1016/j.ejor.2013.02.049_b0115 Ke (10.1016/j.ejor.2013.02.049_b0105) 2008; 54 Banks (10.1016/j.ejor.2013.02.049_b0015) 2007; 6 Bérubé (10.1016/j.ejor.2013.02.049_b0030) 2009; 194 Fischetti (10.1016/j.ejor.2013.02.049_b0090) 1998; 10 Banks (10.1016/j.ejor.2013.02.049_b0020) 2008; 7 Keller (10.1016/j.ejor.2013.02.049_b0110) 1989; 41 |
| References_xml | – reference: J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, 1995, pp. 1942–1948. – volume: 37 start-page: 351 year: 2010 end-page: 367 ident: b0175 article-title: Heuristics for the multi-period orienteering problem with multiple time windows publication-title: Computers & Operations Research – volume: 35 start-page: 797 year: 1984 end-page: 809 ident: b0180 article-title: Heuristic methods applied to orienteering publication-title: Journal of the Operational Research Society – start-page: 215 year: 2008 end-page: 222 ident: b0130 article-title: A new pso algorithm with crossover operator for global optimization problems publication-title: Innovations in Hybrid Intelligent Systems – year: 1979 ident: b0075 article-title: Combinatorial Optimization – volume: 194 start-page: 39 year: 2009 end-page: 50 ident: b0030 article-title: An exact epsilon-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits publication-title: European Journal of Operational Research – volume: 6 start-page: 467 year: 2007 end-page: 484 ident: b0015 article-title: A review of particle swarm optimization. Part I: Background and development publication-title: Natural Computing – volume: 5 start-page: 211 year: 2007 end-page: 230 ident: b0050 article-title: An exact algorithm for team orienteering problems publication-title: 4OR – reference: D.-C. Dang, R.N. Guibadj, A. Moukrim, A pso-based memetic algorithm for the team orienteering problem, in: EvoApplications, 2011, pp. 471–480. – volume: 88 start-page: 475 year: 1996 end-page: 489 ident: b0065 article-title: A fast and effective heuristic for the orienteering problem publication-title: European Journal of Operational Research – reference: R. Sadykov, F. Vanderbeck, Bin packing with conflicts: a generic branch-and-price algorithm, INFORMS Journal on Computing, in press (Available online, May 4, 2012). – reference: ao, H. Viana, E. Uchoa, The team orienteering problem: formulations and branch-cut and price, in: ATMOS, 2010, pp. 142–155. – volume: 32 start-page: 1379 year: 2005 end-page: 1407 ident: b0165 article-title: A tabu search heuristic for the team orienteering problem publication-title: Computer & Operations Research – volume: 41 start-page: 224 year: 1989 end-page: 231 ident: b0110 article-title: Algorithms to solve the orienteering problem: a comparison publication-title: European Journal of Operational Research – year: 1991 ident: b0145 article-title: A traveling salesman problem library publication-title: ORSA Journal on Computing – volume: 26 start-page: 427 year: 1999 end-page: 441 ident: b0060 article-title: An optimal solution procedure for the multiple tour maximum collection problem using column generation publication-title: Computers & Operations Research – volume: 13 year: 2007 ident: b0010 article-title: Metaheuristics for the team orienteering problem publication-title: Journal of Heuristics – reference: R.E. Tarjan, Graph theory and gaussian elimination, Technical report, Stanford University, 1975. – volume: 11 start-page: 403 year: 1983 end-page: 408 ident: b0025 article-title: Route-first cluster-second methods for vehicle routing publication-title: Omega – volume: 8 start-page: 49 year: 2010 end-page: 70 ident: b0040 article-title: A memetic algorithm for the team orienteering problem publication-title: 4OR – volume: 37 start-page: 1853 year: 2010 end-page: 1859 ident: b0160 article-title: A path relinking approach for the team orienteering problem publication-title: Computers & Operations Research – volume: vol. 624 start-page: 15 year: 2009 end-page: 31 ident: b0195 article-title: Metaheuristics for tourist trip planning publication-title: Metaheuristics in the Service Industry – volume: 7 start-page: 109 year: 2008 end-page: 124 ident: b0020 article-title: A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications publication-title: Natural Computing – reference: M. Poggi de Arag – reference: >. – volume: 88 start-page: 464 year: 1996 end-page: 474 ident: b0070 article-title: The team orienteering problem publication-title: European Journal of Operational Research – volume: 3 start-page: 287 year: 2011 end-page: 303 ident: b0125 article-title: Discrete particle swarm optimization for the team orienteering problem publication-title: Memetic Computing – volume: 10 start-page: 133 year: 1998 end-page: 148 ident: b0090 article-title: Solving the orienteering problem through branch-and-cut publication-title: INFORMS Journal on Computing – reference: L. Bonnefoy, L’optimisation par essaims particulaires appliquée au team orienteering problem, 2010. Preprint, < – reference: H. Bouly, A. Moukrim, D. Chanteur, L. Simon, Un algorithme de destruction/construction itératif pour la résolution d’un problème de tournées de véhicules spécifique, in: MOSIM’08, 2008. – volume: 47 start-page: 507 year: 2009 end-page: 535 ident: b0140 article-title: Tour splitting algorithms for vehicle routing problems publication-title: International Journal of Production Research – volume: 10 start-page: 119 year: 2010 end-page: 124 ident: b0210 article-title: A perturbed particle swarm algorithm for numerical optimization publication-title: Applied Soft Computing – volume: 92-D start-page: 1354 year: 2009 end-page: 1361 ident: b0100 article-title: Particle swarm optimization – a survey publication-title: IEICE Transactions – volume: 21 start-page: 101 year: 1994 end-page: 111 ident: b0055 article-title: A heuristic for the multiple tour maximum collection problem publication-title: Computers & Operations Research – volume: 38 start-page: 723 year: 2011 end-page: 739 ident: b0085 article-title: Efficient frameworks for greedy split and new depth first search split procedures for routing problems publication-title: Computers & Operations Research – volume: 34 start-page: 307 year: 1987 end-page: 318 ident: b0095 article-title: The orienteering problem publication-title: Naval Research Logistics – volume: 51 start-page: 791 year: 2006 end-page: 808 ident: b0155 article-title: A hybird particle swarm optimization for job shop scheduling problem publication-title: Computers & Industrial Engineering – reference: T. Vidal, T.G. Crainic, M. Gendreau, C. Prins, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Technical report, CIRRELT, 2012. – volume: 43 start-page: 2864 year: 2002 end-page: 2870 ident: b0205 article-title: Heuristic and exact algorithms for the disjunctively constrained knapsack problem publication-title: Information Processing Society of Japan Journal – volume: 196 start-page: 886 year: 2009 end-page: 896 ident: b0005 article-title: Solving the prize-collecting rural postman problem publication-title: European Journal of Operational Research – volume: 209 start-page: 1 year: 2011 end-page: 10 ident: b0185 article-title: The orienteering problem: a survey publication-title: European Journal of Operational Research – volume: 54 start-page: 648 year: 2008 end-page: 665 ident: b0105 article-title: Ants can solve the team orienteering problem publication-title: Computers & Industrial Engineering – volume: 73 start-page: 517 year: 1994 end-page: 523 ident: b0120 article-title: Strong linear programming relaxations for the orienteering problem publication-title: European Journal of Operational Research – volume: 196 start-page: 118 year: 2009 end-page: 127 ident: b0190 article-title: A guided local search metaheuristic for the team orienteering problem publication-title: European Journal of Operational Research – volume: 37 start-page: 351 year: 2010 ident: 10.1016/j.ejor.2013.02.049_b0175 article-title: Heuristics for the multi-period orienteering problem with multiple time windows publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.05.012 – volume: 5 start-page: 211 issue: 3 year: 2007 ident: 10.1016/j.ejor.2013.02.049_b0050 article-title: An exact algorithm for team orienteering problems publication-title: 4OR doi: 10.1007/s10288-006-0009-1 – volume: 34 start-page: 307 year: 1987 ident: 10.1016/j.ejor.2013.02.049_b0095 article-title: The orienteering problem publication-title: Naval Research Logistics doi: 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D – ident: 10.1016/j.ejor.2013.02.049_b0200 doi: 10.1016/j.ejor.2013.02.053 – ident: 10.1016/j.ejor.2013.02.049_b0115 doi: 10.1109/ICNN.1995.488968 – ident: 10.1016/j.ejor.2013.02.049_b0080 doi: 10.1007/978-3-642-20520-0_48 – volume: 73 start-page: 517 issue: 3 year: 1994 ident: 10.1016/j.ejor.2013.02.049_b0120 article-title: Strong linear programming relaxations for the orienteering problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90247-X – volume: vol. 624 start-page: 15 year: 2009 ident: 10.1016/j.ejor.2013.02.049_b0195 article-title: Metaheuristics for tourist trip planning – ident: 10.1016/j.ejor.2013.02.049_b0170 doi: 10.1016/B978-0-12-141050-6.50006-4 – volume: 10 start-page: 133 issue: 2 year: 1998 ident: 10.1016/j.ejor.2013.02.049_b0090 article-title: Solving the orienteering problem through branch-and-cut publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.10.2.133 – volume: 8 start-page: 49 issue: 1 year: 2010 ident: 10.1016/j.ejor.2013.02.049_b0040 article-title: A memetic algorithm for the team orienteering problem publication-title: 4OR doi: 10.1007/s10288-008-0094-4 – volume: 51 start-page: 791 issue: 4 year: 2006 ident: 10.1016/j.ejor.2013.02.049_b0155 article-title: A hybird particle swarm optimization for job shop scheduling problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2006.09.002 – volume: 194 start-page: 39 issue: 1 year: 2009 ident: 10.1016/j.ejor.2013.02.049_b0030 article-title: An exact epsilon-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.12.014 – year: 1979 ident: 10.1016/j.ejor.2013.02.049_b0075 – ident: 10.1016/j.ejor.2013.02.049_b0150 – ident: 10.1016/j.ejor.2013.02.049_b0135 – volume: 11 start-page: 403 year: 1983 ident: 10.1016/j.ejor.2013.02.049_b0025 article-title: Route-first cluster-second methods for vehicle routing publication-title: Omega doi: 10.1016/0305-0483(83)90033-6 – volume: 3 start-page: 287 year: 2011 ident: 10.1016/j.ejor.2013.02.049_b0125 article-title: Discrete particle swarm optimization for the team orienteering problem publication-title: Memetic Computing doi: 10.1007/s12293-011-0071-x – volume: 21 start-page: 101 year: 1994 ident: 10.1016/j.ejor.2013.02.049_b0055 article-title: A heuristic for the multiple tour maximum collection problem publication-title: Computers & Operations Research doi: 10.1016/0305-0548(94)90065-5 – year: 1991 ident: 10.1016/j.ejor.2013.02.049_b0145 article-title: A traveling salesman problem library publication-title: ORSA Journal on Computing doi: 10.1287/ijoc.3.4.376 – ident: 10.1016/j.ejor.2013.02.049_b0045 – volume: 43 start-page: 2864 issue: 9 year: 2002 ident: 10.1016/j.ejor.2013.02.049_b0205 article-title: Heuristic and exact algorithms for the disjunctively constrained knapsack problem publication-title: Information Processing Society of Japan Journal – volume: 6 start-page: 467 issue: 4 year: 2007 ident: 10.1016/j.ejor.2013.02.049_b0015 article-title: A review of particle swarm optimization. Part I: Background and development publication-title: Natural Computing doi: 10.1007/s11047-007-9049-5 – volume: 88 start-page: 475 year: 1996 ident: 10.1016/j.ejor.2013.02.049_b0065 article-title: A fast and effective heuristic for the orienteering problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00035-6 – start-page: 215 year: 2008 ident: 10.1016/j.ejor.2013.02.049_b0130 article-title: A new pso algorithm with crossover operator for global optimization problems – volume: 47 start-page: 507 issue: 2 year: 2009 ident: 10.1016/j.ejor.2013.02.049_b0140 article-title: Tour splitting algorithms for vehicle routing problems publication-title: International Journal of Production Research doi: 10.1080/00207540802426599 – volume: 32 start-page: 1379 year: 2005 ident: 10.1016/j.ejor.2013.02.049_b0165 article-title: A tabu search heuristic for the team orienteering problem publication-title: Computer & Operations Research doi: 10.1016/j.cor.2003.11.008 – volume: 35 start-page: 797 issue: 9 year: 1984 ident: 10.1016/j.ejor.2013.02.049_b0180 article-title: Heuristic methods applied to orienteering publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1984.162 – volume: 38 start-page: 723 issue: 4 year: 2011 ident: 10.1016/j.ejor.2013.02.049_b0085 article-title: Efficient frameworks for greedy split and new depth first search split procedures for routing problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.09.010 – volume: 54 start-page: 648 issue: 3 year: 2008 ident: 10.1016/j.ejor.2013.02.049_b0105 article-title: Ants can solve the team orienteering problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2007.10.001 – volume: 196 start-page: 118 issue: 1 year: 2009 ident: 10.1016/j.ejor.2013.02.049_b0190 article-title: A guided local search metaheuristic for the team orienteering problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.02.037 – volume: 13 issue: 1 year: 2007 ident: 10.1016/j.ejor.2013.02.049_b0010 article-title: Metaheuristics for the team orienteering problem publication-title: Journal of Heuristics doi: 10.1007/s10732-006-9004-0 – volume: 26 start-page: 427 year: 1999 ident: 10.1016/j.ejor.2013.02.049_b0060 article-title: An optimal solution procedure for the multiple tour maximum collection problem using column generation publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(98)00071-9 – ident: 10.1016/j.ejor.2013.02.049_b0035 – volume: 196 start-page: 886 issue: 3 year: 2009 ident: 10.1016/j.ejor.2013.02.049_b0005 article-title: Solving the prize-collecting rural postman problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.04.037 – volume: 37 start-page: 1853 issue: 11 year: 2010 ident: 10.1016/j.ejor.2013.02.049_b0160 article-title: A path relinking approach for the team orienteering problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.05.002 – volume: 7 start-page: 109 issue: 1 year: 2008 ident: 10.1016/j.ejor.2013.02.049_b0020 article-title: A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications publication-title: Natural Computing doi: 10.1007/s11047-007-9050-z – volume: 10 start-page: 119 issue: 1 year: 2010 ident: 10.1016/j.ejor.2013.02.049_b0210 article-title: A perturbed particle swarm algorithm for numerical optimization publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2009.06.010 – volume: 41 start-page: 224 issue: 2 year: 1989 ident: 10.1016/j.ejor.2013.02.049_b0110 article-title: Algorithms to solve the orienteering problem: a comparison publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(89)90388-3 – volume: 88 start-page: 464 year: 1996 ident: 10.1016/j.ejor.2013.02.049_b0070 article-title: The team orienteering problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00289-4 – volume: 92-D start-page: 1354 issue: 7 year: 2009 ident: 10.1016/j.ejor.2013.02.049_b0100 article-title: Particle swarm optimization – a survey publication-title: IEICE Transactions doi: 10.1587/transinf.E92.D.1354 – volume: 209 start-page: 1 issue: 1 year: 2011 ident: 10.1016/j.ejor.2013.02.049_b0185 article-title: The orienteering problem: a survey publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.03.045 |
| SSID | ssj0001515 |
| Score | 2.4758935 |
| Snippet | •A new fast optimal split for the team orienteering problem.•An effective particle swarm algorithm (PSOiA).•PSOiA is robust and outperforms the... The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without... The team orienteering problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profi t gained from visiting customers without... |
| SourceID | unpaywall hal proquest econis crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 332 |
| SubjectTerms | Algorithms Benchmarking Benchmarks Computer Science Cost engineering Customers Errors Interval graph Knapsack problem Mathematical models Operations Research Optimal split Optimization Optimization algorithms Orienteering Route optimization Studies Swarm intelligence Transportation problem (Operations research) Vehicle routing |
| SummonAdditionalLinks | – databaseName: Science Direct dbid: .~1 link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB6VCvE48FhATR_IIG6Qbhw7cfa4qlqtEC-pVNqblY1tmmqbrNosiAu_nZnECdtLVXFNJlbisT2f42--AXiXJqbAKJmEkVA2lHHswsyaLFSpXSS2wIjkKDn585d0diY_zpP5Fhz1uTBEq_Rrf7emt6u1vzL2vTleleX4FFtXMSJqOpChrTNlsEtFVQwO__yjeVDAbk8SlArJ2ifOdBwve1GTJigXrW4n6WluBKf7tCMtr29EqXvnRJfcwKIP19Uq__0rXy43wtLJM3ji8SSbdq_8HLZsNYIHPZ19BE_7sg3Mz-IRPN7QIHwBx9OKdaQOXPfYt9OvYVnR6bs1LF_-qK_K5vySIbJliBQZjohLVpM0ctM9z3xBmpdwdnL8_WgW-toKYSEnsgknmUsXSSKkNJFIVGRykSmjUhdN4owXeZEqKya4vym4EQ5houFFahC8uCzj0gjxCrarurI7wNCcsqCsINFrLt3CCE66Zk4o45RwAfC-U3Xhhcep_sVS9wyzC02O0OQIHcUaHRHA--GZVSe7cav1TuerwRZxUEwU1nkASe89fWNcaQwZtzb5Fl09tEci3LPpJ03X6CeQxG3YTx7Afj8StJ_615pTajPiviwO4M1wGyctncTkla3XZKPiVAgElwF8GEbQHb509z8_Zw8exW0dDyLH7cN2c7W2B4immsXrdrr8BWlaF60 priority: 102 providerName: Elsevier |
| Title | An effective PSO-inspired algorithm for the team orienteering problem |
| URI | https://dx.doi.org/10.1016/j.ejor.2013.02.049 http://www.econis.eu/PPNSET?PPN=75020141X https://www.proquest.com/docview/1348163982 https://www.proquest.com/docview/1372633125 https://hal.science/hal-00934974 |
| UnpaywallVersion | submittedVersion |
| Volume | 229 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: ACRLP dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIKHN dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AKRWK dateStart: 19770101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nj9MwEB1tW8THgYUuaANLZRA3cBXbiZ0eI7Sr8lVWgkrlZCWxQ7t0k9U2BcGB346nSarCoYJblIwtRTP2PMtv3gA8l6HJXJYMqS-UpQHnOY2siaiSNg1t5jJSjsXJ7ydyPA3ezMLZAZC2FmbuEGez9-MzxRN34DBvB3oydGi7C73p5Dz-vLkcUIpyvmmqyyLFqYyk39TF1BQue1Gi5CcTG1lOlMvcyT038MC5WP2RhDpzZEPuQM1b6-Iq-fE9WS53ss7ZYc1-XG3ECpFs8nW4rtJh9vMvKcd9P3QP7jaQk8R1jNyHA1v04WbLeO_DYdvZgTQLvQ93dmQKj-A0LkjN-3BbIzn_-IEuCrygt4Ykyy_l9aKaXxIHfokDk8QFzSUpUT25qseTpmfNA5ienX56NaZN-wWaBaOgoqMol2kYiiAwvgiVbxIRKaNk7o94xLIkk8qKkTsCZcyI3CFJwzJpHL7Jo4gFRoiH0C3Kwh4DceZYKGUF6mKzIE-NYCh9lgtlciVyD1jrGJ012uTYImOpWxLahUZnanSm9rl2zvTgxXbMVa3Msdf6uPb31tZBJY4s15kHYRsBuvFUDSe0yyp7p3zmHLqdD3W6x_E7je9aJ39jHpy00aSb3WGlGVY_O2gYcQ-ebj-7dY2XNUlhyzXaKC6FcPjTg5fbKPyHP330f-aP4TbfdPhA2twJdKvrtX3icFaVDqAz_MUG0Itfvx1PBs3C-w1beyIH |
| linkProvider | Unpaywall |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fb9MwED5tAzF44EcBLTDAIN5YaGwncfpYTZsKdANpm9Q3K40dlqlLqi0F8cLfzl3ihO5lQrymF6vJ2b7v4u--A3gfRybDKBn5gVTWD4XI_cSaxFexnUc2w4iUU3Hy0XE8OQs_z6LZBux3tTBEq3R7f7unN7u1uzJ0b3O4LIrhCY6uBCJqOpCh1HkT7oSRUJSBffz9l-dBEbs5SlDKJ3NXOdOSvOxFRaKgXDbCnSSouRad7lJKWlzfCFOb58SXXAOj26tymf76mS4Wa3Hp8DE8dICSjdv__AQ2bDmAex2ffQCPur4NzC3jATxYEyF8CgfjkrWsDtz42LeTr35R0vG7NSxdfK-uivr8kiG0ZQgVGU6JS1aRNnLd3s9cR5pncHZ4cLo_8V1zBT8LR2Htj5I8nkeRDEMTyEgFJpWJMirOg5FIeJZmsbJyhAlOxo3MEScansUG0UueJDw0Uj6HrbIq7Q4wNKcyKCtJ9ZqH-dxITsJmuVQmVzL3gHcvVWdOeZwaYCx0RzG70OQITY7QgdDoCA8-9PcsW92NW613Wl_1tgiEBHFYZx5Enff0jYmlMWbcOuQ7dHU_HqlwT8ZTTdfoK1CIedgP7sFuNxO0W_vXmlNtMwK_RHjwtv8ZVy0dxaSlrVZko0QsJaJLD_b6GfQPT_riPx_nDWxPTo-mevrp-MtLuC-aph7ElNuFrfpqZV8htKrnr5ul8weEFhrQ |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED5tHYLxwKAwLTCQQbyBp9hO7PSxQpsqBGMSVCpPVhI7a0eXTmsKgr-eu-aHCg8VvEXJ2VJ0Z99n-bvvAF7r2OWYJWMeKuN5JGXBE-8SbrTPYp9jRiqoOPnjuR6No_eTeLIDrK2FmSLibPZ-euZ04o4Q8-7Cno4Rbfdgb3x-Mfy6vhwwhku5bqorEiO5TnTY1MXUFC5_tSDJT6HWspwkl7mRe-7QgXO2_CMJ7U6JDbkBNe-typv05490Pt_IOmcHNftxuRYrJLLJt5NVlZ3kv_6Sctz2Qw_hQQM52bCOkUew48s-3G0Z7304aDs7sGah9-H-hkzhYzgdlqzmfeDWyC4-f-Kzki7ovWPp_HJxO6um1wzBL0MwyTBortmC1JOrejxretY8gfHZ6Zd3I960X-B5NIgqPkgKncWxiiIXqtiELlWJcUYX4UAmIk9zbbwa4BEoF04ViCSdyLVDfFMkiYicUofQKxelPwKG5lQo5RXpYouoyJwSJH1WKOMKo4oAROsYmzfa5NQiY25bEtqVJWdacqYNpUVnBvCmG3NTK3NstT6q_d3ZIlSSxHKdBBC3EWAbT9VwwmJW2TrlK3RoNx_pdI-GHyy9a538XQRw3EaTbXaHpRVU_YzQMJEBvOw-47qmy5q09IsV2RiplUL8GcDbLgr_4U-f_p_5M9iX6w4fRJs7hl51u_LPEWdV2Ytmqf0GlkYfew |
| 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=An+effective+PSO-inspired+algorithm+for+the+team+orienteering+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Dang%2C+Duc-Cuong&rft.au=Guibadj%2C+Rym+Nesrine&rft.au=Moukrim%2C+Aziz&rft.date=2013-09-01&rft.pub=Elsevier&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=229&rft.issue=2&rft.spage=332&rft.epage=344&rft_id=info:doi/10.1016%2Fj.ejor.2013.02.049&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-00934974v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |