{"id":"https://openalex.org/W1995704253","doi":"https://doi.org/10.4018/ijamc.2015040103","title":"New Genetic Operator (Jump Crossover) for the Traveling Salesman Problem","display_name":"New Genetic Operator (Jump Crossover) for the Traveling Salesman Problem","publication_year":2015,"publication_date":"2015-03-28","ids":{"openalex":"https://openalex.org/W1995704253","doi":"https://doi.org/10.4018/ijamc.2015040103","mag":"1995704253"},"language":"en","primary_location":{"id":"doi:10.4018/ijamc.2015040103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2015040103","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hicham El Hassani","orcid":null},"institutions":[{"id":"https://openalex.org/I99297268","display_name":"University of Hassan II Casablanca","ror":"https://ror.org/001q4kn48","country_code":"MA","type":"education","lineage":["https://openalex.org/I99297268"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Hicham El Hassani","raw_affiliation_strings":["Laboratory of Computer Systems and Renewable Energy (LISER), Hassan II University, Casablanca, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Computer Systems and Renewable Energy (LISER), Hassan II University, Casablanca, Morocco","institution_ids":["https://openalex.org/I99297268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053941200","display_name":"Said Benkachcha","orcid":null},"institutions":[{"id":"https://openalex.org/I99297268","display_name":"University of Hassan II Casablanca","ror":"https://ror.org/001q4kn48","country_code":"MA","type":"education","lineage":["https://openalex.org/I99297268"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Said Benkachcha","raw_affiliation_strings":["Laboratory of Computer Systems and Renewable Energy (LISER), Hassan II University, Casablanca, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Computer Systems and Renewable Energy (LISER), Hassan II University, Casablanca, Morocco","institution_ids":["https://openalex.org/I99297268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088174197","display_name":"Jamal Benhra","orcid":"https://orcid.org/0000-0002-8883-4610"},"institutions":[{"id":"https://openalex.org/I99297268","display_name":"University of Hassan II Casablanca","ror":"https://ror.org/001q4kn48","country_code":"MA","type":"education","lineage":["https://openalex.org/I99297268"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Jamal Benhra","raw_affiliation_strings":["Laboratory of Computer Systems and Renewable Energy (LISER), Hassan II University, Casablanca, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Computer Systems and Renewable Energy (LISER), Hassan II University, Casablanca, Morocco","institution_ids":["https://openalex.org/I99297268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99297268"],"apc_list":null,"apc_paid":null,"fwci":1.7461,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88292697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":"2","first_page":"33","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9710227847099304},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7783546447753906},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.7270833253860474},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6727168560028076},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6433480978012085},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5746334791183472},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5345553159713745},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.5015802383422852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47913858294487},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43712788820266724},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42201003432273865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38465163111686707},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16394469141960144},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08640831708908081}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9710227847099304},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7783546447753906},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.7270833253860474},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6727168560028076},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6433480978012085},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5746334791183472},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5345553159713745},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.5015802383422852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47913858294487},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43712788820266724},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42201003432273865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38465163111686707},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16394469141960144},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08640831708908081},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijamc.2015040103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2015040103","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jamc00:v:6:y:2015:i:2:p:33-44","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2015040103","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W796388308","https://openalex.org/W1528149415","https://openalex.org/W1535396304","https://openalex.org/W1561636111","https://openalex.org/W1566343863","https://openalex.org/W1589975099","https://openalex.org/W2069024107","https://openalex.org/W2107686474","https://openalex.org/W2146879413","https://openalex.org/W2163428398","https://openalex.org/W2267334966","https://openalex.org/W2338995958","https://openalex.org/W3023540311","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W4299389082","https://openalex.org/W1943663474","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W2153505252","https://openalex.org/W2084107775","https://openalex.org/W2114549389","https://openalex.org/W2777171873","https://openalex.org/W2031913815"],"abstract_inverted_index":{"Inspired":[0],"by":[1,74],"nature,":[2],"genetic":[3,58],"algorithms":[4],"(GA)":[5,60],"are":[6],"among":[7],"the":[8,23,32,52,79,108,128,132,136,143],"greatest":[9],"meta-heuristics":[10],"optimization":[11],"methods":[12],"that":[13,120],"have":[14],"proved":[15],"their":[16],"effectiveness":[17],"to":[18,64,70,78,106,135],"conventional":[19,76],"NP-hard":[20],"problems,":[21],"especially":[22],"traveling":[24],"salesman":[25],"problem":[26,55],"(TSP)":[27],"which":[28],"is":[29],"one":[30],"of":[31,96,113,131],"most":[33,122],"studied":[34],"supply":[35],"chain":[36],"management":[37],"problems.":[38],"This":[39],"paper":[40],"proposes":[41],"a":[42,57,102],"new":[43],"crossover":[44,85,140],"operator":[45],"called":[46],"Jump":[47],"Crossover":[48,89],"(JMPX)":[49],"for":[50,61],"solving":[51],"travelling":[53],"salesmen":[54],"using":[56],"algorithm":[59],"near-optimal":[62],"solutions,":[63],"conclude":[65],"on":[66],"its":[67],"efficiency":[68],"compared":[69,134],"solutions":[71],"quality":[72,130],"given":[73],"other":[75],"operators":[77],"same":[80],"problem,":[81],"namely,":[82],"Partially":[83],"matched":[84],"(PMX),":[86],"Edge":[87],"recombination":[88],"(ERX)":[90],"and":[91,142],"r-opt":[92,144],"heuristic":[93],"with":[94],"consideration":[95],"computational":[97],"overload.":[98],"The":[99,116],"authors":[100],"adopt":[101],"low":[103],"mutation":[104],"rate":[105],"isolate":[107],"search":[109],"space":[110],"exploration":[111],"ability":[112],"each":[114],"crossover.":[115],"experimental":[117],"results":[118],"show":[119],"in":[121],"cases":[123],"JMPX":[124],"can":[125],"remarkably":[126],"improve":[127],"solution":[129],"GA":[133],"two":[137],"existing":[138],"classic":[139],"approaches":[141],"heuristic.":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}