Speed-up techniques for solving large-scale biobjective TSP
In this paper, we present the Two-Phase Pareto Local Search ( 2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The 2PPLS method is a state-of-the-art method for this problem. However, because of its running time that strongly grows wi...
Saved in:
| Published in: | Computers & operations research Vol. 37; no. 3; pp. 521 - 533 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
01.03.2010
Pergamon Press Inc |
| Subjects: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper, we present the Two-Phase Pareto Local Search (
2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The
2PPLS method is a state-of-the-art method for this problem. However, because of its running time that strongly grows with the instances size, the method can be hardly applied to instances with more than 200 cities. We thus adapt some speed-up techniques used in single-objective optimization to the biobjective case. The proposed method is able to solve instances with up to 1000 cities in a reasonable time with no, or very small, reduction of the quality of the generated approximations. |
|---|---|
| AbstractList | In this paper, we present the Two-Phase Pareto Local Search (
2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The
2PPLS method is a state-of-the-art method for this problem. However, because of its running time that strongly grows with the instances size, the method can be hardly applied to instances with more than 200 cities. We thus adapt some speed-up techniques used in single-objective optimization to the biobjective case. The proposed method is able to solve instances with up to 1000 cities in a reasonable time with no, or very small, reduction of the quality of the generated approximations. In this paper, we present the Two-Phase Pareto Local Search (2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The 2PPLS method is a state-of-the-art method for this problem. However, because of its running time that strongly grows with the instances size, the method can be hardly applied to instances with more than 200 cities. We thus adapt some speed-up techniques used in single-objective optimization to the biobjective case. The proposed method is able to solve instances with up to 1000 cities in a reasonable time with no, or very small, reduction of the quality of the generated approximations. [PUBLICATION ABSTRACT] In this paper, we present the Two-Phase Pareto Local Search (2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The 2PPLS method is a state-of-the- art method for this problem. However, because of its running time that strongly grows with the instances size, the method can be hardly applied to instances with more than 200 cities. We thus adapt some speed-up techniques used in single-objective optimization to the biobjective case. The proposed method is able to solve instances with up to 1000 cities in a reasonable time with no, or very small, reduction of the quality of the generated approximations. |
| Author | Jaszkiewicz, A. Lust, T. |
| Author_xml | – sequence: 1 givenname: T. surname: Lust fullname: Lust, T. email: thibaut.lust@fpms.ac.be organization: Faculté Polytechnique de Mons, Laboratory of Mathematics and Operational Research, 9, rue de Houdain, 7000 Mons, Belgium – sequence: 2 givenname: A. surname: Jaszkiewicz fullname: Jaszkiewicz, A. organization: Poznań University of Technology, Institute of Computing Science, Ul. Piotrowo 3A, 60-965 Poznań, Poland |
| BookMark | eNp9kDtrwzAUhUVJoenjB3QzHbrZvbIs2yJTKX1BoIWk0E3I0nUq41ip5AT676uQThl6l7uc73D4zslkcAMSck0ho0DLuy7Tzmc5gMiAZgD8hExpXbG0KvnnhEyBAU-BF_UZOQ-hg3hVTqdkttggmnS7SUbUX4P93mJIWueT4PqdHVZJr_wK06BVj0ljXdOhHu0Ok-Xi_ZKctqoPePX3L8jH0-Py4SWdvz2_PtzPU804H1NDDTLNhc5zxisOtFXMFDmrckBW1wZMWzeCVwYaAboUTa0o8hLKQglNWcEuyO2hd-Pdft8o1zZo7Hs1oNsGyQoRi6mIwZujYOe2fojbJBW8LuqC0xiqDiHtXQgeW6ntqEbrhtEr20sKcm9UdjIalXujEqiMRiNJj8iNt2vlf_5lZgcGo6CdRS-DtjhoNNZHk9I4-w_9C4YyjsA |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1016_j_swevo_2011_11_003 crossref_primary_10_1109_TEVC_2011_2182651 crossref_primary_10_1016_j_eswa_2022_117072 crossref_primary_10_1016_j_jclepro_2024_144487 crossref_primary_10_1016_j_ejor_2018_06_009 crossref_primary_10_1016_j_knosys_2017_11_009 crossref_primary_10_1007_s11721_012_0070_7 crossref_primary_10_1016_j_amc_2014_03_110 crossref_primary_10_1007_s00500_018_3631_x crossref_primary_10_1016_j_ast_2017_11_040 crossref_primary_10_1109_TCYB_2013_2295886 crossref_primary_10_3389_frobt_2021_689908 crossref_primary_10_1016_j_tre_2019_04_004 crossref_primary_10_1016_j_ejor_2017_01_028 crossref_primary_10_1109_TCYB_2018_2880256 crossref_primary_10_1016_S2212_5671_12_00147_5 crossref_primary_10_1016_j_swevo_2019_05_007 crossref_primary_10_1080_23302674_2022_2127340 crossref_primary_10_1109_TCYB_2018_2849403 crossref_primary_10_1007_s10479_017_2415_5 crossref_primary_10_1016_j_eswa_2015_10_019 crossref_primary_10_1109_TCYB_2022_3226744 crossref_primary_10_1007_s12065_021_00613_x crossref_primary_10_1007_s12065_023_00904_5 crossref_primary_10_1016_j_trb_2013_02_007 crossref_primary_10_1080_01966324_2024_2443832 crossref_primary_10_1007_s00521_025_11029_4 crossref_primary_10_1038_s41598_023_31123_8 crossref_primary_10_1007_s41066_018_0094_5 crossref_primary_10_1016_j_eswa_2015_07_051 crossref_primary_10_1016_j_cor_2016_04_025 crossref_primary_10_1109_TCYB_2019_2931434 crossref_primary_10_1109_TEVC_2022_3215174 crossref_primary_10_1016_j_cor_2016_04_027 crossref_primary_10_1007_s00500_015_1921_0 crossref_primary_10_1007_s10732_011_9181_3 crossref_primary_10_1016_j_eswa_2024_124296 |
| Cites_doi | 10.1287/ijoc.3.4.376 10.1007/978-3-642-48782-8_9 10.1007/s10732-009-9103-9 10.1016/j.dam.2005.05.020 10.1016/j.cor.2005.10.003 10.1007/s10288-006-0002-8 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6 10.1287/ijoc.15.1.82.15157 10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O 10.1109/TEVC.2002.802873 10.1016/j.ejor.2006.12.054 10.1287/ijoc.4.4.387 10.1287/mnsc.25.1.73 |
| ContentType | Journal Article |
| Copyright | 2009 Elsevier Ltd Copyright Pergamon Press Inc. Mar 2010 |
| Copyright_xml | – notice: 2009 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Mar 2010 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2009.01.005 |
| DatabaseName | 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 Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 533 |
| ExternalDocumentID | 1867617811 10_1016_j_cor_2009_01_005 S0305054809000173 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c355t-d1de3c59c22357501fa3d423720e388d0df8b957d0b90c69b8a1e56064a9c1343 |
| ISICitedReferencesCount | 46 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000271369400010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sun Sep 28 02:45:05 EDT 2025 Mon Jul 14 07:38:50 EDT 2025 Tue Nov 18 21:35:16 EST 2025 Sat Nov 29 03:23:34 EST 2025 Fri Feb 23 02:33:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | TSP Local search Hybrid metaheuristics Multiobjective combinatorial optimization Speed-up techniques |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c355t-d1de3c59c22357501fa3d423720e388d0df8b957d0b90c69b8a1e56064a9c1343 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 195848451 |
| PQPubID | 45870 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_34935719 proquest_journals_195848451 crossref_citationtrail_10_1016_j_cor_2009_01_005 crossref_primary_10_1016_j_cor_2009_01_005 elsevier_sciencedirect_doi_10_1016_j_cor_2009_01_005 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-03-01 |
| PublicationDateYYYYMMDD | 2010-03-01 |
| PublicationDate_xml | – month: 03 year: 2010 text: 2010-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2010 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Goldberg (bib12) 1989 Przybylski, Gandibleux, Ehrgott (bib21) 2008; 185 Aneja, Nair (bib1) 1979; 25 Bentley (bib5) 1992; 4 Jaszkiewicz (bib15) 2002; 6 Czyzak, Jaszkiewicz (bib6) 1998; 7 Basseur (bib4) 2006; 4 Lust T, Teghem J. Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics 2009; doi Deb (bib7) 2001 Ulungu, Teghem (bib24) 1995; 20 Hansen P. Bicriterion path problems. In: Lecture notes in economics and mathematical systems, vol. 177, 1979, p. 109–27. Angel, Bampis, Gourvès (bib2) 2004; vol. 535 Ulungu, Teghem, Fortemps, Tuyttens (bib25) 1999; 8 Ehrgott, Gandibleux (bib9) 2002 Steiglitz, Weiner (bib23) 1968 Johnson, McGeoch (bib16) 1997 Zitzler E. Evolutionary algorithms for multiobjective optimization: methods and applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland; November 1999. Paquete, Stützle (bib20) April 2003; vol. 2632 Paquete, Chiarandini, Stützle (bib19) 2004; vol. 535 Ehrgott, Gandibleux (bib10) 2007; 34 Appletgate (bib3) 2003; 15 Zitzler, Laumanns, Thiele, Fonseca, Grunert da Fonseca (bib27) July 2002 . Ehrgott (bib8) 2005 Ferguson (bib11) 1967 Reinelt (bib22) 1991; 3 Hansen, Mladenovic (bib14) 2006; 154 Lust T, Teghem J. Two-phase stochastic local search algorithms for the biobjective traveling salesman problem. Technical Report, IRIDIA, Technical Report No.TR/IRIDIA/2007-014; 2007. Basseur (10.1016/j.cor.2009.01.005_bib4) 2006; 4 Przybylski (10.1016/j.cor.2009.01.005_bib21) 2008; 185 Angel (10.1016/j.cor.2009.01.005_bib2) 2004; vol. 535 Steiglitz (10.1016/j.cor.2009.01.005_bib23) 1968 Czyzak (10.1016/j.cor.2009.01.005_bib6) 1998; 7 Bentley (10.1016/j.cor.2009.01.005_bib5) 1992; 4 Deb (10.1016/j.cor.2009.01.005_bib7) 2001 Ehrgott (10.1016/j.cor.2009.01.005_bib9) 2002 Goldberg (10.1016/j.cor.2009.01.005_bib12) 1989 Aneja (10.1016/j.cor.2009.01.005_bib1) 1979; 25 Paquete (10.1016/j.cor.2009.01.005_bib20) 2003; vol. 2632 10.1016/j.cor.2009.01.005_bib26 Johnson (10.1016/j.cor.2009.01.005_bib16) 1997 Ehrgott (10.1016/j.cor.2009.01.005_bib8) 2005 Paquete (10.1016/j.cor.2009.01.005_bib19) 2004; vol. 535 Ulungu (10.1016/j.cor.2009.01.005_bib25) 1999; 8 Reinelt (10.1016/j.cor.2009.01.005_bib22) 1991; 3 Jaszkiewicz (10.1016/j.cor.2009.01.005_bib15) 2002; 6 Ehrgott (10.1016/j.cor.2009.01.005_bib10) 2007; 34 Ferguson (10.1016/j.cor.2009.01.005_bib11) 1967 Zitzler (10.1016/j.cor.2009.01.005_bib27) 2002 10.1016/j.cor.2009.01.005_bib13 Hansen (10.1016/j.cor.2009.01.005_bib14) 2006; 154 Ulungu (10.1016/j.cor.2009.01.005_bib24) 1995; 20 Appletgate (10.1016/j.cor.2009.01.005_bib3) 2003; 15 10.1016/j.cor.2009.01.005_bib17 10.1016/j.cor.2009.01.005_bib18 |
| References_xml | – volume: vol. 2632 start-page: 479 year: April 2003 end-page: 493 ident: bib20 article-title: A two-phase local search for the biobjective traveling salesman problem publication-title: Evolutionary multi-criterion optimization. Second international conference, EMO 2003. Lecture notes in computer science – volume: 15 start-page: 82 year: 2003 end-page: 92 ident: bib3 article-title: Chained Lin–Kernighan for large traveling salesman problems publication-title: INFORMS Journal on Computing – volume: 8 start-page: 221 year: 1999 end-page: 236 ident: bib25 article-title: MOSA method: a tool for solving multiobjective combinatorial optimization problems publication-title: Journal of Multi-Criteria Decision Analysis – volume: 4 start-page: 387 year: 1992 end-page: 411 ident: bib5 article-title: Fast algorithms for geometric traveling salesman problems publication-title: ORSA Journal on Computing – year: 1989 ident: bib12 article-title: Genetic algorithms for search, optimization, and machine learning – volume: 20 start-page: 149 year: 1995 end-page: 156 ident: bib24 article-title: The two phases method: an efficient procedure to solve biobjective combinatorial optimization problems publication-title: Foundation of Computing and Decision Science – reference: Lust T, Teghem J. Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics 2009; doi: – year: 2001 ident: bib7 article-title: Multi-objective optimization using evolutionary algorithms. Wiley-interscience series in systems and optimization – volume: vol. 535 start-page: 177 year: 2004 end-page: 199 ident: bib19 article-title: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study publication-title: Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems – year: 2002 ident: bib9 article-title: Multiple criteria optimization: state of the art annotated bibliographic surveys – reference: Hansen P. Bicriterion path problems. In: Lecture notes in economics and mathematical systems, vol. 177, 1979, p. 109–27. – volume: 4 start-page: 255 year: 2006 end-page: 258 ident: bib4 article-title: Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem publication-title: 4OR – volume: 34 start-page: 2674 year: 2007 end-page: 2694 ident: bib10 article-title: Bound sets for biobjective combinatorial optimization problems publication-title: Computers and Operations Research – start-page: 215 year: 1997 end-page: 310 ident: bib16 article-title: The traveling salesman problem: a case study publication-title: Local search in combinatorial optimization – volume: 3 start-page: 376 year: 1991 end-page: 384 ident: bib22 article-title: Tsplib—a traveling salesman problem library publication-title: ORSA Journal of Computing – start-page: 666 year: July 2002 end-page: 673 ident: bib27 article-title: Why quality assessment of multiobjective optimizers is difficult publication-title: Proceedings of the genetic and evolutionary computation conference (GECCO’2002) – volume: vol. 535 start-page: 153 year: 2004 end-page: 176 ident: bib2 article-title: A dynasearch neighborhood for the bicriteria traveling salesman problem publication-title: Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems – volume: 154 start-page: 802 year: 2006 end-page: 817 ident: bib14 article-title: First vs. best improvement: an empirical study publication-title: Discrete Applied Mathematics – volume: 25 start-page: 73 year: 1979 end-page: 78 ident: bib1 article-title: Bicriteria transportation problem publication-title: Management Science – reference: Lust T, Teghem J. Two-phase stochastic local search algorithms for the biobjective traveling salesman problem. Technical Report, IRIDIA, Technical Report No.TR/IRIDIA/2007-014; 2007. – start-page: 814 year: 1968 end-page: 821 ident: bib23 article-title: Some improved algorithms for computer solution of the traveling salesman problem publication-title: Proceedings 6th annual allerton conference on communication, control, and computing – reference: Zitzler E. Evolutionary algorithms for multiobjective optimization: methods and applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland; November 1999. – year: 2005 ident: bib8 article-title: Multicriteria optimization – volume: 7 start-page: 34 year: 1998 end-page: 47 ident: bib6 article-title: Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimization publication-title: Journal of Multi-Criteria Decision Analysis – volume: 6 start-page: 402 year: 2002 end-page: 412 ident: bib15 article-title: On the performance of multiple-objective genetic local search on the 0/1 Knapsack problem—a comparative experiment publication-title: IEEE Transactions on Evolutionary Computation – year: 1967 ident: bib11 article-title: Mathematical statistics, a decision theoretic approach – reference: . – volume: 185 start-page: 509 year: 2008 end-page: 533 ident: bib21 article-title: Two-phase algorithms for the biobjective assignment problem publication-title: European Journal of Operational Research – volume: vol. 535 start-page: 177 year: 2004 ident: 10.1016/j.cor.2009.01.005_bib19 article-title: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study – year: 1989 ident: 10.1016/j.cor.2009.01.005_bib12 – volume: 3 start-page: 376 issue: 4 year: 1991 ident: 10.1016/j.cor.2009.01.005_bib22 article-title: Tsplib—a traveling salesman problem library publication-title: ORSA Journal of Computing doi: 10.1287/ijoc.3.4.376 – ident: 10.1016/j.cor.2009.01.005_bib13 doi: 10.1007/978-3-642-48782-8_9 – volume: vol. 535 start-page: 153 year: 2004 ident: 10.1016/j.cor.2009.01.005_bib2 article-title: A dynasearch neighborhood for the bicriteria traveling salesman problem – year: 2005 ident: 10.1016/j.cor.2009.01.005_bib8 – volume: 20 start-page: 149 year: 1995 ident: 10.1016/j.cor.2009.01.005_bib24 article-title: The two phases method: an efficient procedure to solve biobjective combinatorial optimization problems publication-title: Foundation of Computing and Decision Science – volume: vol. 2632 start-page: 479 year: 2003 ident: 10.1016/j.cor.2009.01.005_bib20 article-title: A two-phase local search for the biobjective traveling salesman problem – ident: 10.1016/j.cor.2009.01.005_bib17 doi: 10.1007/s10732-009-9103-9 – ident: 10.1016/j.cor.2009.01.005_bib18 – start-page: 814 year: 1968 ident: 10.1016/j.cor.2009.01.005_bib23 article-title: Some improved algorithms for computer solution of the traveling salesman problem – year: 1967 ident: 10.1016/j.cor.2009.01.005_bib11 – volume: 154 start-page: 802 year: 2006 ident: 10.1016/j.cor.2009.01.005_bib14 article-title: First vs. best improvement: an empirical study publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2005.05.020 – volume: 34 start-page: 2674 year: 2007 ident: 10.1016/j.cor.2009.01.005_bib10 article-title: Bound sets for biobjective combinatorial optimization problems publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.10.003 – year: 2002 ident: 10.1016/j.cor.2009.01.005_bib9 – year: 2001 ident: 10.1016/j.cor.2009.01.005_bib7 – volume: 4 start-page: 255 issue: 3 year: 2006 ident: 10.1016/j.cor.2009.01.005_bib4 article-title: Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem publication-title: 4OR doi: 10.1007/s10288-006-0002-8 – volume: 7 start-page: 34 year: 1998 ident: 10.1016/j.cor.2009.01.005_bib6 article-title: Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimization publication-title: Journal of Multi-Criteria Decision Analysis doi: 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6 – ident: 10.1016/j.cor.2009.01.005_bib26 – volume: 15 start-page: 82 year: 2003 ident: 10.1016/j.cor.2009.01.005_bib3 article-title: Chained Lin–Kernighan for large traveling salesman problems publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.15.1.82.15157 – start-page: 215 year: 1997 ident: 10.1016/j.cor.2009.01.005_bib16 article-title: The traveling salesman problem: a case study – volume: 8 start-page: 221 issue: 4 year: 1999 ident: 10.1016/j.cor.2009.01.005_bib25 article-title: MOSA method: a tool for solving multiobjective combinatorial optimization problems publication-title: Journal of Multi-Criteria Decision Analysis doi: 10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O – start-page: 666 year: 2002 ident: 10.1016/j.cor.2009.01.005_bib27 article-title: Why quality assessment of multiobjective optimizers is difficult – volume: 6 start-page: 402 issue: 4 year: 2002 ident: 10.1016/j.cor.2009.01.005_bib15 article-title: On the performance of multiple-objective genetic local search on the 0/1 Knapsack problem—a comparative experiment publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2002.802873 – volume: 185 start-page: 509 issue: 2 year: 2008 ident: 10.1016/j.cor.2009.01.005_bib21 article-title: Two-phase algorithms for the biobjective assignment problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.12.054 – volume: 4 start-page: 387 year: 1992 ident: 10.1016/j.cor.2009.01.005_bib5 article-title: Fast algorithms for geometric traveling salesman problems publication-title: ORSA Journal on Computing doi: 10.1287/ijoc.4.4.387 – volume: 25 start-page: 73 year: 1979 ident: 10.1016/j.cor.2009.01.005_bib1 article-title: Bicriteria transportation problem publication-title: Management Science doi: 10.1287/mnsc.25.1.73 |
| SSID | ssj0000721 |
| Score | 2.175538 |
| Snippet | In this paper, we present the Two-Phase Pareto Local Search (
2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling... In this paper, we present the Two-Phase Pareto Local Search (2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 521 |
| SubjectTerms | Approximation Heuristic Hybrid metaheuristics Local search Multiobjective combinatorial optimization Optimization techniques Speed-up techniques Studies Traveling salesman problem TSP |
| Title | Speed-up techniques for solving large-scale biobjective TSP |
| URI | https://dx.doi.org/10.1016/j.cor.2009.01.005 https://www.proquest.com/docview/195848451 https://www.proquest.com/docview/34935719 |
| Volume | 37 |
| WOSCitedRecordID | wos000271369400010&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: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdgQ2g88FFAlPGRB3ih8uTUcWOLpwlawVSVSuukvlmx46KWKc2aFqb99ZxjJ80GVPDAS1QlddL6fr67nO9-h9CbqEe4TnsEa3C_caSUwsrMKE4UA4tiRMhmJYnrMB6N-HQqxj6YU5TtBOIs45eXIv-vooZzIGxbOvsP4q5vCifgMwgdjiB2OP6V4E9zMEh4k3dqetaScqEDTy2DB-c29xsXIBvTUfOlWjiV15mcjpueatXuoSjBsczNyifNeXqgOow83LiykTrb-iQprr7NzY-5vtoGS31gwe6J02ZgYWxWX23DI5cLcj0t02oJDM6e05zmN-e8bnWELh5DtKEomauL_kWBu1jCAuZ_5clEwyNC2NZaVTv0oy9ycDYcykl_Orl-1b3b8F5sqx_BHtBBfoFtmzG7Hf-WfnQiv432uzEToMv3jz_3pydb8x2XxXr136m2wsukwBs_60_OzA2zXvoqk4fovn_JCI4dOB6hWyZrobtVjUMLPaiEG3jV3kL3GsSUj9H7CkTBFkQBgCjwIAoaIAoaIAoARE_Q2aA_-fAJ-zYbWIOzucZpmBqqmdBdS33ESDhLaGqzpbrEUM5Tks64EixOiRJE94TiSWjAUe5FidAhjehTtJctM_MMBSGsbp5QIuB2USqYSjSPZyzSjMWKxrSNSDVfUnsOetsK5VxWyYYLCVNse6MKSUIJU9xG7-ohuSNg2fXlqBKC9B6k8wwl4GvXsMNKYNKv5EJaFqaIRyxso9f1VdC9dkMtycxyU0gaCZixUDzfOf4QHWyX1wu0t15tzEt0R39fz4vVKw-_n6HFoCA |
| 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=Speed-up+techniques+for+solving+large-scale+biobjective+TSP&rft.jtitle=Computers+%26+operations+research&rft.au=Lust%2C+T&rft.au=Jaszkiewicz%2C+A&rft.date=2010-03-01&rft.pub=Pergamon+Press+Inc&rft.issn=0305-0548&rft.eissn=0305-0548&rft.volume=37&rft.issue=3&rft.spage=521&rft_id=info:doi/10.1016%2Fj.cor.2009.01.005&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=1867617811 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |