Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
The capacitated arc routing problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary...
Saved in:
| Published in | IEEE transactions on evolutionary computation Vol. 15; no. 2; pp. 151 - 165 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.04.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1089-778X 1941-0026 |
| DOI | 10.1109/TEVC.2010.2051446 |
Cover
| Abstract | The capacitated arc routing problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary algorithms. However, almost all such attempts formulate CARP as a single-objective problem although it usually has more than one objective, especially considering its real-world applications. This paper studies multiobjective CARP (MO-CARP). A new memetic algorithm (MA) called decomposition-based MA with extended neighborhood search (D-MAENS) is proposed. The new algorithm combines the advanced features from both the MAENS approach for single-objective CARP and multiobjective evolutionary optimization. Our experimental studies have shown that such combination outperforms significantly an off-the-shelf multiobjective evolutionary algorithm, namely nondominated sorting genetic algorithm II, and the state-of-the-art multiobjective algorithm for MO-CARP (LMOGA). Our work has also shown that a specifically designed multiobjective algorithm by combining its single-objective version and multiobjective features may lead to competitive multiobjective algorithms for multiobjective combinatorial optimization problems. |
|---|---|
| AbstractList | The capacitated arc routing problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary algorithms. However, almost all such attempts formulate CARP as a single-objective problem although it usually has more than one objective, especially considering its real-world applications. This paper studies multiobjective CARP (MO-CARP). A new memetic algorithm (MA) called decomposition-based MA with extended neighborhood search (D-MAENS) is proposed. The new algorithm combines the advanced features from both the MAENS approach for single-objective CARP and multiobjective evolutionary optimization. Our experimental studies have shown that such combination outperforms significantly an off-the-shelf multiobjective evolutionary algorithm, namely nondominated sorting genetic algorithm II, and the state-of-the-art multiobjective algorithm for MO-CARP (LMOGA). Our work has also shown that a specifically designed multiobjective algorithm by combining its single-objective version and multiobjective features may lead to competitive multiobjective algorithms for multiobjective combinatorial optimization problems. |
| Author | Yi Mei Ke Tang Xin Yao |
| Author_xml | – sequence: 1 givenname: Yi surname: Mei fullname: Mei, Yi – sequence: 2 givenname: Ke surname: Tang fullname: Tang, Ke – sequence: 3 givenname: Xin surname: Yao fullname: Yao, Xin |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24442351$$DView record in Pascal Francis |
| BookMark | eNp9kc1u1DAURi1UJNrCAyA2ERJileLr2Im9HIbyI7UCoYK6s26cO8WjJJ7aDhJvj4cZddEFK9vSOfb1952xkznMxNhL4BcA3Ly7ufy5vhC8HAVXIGX7hJ2CkVBzLtqTsufa1F2nb5-xs5S2nINUYE7Z7QdyYdqF5LMPc_0eEw3VNU2UvatW412IPv-aqk2I1fUyFqbfksv-N1Vr3KHzGXMRVtFV38OS_XxXfYuhH2l6zp5ucEz04riesx8fL2_Wn-urr5--rFdXtWuUzLXhjRCDA9ejEk525S-oGuw5Ua-MgmFA1WqUHWkARMOF0c3Q9Eq22mjTNufs7eHeXQz3C6VsJ58cjSPOFJZkdVsEANCFfP2I3IYlzmU4q5XhsulEV6A3RwiTw3ETcXY-2V30E8Y_VkgpRaOgcHDgXAwpRdo8IMDtvhG7b8TuG7HHRorTPXL-5VdyzxH9-F_z1cH0RPTwUglGiQ6av6UtmZA |
| CODEN | ITEVF5 |
| CitedBy_id | crossref_primary_10_1109_TASE_2021_3119353 crossref_primary_10_1016_j_ins_2013_06_037 crossref_primary_10_1109_TSMCB_2012_2231860 crossref_primary_10_1002_net_21762 crossref_primary_10_1109_TII_2017_2677939 crossref_primary_10_1016_j_asoc_2015_08_059 crossref_primary_10_1007_s10696_012_9166_z crossref_primary_10_1007_s00500_014_1337_2 crossref_primary_10_1007_s12293_015_0170_1 crossref_primary_10_1016_j_cie_2016_12_020 crossref_primary_10_1016_j_neucom_2014_05_025 crossref_primary_10_1109_TAP_2019_2949705 crossref_primary_10_1016_j_ins_2020_11_011 crossref_primary_10_1109_TASE_2013_2274517 crossref_primary_10_1109_TEVC_2014_2301794 crossref_primary_10_1002_cpe_6362 crossref_primary_10_1007_s12293_022_00370_z crossref_primary_10_1109_TEM_2015_2453264 crossref_primary_10_1016_j_trit_2016_11_002 crossref_primary_10_1016_j_asoc_2018_02_026 crossref_primary_10_1016_j_cie_2014_12_029 crossref_primary_10_1016_j_ejor_2015_11_024 crossref_primary_10_1109_TCYB_2019_2931434 crossref_primary_10_1109_TEVC_2022_3215174 crossref_primary_10_1109_TSMC_2019_2912194 crossref_primary_10_1142_S0218001414590095 crossref_primary_10_1016_j_knosys_2021_106957 crossref_primary_10_1080_15472450_2017_1407652 crossref_primary_10_1109_TEVC_2014_2350995 crossref_primary_10_1016_j_swevo_2017_08_001 crossref_primary_10_1016_j_asoc_2016_07_004 crossref_primary_10_1007_s00500_015_1634_4 crossref_primary_10_1016_j_ins_2017_10_041 crossref_primary_10_1590_0101_7438_2022_042_00257386 crossref_primary_10_1016_j_swevo_2017_11_004 crossref_primary_10_1162_evco_a_00267 crossref_primary_10_1007_s00500_018_3631_x crossref_primary_10_1515_amcs_2017_0029 crossref_primary_10_1016_j_ins_2016_10_035 crossref_primary_10_1007_s00500_014_1338_1 crossref_primary_10_1109_TCYB_2013_2295886 crossref_primary_10_1007_s12293_012_0077_z crossref_primary_10_1016_j_ejor_2016_03_053 crossref_primary_10_1016_j_asoc_2016_09_005 crossref_primary_10_1109_TEVC_2015_2424251 crossref_primary_10_3390_su9122353 crossref_primary_10_1016_j_eswa_2012_10_011 crossref_primary_10_1007_s11047_016_9606_x crossref_primary_10_1109_TEVC_2013_2239648 crossref_primary_10_1109_MCI_2023_3304081 crossref_primary_10_1109_TEVC_2014_2362558 crossref_primary_10_1162_EVCO_a_00109 crossref_primary_10_1016_j_cor_2011_12_009 crossref_primary_10_1016_j_jocs_2015_09_003 crossref_primary_10_1016_j_cor_2023_106345 crossref_primary_10_1016_j_neucom_2014_02_058 crossref_primary_10_1016_j_ejor_2023_07_021 crossref_primary_10_1016_j_swevo_2024_101722 crossref_primary_10_1016_j_asoc_2016_09_017 crossref_primary_10_1016_j_asoc_2014_03_005 crossref_primary_10_1016_j_cie_2023_109400 crossref_primary_10_1016_j_swevo_2017_09_012 crossref_primary_10_1177_0954410014548699 crossref_primary_10_1016_j_cie_2024_110755 crossref_primary_10_1016_j_swevo_2022_101040 crossref_primary_10_1007_s00521_022_07714_3 crossref_primary_10_1016_j_knosys_2017_11_009 crossref_primary_10_1109_ACCESS_2021_3073480 crossref_primary_10_1109_TEVC_2013_2281533 crossref_primary_10_1287_trsc_2017_0744 crossref_primary_10_1016_j_swevo_2021_100864 crossref_primary_10_1016_j_engappai_2023_107381 crossref_primary_10_1002_net_21965 crossref_primary_10_1109_TEVC_2015_2395073 crossref_primary_10_1016_j_asoc_2020_106382 crossref_primary_10_1109_TCYB_2020_3043265 crossref_primary_10_1016_j_cor_2022_106052 crossref_primary_10_7463_1215_0829099 crossref_primary_10_3390_su152115347 crossref_primary_10_1016_j_artint_2020_103345 crossref_primary_10_1109_TCYB_2018_2870487 crossref_primary_10_1007_s00521_019_04608_9 crossref_primary_10_1109_TEVC_2022_3195165 crossref_primary_10_1016_j_asoc_2017_04_005 crossref_primary_10_1162_evco_a_00256 crossref_primary_10_1155_2017_2857564 crossref_primary_10_1177_0734242X18801186 crossref_primary_10_1109_ACCESS_2018_2876273 crossref_primary_10_1016_j_asoc_2017_05_033 crossref_primary_10_1016_j_jii_2024_100620 crossref_primary_10_1016_j_ins_2016_06_005 crossref_primary_10_1007_s10898_014_0210_2 crossref_primary_10_1016_j_asoc_2020_106251 crossref_primary_10_1109_ACCESS_2016_2565622 crossref_primary_10_1007_s10710_017_9305_0 crossref_primary_10_1109_TCYB_2017_2728120 crossref_primary_10_1007_s10529_013_1249_8 crossref_primary_10_1109_TEVC_2019_2911736 crossref_primary_10_1590_0101_7438_2025_045_00290743 crossref_primary_10_1109_TEVC_2023_3281810 crossref_primary_10_1016_j_ins_2015_03_002 crossref_primary_10_1007_s00500_015_1986_9 crossref_primary_10_1007_s00500_018_3460_y crossref_primary_10_1016_j_cie_2015_10_005 crossref_primary_10_1109_TCYB_2015_2419276 crossref_primary_10_1016_j_eswa_2020_113184 crossref_primary_10_1109_TEVC_2017_2671462 crossref_primary_10_1109_TEVC_2013_2281503 crossref_primary_10_1007_s12293_017_0224_7 crossref_primary_10_1016_j_ins_2014_03_008 crossref_primary_10_1109_TCYB_2015_2403131 crossref_primary_10_1007_s43069_021_00087_8 crossref_primary_10_1109_TSMC_2018_2818175 crossref_primary_10_1016_j_cor_2019_05_016 crossref_primary_10_1007_s13369_021_06114_4 crossref_primary_10_1016_j_knosys_2016_01_014 crossref_primary_10_1109_TCYB_2014_2307319 crossref_primary_10_1007_s12293_022_00353_0 crossref_primary_10_1016_j_ijpe_2013_04_053 crossref_primary_10_1109_TEVC_2021_3095261 crossref_primary_10_1007_s00500_014_1487_2 crossref_primary_10_1016_j_swevo_2019_03_006 |
| Cites_doi | 10.1016/S0360-8352(02)00178-X 10.1016/0305-0548(83)90026-6 10.1109/MCI.2006.1597056 10.1007/978-1-4615-4495-1_10 10.1109/4235.873238 10.1016/j.ejor.2004.08.017 10.1007/s002910000046 10.1016/j.ejor.2006.06.028 10.1109/TEVC.2007.892759 10.1007/978-3-642-17144-4_1 10.1007/978-1-4615-4495-1 10.1109/4235.996017 10.1109/TEVC.2003.810758 10.1016/S0377-2217(01)00104-7 10.1016/S0377-2217(99)00170-8 10.1109/CEC.2006.1688701 10.1109/TEVC.2002.802873 10.1002/net.3230110308 10.1016/j.cor.2005.02.017 10.1287/opre.48.1.129.12455 10.1016/0166-218X(92)00003-5 10.1016/j.ejor.2004.04.021 10.1016/S0377-2217(02)00334-X 10.1016/j.ejor.2005.12.029 10.1023/B:JMMA.0000038618.37710.f8 10.1007/BF02578918 10.1002/net.20347 10.1002/net.3230220706 10.1109/TEVC.2009.2023449 10.1016/0377-2217(85)90252-8 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6 10.1057/jors.1996.20 10.1023/B:ANOR.0000039517.35989.6d 10.1287/trsc.35.4.425.10431 10.1109/TSMCB.2008.2008906 10.1109/5326.704576 10.1007/s10732-007-9050-2 10.1016/j.cor.2006.07.007 10.1109/TEVC.2005.861417 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2011 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2011 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TEVC.2010.2051446 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1941-0026 |
| EndPage | 165 |
| ExternalDocumentID | 2305378441 24442351 10_1109_TEVC_2010_2051446 5685271 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IF 6IK 6IL 6IN 97E AAJGR AARMG AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG ACGFO ACGFS ACIWK ADZIZ AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CHZPO CS3 EBS EJD HZ~ H~9 IEGSK IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RIL RNS TN5 VH1 AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c354t-90322dc1cba52c47109a53ab0eeb5951dda568a47e811aa902983d3b546898963 |
| IEDL.DBID | RIE |
| ISSN | 1089-778X |
| IngestDate | Mon Sep 29 06:16:48 EDT 2025 Mon Jun 30 06:38:41 EDT 2025 Mon Jul 21 09:16:30 EDT 2025 Thu Apr 24 23:12:04 EDT 2025 Wed Oct 01 02:39:34 EDT 2025 Tue Aug 26 17:17:22 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Local search Fleet Fleet management Combinatorial problem Evolutionary algorithm Multiobjective programming Routing Combinatorial optimization Competitive algorithms Capacitated arc routing problem CARP multiobjective optimization Memetic algorithm Capacitated arc routing problem (CARP) Neighborhood search Genetic algorithm memetic algorithms (MA) Heuristic method Capacity constraint Metamodel meta-heuristics Logistics |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c354t-90322dc1cba52c47109a53ab0eeb5951dda568a47e811aa902983d3b546898963 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 859043727 |
| PQPubID | 85418 |
| PageCount | 15 |
| ParticipantIDs | pascalfrancis_primary_24442351 crossref_primary_10_1109_TEVC_2010_2051446 proquest_journals_859043727 crossref_citationtrail_10_1109_TEVC_2010_2051446 proquest_miscellaneous_869831118 ieee_primary_5685271 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2011-04-01 |
| PublicationDateYYYYMMDD | 2011-04-01 |
| PublicationDate_xml | – month: 04 year: 2011 text: 2011-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on evolutionary computation |
| PublicationTitleAbbrev | TEVC |
| PublicationYear | 2011 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | dearmon (ref39) 1981 ref35 ref13 ref34 ref12 ref37 ref15 ref36 ref14 ref31 ref30 ref33 ref11 ref32 ref10 ref2 ref1 ref17 ref38 ref16 ref19 czyzzak (ref45) 1998; 7 lacomme (ref18) 2004; 131 tang (ref22) 2009; 13 ref24 bader (ref46) 2008 ref20 ref41 ref44 ref21 ref43 zitzler (ref28) 2002 lacomme (ref23) 2006; 33 ref29 schaffer (ref27) 1985 ref8 ref7 ref9 pareto (ref25) 1896; i and ii ref4 ref3 ref6 ref5 eglese (ref42) 1996 ref40 zitzler (ref26) 2004; 535 |
| References_xml | – ident: ref17 doi: 10.1016/S0360-8352(02)00178-X – ident: ref12 doi: 10.1016/0305-0548(83)90026-6 – ident: ref3 doi: 10.1109/MCI.2006.1597056 – ident: ref9 doi: 10.1007/978-1-4615-4495-1_10 – ident: ref38 doi: 10.1109/4235.873238 – ident: ref7 doi: 10.1016/j.ejor.2004.08.017 – ident: ref30 doi: 10.1007/s002910000046 – ident: ref4 doi: 10.1016/j.ejor.2006.06.028 – ident: ref29 doi: 10.1109/TEVC.2007.892759 – volume: 535 start-page: 3 year: 2004 ident: ref26 publication-title: Lecture Notes in Economics and Mathematical Systems doi: 10.1007/978-3-642-17144-4_1 – ident: ref1 doi: 10.1007/978-1-4615-4495-1 – year: 1981 ident: ref39 publication-title: A Comparison of Heuristics for the Capacitated Chinese Postman Problem – ident: ref24 doi: 10.1109/4235.996017 – ident: ref44 doi: 10.1109/TEVC.2003.810758 – ident: ref33 doi: 10.1016/S0377-2217(01)00104-7 – start-page: 93 year: 1985 ident: ref27 article-title: Multiple objective optimization with vector evaluated genetic algorithms publication-title: Proc 4th Int Conf Genetic Algorithms – ident: ref6 doi: 10.1016/S0377-2217(99)00170-8 – ident: ref2 doi: 10.1109/CEC.2006.1688701 – ident: ref34 doi: 10.1109/TEVC.2002.802873 – ident: ref11 doi: 10.1002/net.3230110308 – volume: 33 start-page: 3473 year: 2006 ident: ref23 article-title: A genetic algorithm for a bi-objective capacitated arc routing problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2005.02.017 – start-page: 633 year: 1996 ident: ref42 publication-title: Metaheuristics Theory and Applications – volume: i and ii year: 1896 ident: ref25 publication-title: Cours D'Economic Politique – ident: ref14 doi: 10.1287/opre.48.1.129.12455 – ident: ref41 doi: 10.1016/0166-218X(92)00003-5 – ident: ref8 doi: 10.1016/j.ejor.2004.04.021 – ident: ref16 doi: 10.1016/S0377-2217(02)00334-X – ident: ref35 doi: 10.1016/j.ejor.2005.12.029 – start-page: 95 year: 2002 ident: ref28 article-title: SPEA2: Improving the strength Pareto evolutionary algorithm publication-title: Proc Evol Methods Des Optim Control Appl Ind Probl – ident: ref5 doi: 10.1023/B:JMMA.0000038618.37710.f8 – ident: ref31 doi: 10.1007/BF02578918 – ident: ref20 doi: 10.1002/net.20347 – ident: ref40 doi: 10.1002/net.3230220706 – volume: 13 start-page: 1151 year: 2009 ident: ref22 article-title: Memetic algorithm with extended neighborhood search for capacitated arc routing problems publication-title: IEEE Trans Evol Comput doi: 10.1109/TEVC.2009.2023449 – ident: ref13 doi: 10.1016/0377-2217(85)90252-8 – volume: 7 start-page: 34 year: 1998 ident: ref45 article-title: Pareto simulated annealing: A metaheuristic technique for multiple-objective combinatorial optimization publication-title: J Multi-Criteria Decision Anal doi: 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6 – ident: ref43 doi: 10.1057/jors.1996.20 – volume: 131 start-page: 159 year: 2004 ident: ref18 article-title: Competitive memetic algorithms for arc routing problem publication-title: Ann Oper Res doi: 10.1023/B:ANOR.0000039517.35989.6d – ident: ref15 doi: 10.1287/trsc.35.4.425.10431 – ident: ref21 doi: 10.1109/TSMCB.2008.2008906 – ident: ref32 doi: 10.1109/5326.704576 – ident: ref10 doi: 10.1007/s10732-007-9050-2 – ident: ref19 doi: 10.1016/j.cor.2006.07.007 – ident: ref37 doi: 10.1007/s002910000046 – ident: ref36 doi: 10.1109/TEVC.2005.861417 – year: 2008 ident: ref46 publication-title: HypE An algorithm for fast hypervolume-based many-objective optimization |
| SSID | ssj0014519 |
| Score | 2.4408674 |
| Snippet | The capacitated arc routing problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 151 |
| SubjectTerms | Algorithm design and analysis Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Capacitated arc routing problem (CARP) Carp Combinatorial analysis Computer science; control theory; systems Decomposition Diversity reception Evolutionary Evolutionary algorithms Exact sciences and technology Flows in networks. Combinatorial problems Genetic algorithms local search Logistics Mathematical programming memetic algorithms (MA) Memetics meta-heuristics Molybdenum multiobjective optimization Operational research and scientific management Operational research. Management science Optimization Route optimization Routing Salting Sorting Studies Theoretical computing Vehicles |
| Title | Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem |
| URI | https://ieeexplore.ieee.org/document/5685271 https://www.proquest.com/docview/859043727 https://www.proquest.com/docview/869831118 |
| Volume | 15 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE/IET Electronic Library customDbUrl: eissn: 1941-0026 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014519 issn: 1089-778X databaseCode: RIE dateStart: 19970101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1BT9swFH5iPW2HscHQCgz5sBMiJYlj1z52HaiaxLQDTL1Fju3AWGmmkl749bwXuxHb0LRbJNtJ7Gf7Pft973sAH7OMW2mzIjHc6KSweZVoP67xlOIMz0nB2I7t86ucXRVf5mK-BSd9LIz3vgOf-RE9dr5819g1XZWdCqlETgHjL8ZKhlit3mNANCkBTK_RYlTz6MHMUn16efZ9GkBcObF9k637RAd1SVUIEmnucVTqkM7ir525Uzfn23Cx-dGAMvk5WrfVyD78weH4vz15A6-j3ckmYaK8hS2_3IHtTU4HFpf4Drx6QlC4C_PPnjDnEdiVfEKV59iFv6PIRzZZXDerH-3NHUPDl3WRvE11GzZQNkUlbCl-DRtMVpYR8ghfyb6FBDbv4Or87HI6S2IuhsRyUbSJTnHlO5vZyojcFoTgNIKbKvW-EmilOWewT6YYe5VlxmhidueOV6KQlKBS8j0YLJulfw9My8zXptbKOFXUThohPNHeaal5nTs1hHQjndJGonLKl7EouwNLqksSaEkCLaNAh3DcN_kVWDr-VXmXBNJXjLIYwtFvU6AvRwMIbU6BFQ42c6KMC_2-VEITO1Q-HgLrS3GFktvFLH2zxioShwJVitp__sMH8DJcVBMc6BAG7WrtP6Cl01ZH3RR_BOom-Yc |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9QwEB1V5QAcKLSgLoXiAydEtkn8sfFx2bZaoFtx2KK9RY7tQKHdoG32wq9nJvZGLSDELZLtJPbYnrHnzRuA11nGrbKZSAw3OhE2rxLtRzWeUpzhOSkY27F9nqvphfiwkIsteNvHwnjvO_CZH9Jj58t3jV3TVdmRVIXMKWD8nhRCyBCt1fsMiCglwOk12ozFIvows1QfzU8-TwKMKye-b7J2b2mhLq0KgSLNDY5LHRJa_LE3dwrndAdmm18NOJPvw3VbDe3P31gc_7cvj-FRtDzZOEyVJ7Dll7uws8nqwOIi34WHtygK92Bx7Al1HqFdyTtUeo7N_DXFPrLx1Zdmddl-vWZo-rIulrepvoUtlE1QDVuKYMMG45VlhD3CV7JPIYXNU7g4PZlPpknMxpBYLkWb6BTXvrOZrYzMrSAMp5HcVKn3lUQ7zTmDfTJi5IssM0YTtzt3vJJCUYpKxZ_B9rJZ-n1gWmW-NrUujCtE7ZSR0hPxnVaa17krBpBupFPaSFVOGTOuyu7IkuqSBFqSQMso0AG86Zv8CDwd_6q8RwLpK0ZZDODwzhToy9EEQqtTYoWDzZwo41K_KQupiR8qHw2A9aW4RsnxYpa-WWMVhUOBSqV4_vcPv4L70_nsrDx7f_7xAB6Ea2sCB72A7Xa19i_R7mmrw266_wIcfPzU |
| 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=Decomposition-Based+Memetic+Algorithm+for+Multiobjective+Capacitated+Arc+Routing+Problem&rft.jtitle=IEEE+transactions+on+evolutionary+computation&rft.au=YI+MEI&rft.au=KE+TANG&rft.au=XIN+YAO&rft.date=2011-04-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=1089-778X&rft.volume=15&rft.issue=2&rft.spage=151&rft.epage=165&rft_id=info:doi/10.1109%2FTEVC.2010.2051446&rft.externalDBID=n%2Fa&rft.externalDocID=24442351 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-778X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-778X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-778X&client=summon |