{"entities":{"Q1046590":{"pageid":1048438,"ns":120,"title":"Item:Q1046590","lastrevid":66029382,"modified":"2026-04-12T07:03:10Z","type":"item","id":"Q1046590","labels":{"en":{"language":"en","value":"On the selection of \\(k\\) efficient paths by clustering techniques"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5651384"}},"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":"Q1046590$DB3259DA-F300-4F42-AB90-9B516C38F408","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"af69ba2f88d0f7847819a363493c6a52d48cf178","datavalue":{"value":{"text":"On the selection of \\(k\\) efficient paths by clustering techniques","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1046590$84E26652-9132-49AB-B735-88EE521C81C2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"951abf51ce0d221da4554186803501d4855eac23","datavalue":{"value":"1177.90334","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$F869DECF-5689-471A-8793-5E63B150E0DA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0b428af992617002f516dc25249145389a6cb87d","datavalue":{"value":"10.1504/IJDMMM.2009.027285","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$0CCD1735-65B0-4404-827B-89A5321B9C02","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f2cdd1892625a16441d3991f7370b427d06f9bb5","datavalue":{"value":{"entity-type":"item","numeric-id":190512,"id":"Q190512"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1046590$49BF3053-9DB4-434B-B96C-BBE936BE7346","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7313d1fd8b1d21fd358d6a5a11163b1ac4428177","datavalue":{"value":{"entity-type":"item","numeric-id":210506,"id":"Q210506"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1046590$94143828-4D70-41E4-AE26-28E0654515BB","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f8491fe5c6cca3bbbe9bb714c9b4c67bae1c7ddd","datavalue":{"value":{"entity-type":"item","numeric-id":532628,"id":"Q532628"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1046590$BE38CAFF-15B1-478E-A841-B063B954291B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cba7e298819d113214826f07c43d3e95a6b456c6","datavalue":{"value":{"time":"+2009-12-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1046590$DD04AF61-3C23-4FC0-879D-ED56496E0690","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a46a030770829cf3e475394ebd26780f4664daf1","datavalue":{"value":"Summary: In the multi-objective shortest path problem usually there is not just one single path that simultaneously minimises \\(r > 1\\) objective functions (costs); that is why the problem consists in finding the set of efficient paths of the given network. The number of such paths is often very large, while from an application point of view one is generally interested in selecting a given (small) number \\(k > 1\\) of efficient paths that are representative of the whole efficient path set. In this paper, we propose a clustering-based approach for selecting \\(k\\) efficient paths maximising their representativeness with respect to the cost vectors of all the efficient paths or w.r.t. the dissimilarity among the \\(k\\) selected paths. Computational results are given on random networks; a comparison with a known approach in the literature is also presented.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1046590$638DF5BC-B076-4336-9B0A-AF6244B31F01","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$1B5D6716-1C06-49F6-B83B-913DDDCF97F7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1edf5bf61a26b7202f5484abf16cec9af8e35a32","datavalue":{"value":"90C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$CA4BAA24-E59F-4648-931D-82657B148EBB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$A32242E2-7C01-4766-B58F-270C89BCD89F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f92e2a9e49a1751b5788391b3c0edc7b572a95f3","datavalue":{"value":"5651384","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$BEAB55E0-8F08-46EB-AB0F-B55FDC0D1F70","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4e4802d180dfc827f8cb6b373f481021ebaa44c7","datavalue":{"value":"multi-objective shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q1046590$D0FE0B4D-DC1A-4FBB-8B3C-7B4F688C2EE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7df3fcbc93b434da3a9217ba79973fdb25b788aa","datavalue":{"value":"fuzzy \\(k\\)-means algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1046590$E398B2B3-834D-4EB6-AAC9-11EA9E9ABCB9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e581880dd3d2da7675bfc773bfccef7640c3f40c","datavalue":{"value":"dissimilar paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q1046590$C80A9F21-1536-4850-AB59-91609D868634","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e9c4e650abc856b5f51d0b5123c5930fad01c53f","datavalue":{"value":"clustering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1046590$B0477EEB-69F4-4689-BDEE-CBA8608B1ACE","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":"Q1046590$A4713A05-3E96-4099-8322-BFEF7C351A79","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d956d379871159313b0b8acc9e8aba42854bfb13","datavalue":{"value":"https://doi.org/10.1504/ijdmmm.2009.027285","type":"string"},"datatype":"url"},"type":"statement","id":"Q1046590$C3079AAB-B88E-4A98-BD5A-73670FCBEC49","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a60e8caa01344ad5c9452cfa650f43939b676fff","datavalue":{"value":"W2053527995","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1046590$1EE6E0F9-4BFE-4DB9-A2A6-673D7139A4A2","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ac72c40719c2a5c00dd4c54b17bbf702bfb9817c","datavalue":{"value":{"entity-type":"item","numeric-id":1919112,"id":"Q1919112"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a3178234ae498dc1b04dc34fa26f501add4e1b4a","datavalue":{"value":{"amount":"+0.7741096615791321","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":"Q1046590$ED45725A-246D-4550-ACEB-7AB690938817","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dbd73d59dc75500f0b2afe2674a396c7f19f72f9","datavalue":{"value":{"entity-type":"item","numeric-id":1397030,"id":"Q1397030"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"37f6ca77b9af5e097ff16a6d44b780504e4c6c7a","datavalue":{"value":{"amount":"+0.7717892527580261","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":"Q1046590$084C0EAD-C613-470D-A220-5EEA701F083D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b1b6f97ca5a756fe4ced5ca9ede6181b60c83af9","datavalue":{"value":{"entity-type":"item","numeric-id":3610048,"id":"Q3610048"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"56c0a712a45ee814d51dd1334b1e53f08388f98c","datavalue":{"value":{"amount":"+0.7548742890357971","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":"Q1046590$FA9270E4-D4AB-4C02-BD93-7F3AF32F774A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1c5c77afe1f2c511fd5e50dd8c1fc2566d2563a6","datavalue":{"value":{"entity-type":"item","numeric-id":5308327,"id":"Q5308327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"318dc127e8b41af7242e757cb805056f45e68a19","datavalue":{"value":{"amount":"+0.7479745745658875","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":"Q1046590$E08A12B7-8FA9-470C-94B4-12D2336E7652","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6c95c01badc18e2c956a107a810f9b8f345812a5","datavalue":{"value":{"entity-type":"item","numeric-id":790051,"id":"Q790051"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"86402a5ba2cefaf2b714dcdd38514f1e219feec0","datavalue":{"value":{"amount":"+0.7424260973930359","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":"Q1046590$D42127D0-22FF-4D58-95EF-137BE1A2D1FA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the selection of \\(k\\) efficient paths by clustering techniques","badges":[]}}}}}