Grouping memetic search for the colored traveling salesmen problem Article Swipe

PDF

Pengfei He , Jin‐Kao Hao , Qinghua Wu ·

YOU? · · 2021 · Open Access · · DOI: https://doi.org/10.1016/j.ins.2021.04.090

Related Topics

Memetic Algorithm

Travelling Salesman Problem

Benchmark (Surveying)

Artificial Intelligence

Concepts

Memetic algorithm Travelling salesman problem Crossover Initialization Mathematical optimization Benchmark (surveying) 2-opt Local search (optimization) Computer science Solver Heuristic Bottleneck traveling salesman problem Local optimum Set (abstract data type) Population Greedy algorithm Mathematics Artificial intelligence Programming language Demography Geography Sociology Geodesy

Metadata

Type: article
Language: en
Landing Page: https://doi.org/10.1016/j.ins.2021.04.090
PDF: https://www.sciencedirect.com/science/article/am/pii/S002002552100431X
OA Status: bronze
Cited By: 26
References: 40
Related Works: 10
OpenAlex ID: https://openalex.org/W3161243347

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W3161243347

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.1016/j.ins.2021.04.090

Digital Object Identifier
Title: Grouping memetic search for the colored traveling salesmen problem

Work title
Type: article

OpenAlex work type
Language: en

Primary language
Publication year: 2021

Year of publication
Publication date: 2021-05-04

Full publication date if available
Authors: Pengfei He, Jin‐Kao Hao, Qinghua Wu

List of authors in order
Landing page: https://doi.org/10.1016/j.ins.2021.04.090

Publisher landing page
PDF URL: https://www.sciencedirect.com/science/article/am/pii/S002002552100431X

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: bronze

Open access status per OpenAlex
OA URL: https://www.sciencedirect.com/science/article/am/pii/S002002552100431X

Direct OA link when available
Concepts: Memetic algorithm, Travelling salesman problem, Crossover, Initialization, Mathematical optimization, Benchmark (surveying), 2-opt, Local search (optimization), Computer science, Solver, Heuristic, Bottleneck traveling salesman problem, Local optimum, Set (abstract data type), Population, Greedy algorithm, Mathematics, Artificial intelligence, Programming language, Demography, Geography, Sociology, Geodesy

Top concepts (fields/topics) attached by OpenAlex
Cited by: 26

Total citation count in OpenAlex
Citations by year (recent): 2025: 6, 2024: 6, 2023: 7, 2022: 6, 2021: 1

Per-year citation counts (last 5 years)
References (count): 40

Number of works referenced by this work
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W3161243347
doi	https://doi.org/10.1016/j.ins.2021.04.090
ids.doi	https://doi.org/10.1016/j.ins.2021.04.090
ids.mag	3161243347
ids.openalex	https://openalex.org/W3161243347
fwci	3.02765817
type	article
title	Grouping memetic search for the colored traveling salesmen problem
biblio.issue
biblio.volume	570
biblio.last_page	707
biblio.first_page	689
grants[0].funder	https://openalex.org/F4320322725
grants[0].award_id	201906850087
grants[0].funder_display_name	China Scholarship Council
topics[0].id	https://openalex.org/T10567
topics[0].field.id	https://openalex.org/fields/22
topics[0].field.display_name	Engineering
topics[0].score	0.9998000264167786
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/2209
topics[0].subfield.display_name	Industrial and Manufacturing Engineering
topics[0].display_name	Vehicle Routing Optimization Methods
topics[1].id	https://openalex.org/T10848
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9958000183105469
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1703
topics[1].subfield.display_name	Computational Theory and Mathematics
topics[1].display_name	Advanced Multi-Objective Optimization Algorithms
topics[2].id	https://openalex.org/T10100
topics[2].field.id	https://openalex.org/fields/17
topics[2].field.display_name	Computer Science
topics[2].score	0.9944999814033508
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/1702
topics[2].subfield.display_name	Artificial Intelligence
topics[2].display_name	Metaheuristic Optimization Algorithms Research
funders[0].id	https://openalex.org/F4320322725
funders[0].ror	https://ror.org/04atp4p48
funders[0].display_name	China Scholarship Council
is_xpac	False
apc_list.value	3330
apc_list.currency	USD
apc_list.value_usd	3330
apc_paid
concepts[0].id	https://openalex.org/C35129592
concepts[0].level	3
concepts[0].score	0.7756553888320923
concepts[0].wikidata	https://www.wikidata.org/wiki/Q324793
concepts[0].display_name	Memetic algorithm
concepts[1].id	https://openalex.org/C175859090
concepts[1].level	2
concepts[1].score	0.750758945941925
concepts[1].wikidata	https://www.wikidata.org/wiki/Q322212
concepts[1].display_name	Travelling salesman problem
concepts[2].id	https://openalex.org/C122507166
concepts[2].level	2
concepts[2].score	0.7351179122924805
concepts[2].wikidata	https://www.wikidata.org/wiki/Q628906
concepts[2].display_name	Crossover
concepts[3].id	https://openalex.org/C114466953
concepts[3].level	2
concepts[3].score	0.7098369598388672
concepts[3].wikidata	https://www.wikidata.org/wiki/Q6034165
concepts[3].display_name	Initialization
concepts[4].id	https://openalex.org/C126255220
concepts[4].level	1
concepts[4].score	0.6649917364120483
concepts[4].wikidata	https://www.wikidata.org/wiki/Q141495
concepts[4].display_name	Mathematical optimization
concepts[5].id	https://openalex.org/C185798385
concepts[5].level	2
concepts[5].score	0.6376856565475464
concepts[5].wikidata	https://www.wikidata.org/wiki/Q1161707
concepts[5].display_name	Benchmark (surveying)
concepts[6].id	https://openalex.org/C106472803
concepts[6].level	3
concepts[6].score	0.6245576739311218
concepts[6].wikidata	https://www.wikidata.org/wiki/Q291440
concepts[6].display_name	2-opt
concepts[7].id	https://openalex.org/C135320971
concepts[7].level	2
concepts[7].score	0.6097288727760315
concepts[7].wikidata	https://www.wikidata.org/wiki/Q1868524
concepts[7].display_name	Local search (optimization)
concepts[8].id	https://openalex.org/C41008148
concepts[8].level	0
concepts[8].score	0.5667448043823242
concepts[8].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[8].display_name	Computer science
concepts[9].id	https://openalex.org/C2778770139
concepts[9].level	2
concepts[9].score	0.5413155555725098
concepts[9].wikidata	https://www.wikidata.org/wiki/Q1966904
concepts[9].display_name	Solver
concepts[10].id	https://openalex.org/C173801870
concepts[10].level	2
concepts[10].score	0.4949571490287781
concepts[10].wikidata	https://www.wikidata.org/wiki/Q201413
concepts[10].display_name	Heuristic
concepts[11].id	https://openalex.org/C7668213
concepts[11].level	3
concepts[11].score	0.4766339063644409
concepts[11].wikidata	https://www.wikidata.org/wiki/Q4949085
concepts[11].display_name	Bottleneck traveling salesman problem
concepts[12].id	https://openalex.org/C141934464
concepts[12].level	2
concepts[12].score	0.45763683319091797
concepts[12].wikidata	https://www.wikidata.org/wiki/Q3305386
concepts[12].display_name	Local optimum
concepts[13].id	https://openalex.org/C177264268
concepts[13].level	2
concepts[13].score	0.4561431407928467
concepts[13].wikidata	https://www.wikidata.org/wiki/Q1514741
concepts[13].display_name	Set (abstract data type)
concepts[14].id	https://openalex.org/C2908647359
concepts[14].level	2
concepts[14].score	0.4469543695449829
concepts[14].wikidata	https://www.wikidata.org/wiki/Q2625603
concepts[14].display_name	Population
concepts[15].id	https://openalex.org/C51823790
concepts[15].level	2
concepts[15].score	0.4372452199459076
concepts[15].wikidata	https://www.wikidata.org/wiki/Q504353
concepts[15].display_name	Greedy algorithm
concepts[16].id	https://openalex.org/C33923547
concepts[16].level	0
concepts[16].score	0.36303648352622986
concepts[16].wikidata	https://www.wikidata.org/wiki/Q395
concepts[16].display_name	Mathematics
concepts[17].id	https://openalex.org/C154945302
concepts[17].level	1
concepts[17].score	0.1871483325958252
concepts[17].wikidata	https://www.wikidata.org/wiki/Q11660
concepts[17].display_name	Artificial intelligence
concepts[18].id	https://openalex.org/C199360897
concepts[18].level	1
concepts[18].score	0.0
concepts[18].wikidata	https://www.wikidata.org/wiki/Q9143
concepts[18].display_name	Programming language
concepts[19].id	https://openalex.org/C149923435
concepts[19].level	1
concepts[19].score	0.0
concepts[19].wikidata	https://www.wikidata.org/wiki/Q37732
concepts[19].display_name	Demography
concepts[20].id	https://openalex.org/C205649164
concepts[20].level	0
concepts[20].score	0.0
concepts[20].wikidata	https://www.wikidata.org/wiki/Q1071
concepts[20].display_name	Geography
concepts[21].id	https://openalex.org/C144024400
concepts[21].level	0
concepts[21].score	0.0
concepts[21].wikidata	https://www.wikidata.org/wiki/Q21201
concepts[21].display_name	Sociology
concepts[22].id	https://openalex.org/C13280743
concepts[22].level	1
concepts[22].score	0.0
concepts[22].wikidata	https://www.wikidata.org/wiki/Q131089
concepts[22].display_name	Geodesy
keywords[0].id	https://openalex.org/keywords/memetic-algorithm
keywords[0].score	0.7756553888320923
keywords[0].display_name	Memetic algorithm
keywords[1].id	https://openalex.org/keywords/travelling-salesman-problem
keywords[1].score	0.750758945941925
keywords[1].display_name	Travelling salesman problem
keywords[2].id	https://openalex.org/keywords/crossover
keywords[2].score	0.7351179122924805
keywords[2].display_name	Crossover
keywords[3].id	https://openalex.org/keywords/initialization
keywords[3].score	0.7098369598388672
keywords[3].display_name	Initialization
keywords[4].id	https://openalex.org/keywords/mathematical-optimization
keywords[4].score	0.6649917364120483
keywords[4].display_name	Mathematical optimization
keywords[5].id	https://openalex.org/keywords/benchmark
keywords[5].score	0.6376856565475464
keywords[5].display_name	Benchmark (surveying)
keywords[6].id	https://openalex.org/keywords/2-opt
keywords[6].score	0.6245576739311218
keywords[6].display_name	2-opt
keywords[7].id	https://openalex.org/keywords/local-search
keywords[7].score	0.6097288727760315
keywords[7].display_name	Local search (optimization)
keywords[8].id	https://openalex.org/keywords/computer-science
keywords[8].score	0.5667448043823242
keywords[8].display_name	Computer science
keywords[9].id	https://openalex.org/keywords/solver
keywords[9].score	0.5413155555725098
keywords[9].display_name	Solver
keywords[10].id	https://openalex.org/keywords/heuristic
keywords[10].score	0.4949571490287781
keywords[10].display_name	Heuristic
keywords[11].id	https://openalex.org/keywords/bottleneck-traveling-salesman-problem
keywords[11].score	0.4766339063644409
keywords[11].display_name	Bottleneck traveling salesman problem
keywords[12].id	https://openalex.org/keywords/local-optimum
keywords[12].score	0.45763683319091797
keywords[12].display_name	Local optimum
keywords[13].id	https://openalex.org/keywords/set
keywords[13].score	0.4561431407928467
keywords[13].display_name	Set (abstract data type)
keywords[14].id	https://openalex.org/keywords/population
keywords[14].score	0.4469543695449829
keywords[14].display_name	Population
keywords[15].id	https://openalex.org/keywords/greedy-algorithm
keywords[15].score	0.4372452199459076
keywords[15].display_name	Greedy algorithm
keywords[16].id	https://openalex.org/keywords/mathematics
keywords[16].score	0.36303648352622986
keywords[16].display_name	Mathematics
keywords[17].id	https://openalex.org/keywords/artificial-intelligence
keywords[17].score	0.1871483325958252
keywords[17].display_name	Artificial intelligence
language	en
locations[0].id	doi:10.1016/j.ins.2021.04.090
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S192650101
locations[0].source.issn	0020-0255, 1872-6291
locations[0].source.type	journal
locations[0].source.is_oa	False
locations[0].source.issn_l	0020-0255
locations[0].source.is_core	True
locations[0].source.is_in_doaj	False
locations[0].source.display_name	Information Sciences
locations[0].source.host_organization	https://openalex.org/P4310320990
locations[0].source.host_organization_name	Elsevier BV
locations[0].source.host_organization_lineage	https://openalex.org/P4310320990
locations[0].license
locations[0].pdf_url	https://www.sciencedirect.com/science/article/am/pii/S002002552100431X
locations[0].version	publishedVersion
locations[0].raw_type	journal-article
locations[0].license_id
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	Information Sciences
locations[0].landing_page_url	https://doi.org/10.1016/j.ins.2021.04.090
locations[1].id	pmh:oai:HAL:hal-03586799v1
locations[1].is_oa	False
locations[1].source.id	https://openalex.org/S4306402512
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	False
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	HAL (Le Centre pour la Communication Scientifique Directe)
locations[1].source.host_organization	https://openalex.org/I1294671590
locations[1].source.host_organization_name	Centre National de la Recherche Scientifique
locations[1].source.host_organization_lineage	https://openalex.org/I1294671590
locations[1].license
locations[1].pdf_url
locations[1].version	submittedVersion
locations[1].raw_type	info:eu-repo/semantics/article
locations[1].license_id
locations[1].is_accepted	False
locations[1].is_published	False
locations[1].raw_source_name	ISSN: 0020-0255
locations[1].landing_page_url	https://hal.science/hal-03586799
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5039214378
authorships[0].author.orcid	https://orcid.org/0000-0003-4981-5705
authorships[0].author.display_name	Pengfei He
authorships[0].countries	FR
authorships[0].affiliations[0].institution_ids	https://openalex.org/I49451733
authorships[0].affiliations[0].raw_affiliation_string	LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers, France
authorships[0].institutions[0].id	https://openalex.org/I49451733
authorships[0].institutions[0].ror	https://ror.org/04yrqp957
authorships[0].institutions[0].type	education
authorships[0].institutions[0].lineage	https://openalex.org/I49451733
authorships[0].institutions[0].country_code	FR
authorships[0].institutions[0].display_name	Université d'Angers
authorships[0].author_position	first
authorships[0].raw_author_name	Pengfei He
authorships[0].is_corresponding	False
authorships[0].raw_affiliation_strings	LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers, France
authorships[1].author.id	https://openalex.org/A5016332970
authorships[1].author.orcid	https://orcid.org/0000-0001-8813-4377
authorships[1].author.display_name	Jin‐Kao Hao
authorships[1].countries	FR
authorships[1].affiliations[0].institution_ids	https://openalex.org/I49451733
authorships[1].affiliations[0].raw_affiliation_string	LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers, France
authorships[1].institutions[0].id	https://openalex.org/I49451733
authorships[1].institutions[0].ror	https://ror.org/04yrqp957
authorships[1].institutions[0].type	education
authorships[1].institutions[0].lineage	https://openalex.org/I49451733
authorships[1].institutions[0].country_code	FR
authorships[1].institutions[0].display_name	Université d'Angers
authorships[1].author_position	middle
authorships[1].raw_author_name	Jin-Kao Hao
authorships[1].is_corresponding	True
authorships[1].raw_affiliation_strings	LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers, France
authorships[2].author.id	https://openalex.org/A5029879936
authorships[2].author.orcid	https://orcid.org/0000-0003-4015-0305
authorships[2].author.display_name	Qinghua Wu
authorships[2].countries	CN
authorships[2].affiliations[0].institution_ids	https://openalex.org/I47720641
authorships[2].affiliations[0].raw_affiliation_string	School of Management, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan, China
authorships[2].institutions[0].id	https://openalex.org/I47720641
authorships[2].institutions[0].ror	https://ror.org/00p991c53
authorships[2].institutions[0].type	education
authorships[2].institutions[0].lineage	https://openalex.org/I47720641
authorships[2].institutions[0].country_code	CN
authorships[2].institutions[0].display_name	Huazhong University of Science and Technology
authorships[2].author_position	last
authorships[2].raw_author_name	Qinghua Wu
authorships[2].is_corresponding	False
authorships[2].raw_affiliation_strings	School of Management, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan, China
has_content.pdf	True
has_content.grobid_xml	True
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://www.sciencedirect.com/science/article/am/pii/S002002552100431X
open_access.oa_status	bronze
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Grouping memetic search for the colored traveling salesmen problem
has_fulltext	True
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T10567
primary_topic.field.id	https://openalex.org/fields/22
primary_topic.field.display_name	Engineering
primary_topic.score	0.9998000264167786
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/2209
primary_topic.subfield.display_name	Industrial and Manufacturing Engineering
primary_topic.display_name	Vehicle Routing Optimization Methods
related_works	https://openalex.org/W103092118, https://openalex.org/W2024203849, https://openalex.org/W4391264787, https://openalex.org/W2140187183, https://openalex.org/W2804769572, https://openalex.org/W2946294588, https://openalex.org/W2766468404, https://openalex.org/W2096648407, https://openalex.org/W1548562700, https://openalex.org/W2185228534
cited_by_count	26
counts_by_year[0].year	2025
counts_by_year[0].cited_by_count	6
counts_by_year[1].year	2024
counts_by_year[1].cited_by_count	6
counts_by_year[2].year	2023
counts_by_year[2].cited_by_count	7
counts_by_year[3].year	2022
counts_by_year[3].cited_by_count	6
counts_by_year[4].year	2021
counts_by_year[4].cited_by_count	1
locations_count	2
best_oa_location.id	doi:10.1016/j.ins.2021.04.090
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S192650101
best_oa_location.source.issn	0020-0255, 1872-6291
best_oa_location.source.type	journal
best_oa_location.source.is_oa	False
best_oa_location.source.issn_l	0020-0255
best_oa_location.source.is_core	True
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	Information Sciences
best_oa_location.source.host_organization	https://openalex.org/P4310320990
best_oa_location.source.host_organization_name	Elsevier BV
best_oa_location.source.host_organization_lineage	https://openalex.org/P4310320990
best_oa_location.license
best_oa_location.pdf_url	https://www.sciencedirect.com/science/article/am/pii/S002002552100431X
best_oa_location.version	publishedVersion
best_oa_location.raw_type	journal-article
best_oa_location.license_id
best_oa_location.is_accepted	True
best_oa_location.is_published	True
best_oa_location.raw_source_name	Information Sciences
best_oa_location.landing_page_url	https://doi.org/10.1016/j.ins.2021.04.090
primary_location.id	doi:10.1016/j.ins.2021.04.090
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S192650101
primary_location.source.issn	0020-0255, 1872-6291
primary_location.source.type	journal
primary_location.source.is_oa	False
primary_location.source.issn_l	0020-0255
primary_location.source.is_core	True
primary_location.source.is_in_doaj	False
primary_location.source.display_name	Information Sciences
primary_location.source.host_organization	https://openalex.org/P4310320990
primary_location.source.host_organization_name	Elsevier BV
primary_location.source.host_organization_lineage	https://openalex.org/P4310320990
primary_location.license
primary_location.pdf_url	https://www.sciencedirect.com/science/article/am/pii/S002002552100431X
primary_location.version	publishedVersion
primary_location.raw_type	journal-article
primary_location.license_id
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	Information Sciences
primary_location.landing_page_url	https://doi.org/10.1016/j.ins.2021.04.090
publication_date	2021-05-04
publication_year	2021
referenced_works	https://openalex.org/W2908789966, https://openalex.org/W2050819731, https://openalex.org/W2036573713, https://openalex.org/W2081708500, https://openalex.org/W2056880022, https://openalex.org/W2149454052, https://openalex.org/W2802427737, https://openalex.org/W2949529235, https://openalex.org/W1999993900, https://openalex.org/W1582334898, https://openalex.org/W2075986198, https://openalex.org/W3096172597, https://openalex.org/W3008099084, https://openalex.org/W2795193066, https://openalex.org/W2017708378, https://openalex.org/W1980058421, https://openalex.org/W2760544841, https://openalex.org/W2582693844, https://openalex.org/W2061594663, https://openalex.org/W2141119792, https://openalex.org/W2950871040, https://openalex.org/W2626431333, https://openalex.org/W2137042221, https://openalex.org/W2810664546, https://openalex.org/W2111174053, https://openalex.org/W1989432959, https://openalex.org/W2219548420, https://openalex.org/W2971119541, https://openalex.org/W2084977713, https://openalex.org/W2134946882, https://openalex.org/W2119601963, https://openalex.org/W2563457599, https://openalex.org/W2033915107, https://openalex.org/W2793006232, https://openalex.org/W2963130633, https://openalex.org/W4241582122, https://openalex.org/W626292722, https://openalex.org/W1558758677, https://openalex.org/W3036211873, https://openalex.org/W2129360191
referenced_works_count	40
abstract_inverted_index
cited_by_percentile_year.max	99
cited_by_percentile_year.min	89
corresponding_author_ids	https://openalex.org/A5016332970
countries_distinct_count	2
institutions_distinct_count	3
corresponding_institution_ids	https://openalex.org/I49451733
sustainable_development_goals[0].id	https://metadata.un.org/sdg/11
sustainable_development_goals[0].score	0.7200000286102295
sustainable_development_goals[0].display_name	Sustainable cities and communities
citation_normalized_percentile.value	0.91670278
citation_normalized_percentile.is_in_top_1_percent	False
citation_normalized_percentile.is_in_top_10_percent	True