{"entities":{"Q885677":{"pageid":887525,"ns":120,"title":"Item:Q885677","lastrevid":65098839,"modified":"2026-04-12T00:18:32Z","type":"item","id":"Q885677","labels":{"en":{"language":"en","value":"A hybrid random-key genetic algorithm for a symmetric travelling salesman problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5164571"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$F8647808-163C-4DD6-A0F7-CD63A63923D3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c6bf66288e28980e2480a065fd7e94a5ce6b4569","datavalue":{"value":{"text":"A hybrid random-key genetic algorithm for a symmetric travelling salesman problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q885677$3E8B8460-4FC7-4F5E-B2C1-005151AAEEB6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d7032dafcfd6b19d372446f01d0a53aee14b4e8f","datavalue":{"value":"1278.90478","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q885677$EF9BEB0D-1AC3-4C42-95BD-0B13F2825B75","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4b77201f89231d3ab1fc59934803100def172228","datavalue":{"value":"10.1504/IJOR.2007.011443","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q885677$FB7335C4-B3A0-40A9-97B5-B8BF5286EFE3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"31b755fd39a8b56fef08236ce8b6d1f5b026768a","datavalue":{"value":{"entity-type":"item","numeric-id":500331,"id":"Q500331"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$C4E91434-746B-4BDB-AC39-6B76D37E73FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3b5aecbe29447097b530941f40f2cabc4a86d76d","datavalue":{"value":{"entity-type":"item","numeric-id":885674,"id":"Q885674"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$911F1420-E66F-48B6-8219-623300A79508","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a9954c4035eb6cb0128703194594d1ae0d35f41c","datavalue":{"value":{"entity-type":"item","numeric-id":885676,"id":"Q885676"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$80E5CF94-7697-4A69-9D4F-35AEF4C6F111","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"967a1c06bff9ca3198c4cc9befb84970fa6de14b","datavalue":{"value":{"entity-type":"item","numeric-id":1603325,"id":"Q1603325"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$A046E679-7A4F-4296-98D1-675A2A939268","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2416e8a5c76a3e001f6e57b132d70eaeca49c502","datavalue":{"value":{"entity-type":"item","numeric-id":541285,"id":"Q541285"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$6EAB421B-42A7-43BB-ACD0-BA9B572122F2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bab32af2be3d6aa1853ef23f80d5ca9e92477a30","datavalue":{"value":{"time":"+2007-06-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q885677$1C1411EE-BB2B-493A-97B9-D8FE38E1CF2B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"15e824b607a7be43958bbc64132616a54a162035","datavalue":{"value":"Summary: We describe a methodology that finds approximate and sometimes optimal solutions to the symmetric Travelling Salesman Problem (TSP) using a hybrid approach that combines a Random-Key Genetic Algorithm (RKGA) with a local search procedure. The random keys representation ensures that feasible tours are constructed during the application of genetic operators, whereas the genetic algorithm approach with local search efficiently generates optimal or near-optimal solutions. The results of experiments are provided that use examples taken from a well-known online library to confirm the quality of the proposed algorithm.","type":"string"},"datatype":"string"},"type":"statement","id":"Q885677$11C94722-3550-449B-8F79-B60537B510D9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q885677$775044B3-7020-46A1-B1E3-378235502785","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q885677$F0AF66B4-83C5-46B0-832C-895CFC118866","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7f52932b1c137886964476f62103efc10edd2b00","datavalue":{"value":"5164571","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q885677$18B4BE8D-2D8E-4B8B-BE64-28AEFB53C6E1","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q885677$CB3F2489-1B05-4031-B4DC-00DB7F71438E","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"7ade06eb470935851b5d1cede2a344badfc8cacf","datavalue":{"value":"Q59270012","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q885677$9732E4A7-76EB-4DAD-A65D-3D10EDD6D316","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f4211da0b2ce2251f4cf1a0379e59355399493fb","datavalue":{"value":{"entity-type":"item","numeric-id":1919848,"id":"Q1919848"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3ad37a6b7014112ca6f7ca631009d7d66905bc1c","datavalue":{"value":{"amount":"+0.7914599180221558","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q885677$49D92656-C6AC-496C-ADA7-21F26E96C940","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1bb476a0cc8240844aeca33c9ff276bfa70aac3d","datavalue":{"value":{"entity-type":"item","numeric-id":1870831,"id":"Q1870831"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4ebd8da0f7377e6a91b6bb5157c090e75d19ebc4","datavalue":{"value":{"amount":"+0.7866023182868958","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q885677$9569A960-5009-465E-B3FC-93D4FDB0B3F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d35df5017fa11c64c193bc96c9b364f8b54b8c58","datavalue":{"value":{"entity-type":"item","numeric-id":858328,"id":"Q858328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a73f3413a313398413a377cf5eb51347d517126e","datavalue":{"value":{"amount":"+0.7851741313934326","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q885677$927FA522-16FC-4335-BA3B-E301ED58D08E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"802ca361b96340e0ae86495172a9fb77fe3dfd30","datavalue":{"value":{"entity-type":"item","numeric-id":990542,"id":"Q990542"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"34fd9236fd5550ec9894cbf62e44ebd2786b5e5d","datavalue":{"value":{"amount":"+0.7845129370689392","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q885677$B5F6D978-9862-4A11-8A77-6671288BB100","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"989bd33a7b161fc99336571e2a6323dd0c64bd94","datavalue":{"value":{"entity-type":"item","numeric-id":3606240,"id":"Q3606240"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1ecfd1d78f1482879eaf6cc7e42c04384dde314a","datavalue":{"value":{"amount":"+0.7692416906356812","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q885677$CC16B0F1-17E8-4048-A66A-A520BA827215","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A hybrid random-key genetic algorithm for a symmetric travelling salesman problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_hybrid_random-key_genetic_algorithm_for_a_symmetric_travelling_salesman_problem"}}}}}