Adaptive-parameter memetic algorithm for privacy-preserving trajectory data publishing: A multi-objective optimization approach Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1007/s00607-025-01504-0
Trajectory data has grown pervasive, benefiting practical applications, including transportation administration and location-based operations. Nevertheless, trajectories may reveal extremely sensitive information about an individual, including movement patterns, personal profiles, geographical locations, and social contacts, necessitating privacy protection while disseminating trajectory data. Therefore, prioritizing privacy protection is crucial while analyzing trajectory data. Current methods of protecting privacy concentrate on single objective optimizing techniques such as maximizing data utility but often disregard various privacy constraints. To overcome this challenge, this study aims to improve both data privacy and usability by balancing competing goals-maximizing privacy while maintaining useful information-through a Multi-Objective Optimization (MOO) approach in trajectory data publishing. We provide a unique algorithm named Adaptive-Parameter Memetic Algorithm (APMA) that employs a non-dominated sorting multi-objective technique and a Memetic Algorithm (MA). This algorithm utilizes adaptive memory-based mutation and crossover strategies to dynamically adjust the mutation and crossover parameters and improve the solution’s quality. The proposed innovative local search strategy helps to achieve better population diversity and solution quality. Comprehensive studies illustrate the efficacy of the proposed method regarding solution quality and convergence outcomes.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1007/s00607-025-01504-0
- https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdf
- OA Status
- hybrid
- References
- 53
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4411386745
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4411386745Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1007/s00607-025-01504-0Digital Object Identifier
- Title
-
Adaptive-parameter memetic algorithm for privacy-preserving trajectory data publishing: A multi-objective optimization approachWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-06-17Full publication date if available
- Authors
-
Samsad Jahan, Yong-Feng Ge, Hua Wang, Enamul KabirList of authors in order
- Landing page
-
https://doi.org/10.1007/s00607-025-01504-0Publisher landing page
- PDF URL
-
https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
hybridOpen access status per OpenAlex
- OA URL
-
https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdfDirect OA link when available
- Concepts
-
Memetic algorithm, Data publishing, Computer science, Trajectory, Mathematical optimization, Algorithm, Publishing, Local search (optimization), Mathematics, Law, Political science, Astronomy, PhysicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
53Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4411386745 |
|---|---|
| doi | https://doi.org/10.1007/s00607-025-01504-0 |
| ids.doi | https://doi.org/10.1007/s00607-025-01504-0 |
| ids.openalex | https://openalex.org/W4411386745 |
| fwci | 0.0 |
| type | article |
| title | Adaptive-parameter memetic algorithm for privacy-preserving trajectory data publishing: A multi-objective optimization approach |
| biblio.issue | 7 |
| biblio.volume | 107 |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10764 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Privacy-Preserving Technologies in Data |
| topics[1].id | https://openalex.org/T11704 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9944000244140625 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1706 |
| topics[1].subfield.display_name | Computer Science Applications |
| topics[1].display_name | Mobile Crowdsensing and Crowdsourcing |
| topics[2].id | https://openalex.org/T11344 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9884999990463257 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2215 |
| topics[2].subfield.display_name | Building and Construction |
| topics[2].display_name | Traffic Prediction and Management Techniques |
| funders[0].id | https://openalex.org/F4320320976 |
| funders[0].ror | https://ror.org/04j757h98 |
| funders[0].display_name | Victoria University |
| is_xpac | False |
| apc_list.value | 2290 |
| apc_list.currency | EUR |
| apc_list.value_usd | 2890 |
| apc_paid.value | 2290 |
| apc_paid.currency | EUR |
| apc_paid.value_usd | 2890 |
| concepts[0].id | https://openalex.org/C35129592 |
| concepts[0].level | 3 |
| concepts[0].score | 0.7775396108627319 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q324793 |
| concepts[0].display_name | Memetic algorithm |
| concepts[1].id | https://openalex.org/C2781396290 |
| concepts[1].level | 3 |
| concepts[1].score | 0.6722463965415955 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q17051824 |
| concepts[1].display_name | Data publishing |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6435986161231995 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C13662910 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5296269059181213 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q193139 |
| concepts[3].display_name | Trajectory |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5209975838661194 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C11413529 |
| concepts[5].level | 1 |
| concepts[5].score | 0.46933355927467346 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[5].display_name | Algorithm |
| concepts[6].id | https://openalex.org/C151719136 |
| concepts[6].level | 2 |
| concepts[6].score | 0.33696869015693665 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q3972943 |
| concepts[6].display_name | Publishing |
| concepts[7].id | https://openalex.org/C135320971 |
| concepts[7].level | 2 |
| concepts[7].score | 0.2989678680896759 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1868524 |
| concepts[7].display_name | Local search (optimization) |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.2804158329963684 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C199539241 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q7748 |
| concepts[9].display_name | Law |
| concepts[10].id | https://openalex.org/C17744445 |
| concepts[10].level | 0 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q36442 |
| concepts[10].display_name | Political science |
| concepts[11].id | https://openalex.org/C1276947 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q333 |
| concepts[11].display_name | Astronomy |
| concepts[12].id | https://openalex.org/C121332964 |
| concepts[12].level | 0 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[12].display_name | Physics |
| keywords[0].id | https://openalex.org/keywords/memetic-algorithm |
| keywords[0].score | 0.7775396108627319 |
| keywords[0].display_name | Memetic algorithm |
| keywords[1].id | https://openalex.org/keywords/data-publishing |
| keywords[1].score | 0.6722463965415955 |
| keywords[1].display_name | Data publishing |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6435986161231995 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/trajectory |
| keywords[3].score | 0.5296269059181213 |
| keywords[3].display_name | Trajectory |
| keywords[4].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[4].score | 0.5209975838661194 |
| keywords[4].display_name | Mathematical optimization |
| keywords[5].id | https://openalex.org/keywords/algorithm |
| keywords[5].score | 0.46933355927467346 |
| keywords[5].display_name | Algorithm |
| keywords[6].id | https://openalex.org/keywords/publishing |
| keywords[6].score | 0.33696869015693665 |
| keywords[6].display_name | Publishing |
| keywords[7].id | https://openalex.org/keywords/local-search |
| keywords[7].score | 0.2989678680896759 |
| keywords[7].display_name | Local search (optimization) |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.2804158329963684 |
| keywords[8].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.1007/s00607-025-01504-0 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S35593046 |
| locations[0].source.issn | 0010-485X, 1436-5057 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0010-485X |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Computing |
| locations[0].source.host_organization | https://openalex.org/P4310319900 |
| locations[0].source.host_organization_name | Springer Science+Business Media |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| locations[0].source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Computing |
| locations[0].landing_page_url | https://doi.org/10.1007/s00607-025-01504-0 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5113699631 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Samsad Jahan |
| authorships[0].countries | AU |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I71270174 |
| authorships[0].affiliations[0].raw_affiliation_string | Institute for Sustainable Industries and Liveable Cities, Victoria University, 70-104 Ballarat Rd, Footscray, VIC, 3011, Australia |
| authorships[0].institutions[0].id | https://openalex.org/I71270174 |
| authorships[0].institutions[0].ror | https://ror.org/04j757h98 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I71270174 |
| authorships[0].institutions[0].country_code | AU |
| authorships[0].institutions[0].display_name | Victoria University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Samsad Jahan |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | Institute for Sustainable Industries and Liveable Cities, Victoria University, 70-104 Ballarat Rd, Footscray, VIC, 3011, Australia |
| authorships[1].author.id | https://openalex.org/A5011932689 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Yong-Feng Ge |
| authorships[1].countries | AU |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I71270174 |
| authorships[1].affiliations[0].raw_affiliation_string | Institute for Sustainable Industries and Liveable Cities, Victoria University, 70-104 Ballarat Rd, Footscray, VIC, 3011, Australia |
| authorships[1].institutions[0].id | https://openalex.org/I71270174 |
| authorships[1].institutions[0].ror | https://ror.org/04j757h98 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I71270174 |
| authorships[1].institutions[0].country_code | AU |
| authorships[1].institutions[0].display_name | Victoria University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Yong-Feng Ge |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Institute for Sustainable Industries and Liveable Cities, Victoria University, 70-104 Ballarat Rd, Footscray, VIC, 3011, Australia |
| authorships[2].author.id | https://openalex.org/A5100403969 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-8465-0996 |
| authorships[2].author.display_name | Hua Wang |
| authorships[2].countries | AU |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I71270174 |
| authorships[2].affiliations[0].raw_affiliation_string | Institute for Sustainable Industries and Liveable Cities, Victoria University, 70-104 Ballarat Rd, Footscray, VIC, 3011, Australia |
| authorships[2].institutions[0].id | https://openalex.org/I71270174 |
| authorships[2].institutions[0].ror | https://ror.org/04j757h98 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I71270174 |
| authorships[2].institutions[0].country_code | AU |
| authorships[2].institutions[0].display_name | Victoria University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Hua Wang |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Institute for Sustainable Industries and Liveable Cities, Victoria University, 70-104 Ballarat Rd, Footscray, VIC, 3011, Australia |
| authorships[3].author.id | https://openalex.org/A5070732010 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-6157-2753 |
| authorships[3].author.display_name | Enamul Kabir |
| authorships[3].countries | AU |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I185523456 |
| authorships[3].affiliations[0].raw_affiliation_string | School of Mathematics, Physics and Computing, University of Southern Queensland, 487-535 West St, Toowoomba, QLD, 4350, Australia |
| authorships[3].institutions[0].id | https://openalex.org/I185523456 |
| authorships[3].institutions[0].ror | https://ror.org/04sjbnx57 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I185523456 |
| authorships[3].institutions[0].country_code | AU |
| authorships[3].institutions[0].display_name | University of Southern Queensland |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Enamul Kabir |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | School of Mathematics, Physics and Computing, University of Southern Queensland, 487-535 West St, Toowoomba, QLD, 4350, Australia |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdf |
| open_access.oa_status | hybrid |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Adaptive-parameter memetic algorithm for privacy-preserving trajectory data publishing: A multi-objective optimization approach |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10764 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Privacy-Preserving Technologies in Data |
| related_works | https://openalex.org/W2010336970, https://openalex.org/W4205193211, https://openalex.org/W2294677930, https://openalex.org/W3034364924, https://openalex.org/W3196925172, https://openalex.org/W3091613133, https://openalex.org/W4388038709, https://openalex.org/W2604908921, https://openalex.org/W2596219669, https://openalex.org/W4389399305 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1007/s00607-025-01504-0 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S35593046 |
| best_oa_location.source.issn | 0010-485X, 1436-5057 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 0010-485X |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Computing |
| best_oa_location.source.host_organization | https://openalex.org/P4310319900 |
| best_oa_location.source.host_organization_name | Springer Science+Business Media |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| best_oa_location.source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Computing |
| best_oa_location.landing_page_url | https://doi.org/10.1007/s00607-025-01504-0 |
| primary_location.id | doi:10.1007/s00607-025-01504-0 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S35593046 |
| primary_location.source.issn | 0010-485X, 1436-5057 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0010-485X |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Computing |
| primary_location.source.host_organization | https://openalex.org/P4310319900 |
| primary_location.source.host_organization_name | Springer Science+Business Media |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319900, https://openalex.org/P4310319965 |
| primary_location.source.host_organization_lineage_names | Springer Science+Business Media, Springer Nature |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://link.springer.com/content/pdf/10.1007/s00607-025-01504-0.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Computing |
| primary_location.landing_page_url | https://doi.org/10.1007/s00607-025-01504-0 |
| publication_date | 2025-06-17 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W2010362518, https://openalex.org/W2078101615, https://openalex.org/W4405453640, https://openalex.org/W2891707456, https://openalex.org/W3121969727, https://openalex.org/W2885090919, https://openalex.org/W2511693736, https://openalex.org/W2959503025, https://openalex.org/W2126105956, https://openalex.org/W2911978475, https://openalex.org/W3094119689, https://openalex.org/W3185995345, https://openalex.org/W4206258573, https://openalex.org/W4312519793, https://openalex.org/W4385627526, https://openalex.org/W4390881404, https://openalex.org/W4400412340, https://openalex.org/W2323121671, https://openalex.org/W2890836728, https://openalex.org/W4402550757, https://openalex.org/W2245706161, https://openalex.org/W2801415516, https://openalex.org/W4387482573, https://openalex.org/W4404725121, https://openalex.org/W4299988867, https://openalex.org/W2301977247, https://openalex.org/W2497058066, https://openalex.org/W2136114025, https://openalex.org/W2134167315, https://openalex.org/W2052806235, https://openalex.org/W4407154528, https://openalex.org/W2159024459, https://openalex.org/W4313484659, https://openalex.org/W3140673860, https://openalex.org/W2003571118, https://openalex.org/W2898288652, https://openalex.org/W4226300969, https://openalex.org/W1999717639, https://openalex.org/W2197582584, https://openalex.org/W2902194717, https://openalex.org/W4223549164, https://openalex.org/W4285818247, https://openalex.org/W4398768461, https://openalex.org/W4283328089, https://openalex.org/W4400592719, https://openalex.org/W2031674781, https://openalex.org/W2172041433, https://openalex.org/W4312221876, https://openalex.org/W2143381319, https://openalex.org/W2072661909, https://openalex.org/W4390825338, https://openalex.org/W4285247736, https://openalex.org/W4385616961 |
| referenced_works_count | 53 |
| abstract_inverted_index.a | 97, 108, 118, 124 |
| abstract_inverted_index.To | 74 |
| abstract_inverted_index.We | 106 |
| abstract_inverted_index.an | 23 |
| abstract_inverted_index.as | 64 |
| abstract_inverted_index.by | 88 |
| abstract_inverted_index.in | 102 |
| abstract_inverted_index.is | 46 |
| abstract_inverted_index.of | 54, 170 |
| abstract_inverted_index.on | 58 |
| abstract_inverted_index.to | 81, 137, 157 |
| abstract_inverted_index.The | 150 |
| abstract_inverted_index.and | 12, 32, 86, 123, 134, 142, 145, 162, 177 |
| abstract_inverted_index.but | 68 |
| abstract_inverted_index.has | 3 |
| abstract_inverted_index.may | 17 |
| abstract_inverted_index.the | 140, 147, 168, 171 |
| abstract_inverted_index.This | 128 |
| abstract_inverted_index.aims | 80 |
| abstract_inverted_index.both | 83 |
| abstract_inverted_index.data | 2, 66, 84, 104 |
| abstract_inverted_index.such | 63 |
| abstract_inverted_index.that | 116 |
| abstract_inverted_index.this | 76, 78 |
| abstract_inverted_index.(MA). | 127 |
| abstract_inverted_index.(MOO) | 100 |
| abstract_inverted_index.about | 22 |
| abstract_inverted_index.data. | 41, 51 |
| abstract_inverted_index.grown | 4 |
| abstract_inverted_index.helps | 156 |
| abstract_inverted_index.local | 153 |
| abstract_inverted_index.named | 111 |
| abstract_inverted_index.often | 69 |
| abstract_inverted_index.study | 79 |
| abstract_inverted_index.while | 38, 48, 93 |
| abstract_inverted_index.(APMA) | 115 |
| abstract_inverted_index.adjust | 139 |
| abstract_inverted_index.better | 159 |
| abstract_inverted_index.method | 173 |
| abstract_inverted_index.reveal | 18 |
| abstract_inverted_index.search | 154 |
| abstract_inverted_index.single | 59 |
| abstract_inverted_index.social | 33 |
| abstract_inverted_index.unique | 109 |
| abstract_inverted_index.useful | 95 |
| abstract_inverted_index.Current | 52 |
| abstract_inverted_index.Memetic | 113, 125 |
| abstract_inverted_index.achieve | 158 |
| abstract_inverted_index.crucial | 47 |
| abstract_inverted_index.employs | 117 |
| abstract_inverted_index.improve | 82, 146 |
| abstract_inverted_index.methods | 53 |
| abstract_inverted_index.privacy | 36, 44, 56, 72, 85, 92 |
| abstract_inverted_index.provide | 107 |
| abstract_inverted_index.quality | 176 |
| abstract_inverted_index.sorting | 120 |
| abstract_inverted_index.studies | 166 |
| abstract_inverted_index.utility | 67 |
| abstract_inverted_index.various | 71 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.adaptive | 131 |
| abstract_inverted_index.approach | 101 |
| abstract_inverted_index.efficacy | 169 |
| abstract_inverted_index.movement | 26 |
| abstract_inverted_index.mutation | 133, 141 |
| abstract_inverted_index.overcome | 75 |
| abstract_inverted_index.personal | 28 |
| abstract_inverted_index.proposed | 151, 172 |
| abstract_inverted_index.quality. | 149, 164 |
| abstract_inverted_index.solution | 163, 175 |
| abstract_inverted_index.strategy | 155 |
| abstract_inverted_index.utilizes | 130 |
| abstract_inverted_index.Algorithm | 114, 126 |
| abstract_inverted_index.algorithm | 110, 129 |
| abstract_inverted_index.analyzing | 49 |
| abstract_inverted_index.balancing | 89 |
| abstract_inverted_index.competing | 90 |
| abstract_inverted_index.contacts, | 34 |
| abstract_inverted_index.crossover | 135, 143 |
| abstract_inverted_index.disregard | 70 |
| abstract_inverted_index.diversity | 161 |
| abstract_inverted_index.extremely | 19 |
| abstract_inverted_index.including | 9, 25 |
| abstract_inverted_index.objective | 60 |
| abstract_inverted_index.outcomes. | 179 |
| abstract_inverted_index.patterns, | 27 |
| abstract_inverted_index.practical | 7 |
| abstract_inverted_index.profiles, | 29 |
| abstract_inverted_index.regarding | 174 |
| abstract_inverted_index.sensitive | 20 |
| abstract_inverted_index.technique | 122 |
| abstract_inverted_index.usability | 87 |
| abstract_inverted_index.Therefore, | 42 |
| abstract_inverted_index.Trajectory | 1 |
| abstract_inverted_index.benefiting | 6 |
| abstract_inverted_index.challenge, | 77 |
| abstract_inverted_index.illustrate | 167 |
| abstract_inverted_index.innovative | 152 |
| abstract_inverted_index.locations, | 31 |
| abstract_inverted_index.maximizing | 65 |
| abstract_inverted_index.optimizing | 61 |
| abstract_inverted_index.parameters | 144 |
| abstract_inverted_index.pervasive, | 5 |
| abstract_inverted_index.population | 160 |
| abstract_inverted_index.protecting | 55 |
| abstract_inverted_index.protection | 37, 45 |
| abstract_inverted_index.strategies | 136 |
| abstract_inverted_index.techniques | 62 |
| abstract_inverted_index.trajectory | 40, 50, 103 |
| abstract_inverted_index.concentrate | 57 |
| abstract_inverted_index.convergence | 178 |
| abstract_inverted_index.dynamically | 138 |
| abstract_inverted_index.individual, | 24 |
| abstract_inverted_index.information | 21 |
| abstract_inverted_index.maintaining | 94 |
| abstract_inverted_index.operations. | 14 |
| abstract_inverted_index.publishing. | 105 |
| abstract_inverted_index.Optimization | 99 |
| abstract_inverted_index.constraints. | 73 |
| abstract_inverted_index.geographical | 30 |
| abstract_inverted_index.memory-based | 132 |
| abstract_inverted_index.prioritizing | 43 |
| abstract_inverted_index.solution’s | 148 |
| abstract_inverted_index.trajectories | 16 |
| abstract_inverted_index.Comprehensive | 165 |
| abstract_inverted_index.Nevertheless, | 15 |
| abstract_inverted_index.applications, | 8 |
| abstract_inverted_index.disseminating | 39 |
| abstract_inverted_index.necessitating | 35 |
| abstract_inverted_index.non-dominated | 119 |
| abstract_inverted_index.administration | 11 |
| abstract_inverted_index.location-based | 13 |
| abstract_inverted_index.transportation | 10 |
| abstract_inverted_index.Multi-Objective | 98 |
| abstract_inverted_index.multi-objective | 121 |
| abstract_inverted_index.goals-maximizing | 91 |
| abstract_inverted_index.Adaptive-Parameter | 112 |
| abstract_inverted_index.information-through | 96 |
| cited_by_percentile_year | |
| corresponding_author_ids | https://openalex.org/A5113699631 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I71270174 |
| citation_normalized_percentile.value | 0.10104897 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |