{"entities":{"Q1717836":{"pageid":1728577,"ns":120,"title":"Item:Q1717836","lastrevid":73817319,"modified":"2026-04-14T17:21:57Z","type":"item","id":"Q1717836","labels":{"en":{"language":"en","value":"Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7015867"}},"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":"Q1717836$239B8ED0-9E85-4848-88F5-D825BF64996B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a70969a8f8eb5db6257b4a7a08e1e46f9ee73024","datavalue":{"value":{"text":"Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1717836$192C71AF-9417-429E-A7FB-988F2A6C0329","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ae22825800e0e86b4a3101a4d229199f089ef000","datavalue":{"value":"1407.90190","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$60BB95F9-515D-47F7-B3BB-6FFD07D58E31","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6ceb1779c06d723a68d2300f8c67e50c489f4dba","datavalue":{"value":"10.1155/2014/185383","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$AE7613F7-E172-4CB9-BD84-3350C5DD2DE2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5499461810c8d0350cb350c64ca82cd165e87451","datavalue":{"value":{"entity-type":"item","numeric-id":249807,"id":"Q249807"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$BAA503E3-519A-4CC9-84D5-FFDBA986D806","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8fc8b0f5d31bff9e8e598929f9b711611dc8a1b1","datavalue":{"value":{"entity-type":"item","numeric-id":223538,"id":"Q223538"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$DEC9D570-BF94-4EDB-A245-6FA2C751EA8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"36c1473aa363b332fe5bf9192f165db641d5fc37","datavalue":{"value":{"entity-type":"item","numeric-id":1717834,"id":"Q1717834"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$BBD5002A-5E41-4D09-8D6A-589C00501655","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"98f2fc6c1af0d42e9f0f9fe1757345f92108af79","datavalue":{"value":{"entity-type":"item","numeric-id":1717835,"id":"Q1717835"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$A44EFBD4-005D-496E-81BD-081CD026F2A1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3dc97bc0aff607b9c22ce37ffa18b6de85001d90","datavalue":{"value":{"entity-type":"item","numeric-id":86199,"id":"Q86199"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$C534620A-F95C-40DD-A988-34B3E74C2632","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"32a6dc046c0aa99508538df457dbadf7aa620337","datavalue":{"value":{"time":"+2019-02-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1717836$CFFC2A41-3DCC-420F-8AC1-6319DF77F1BA","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7dafc76052727428a2f568250145444919de6527","datavalue":{"value":"Summary: We consider an ad hoc Floyd-A algorithm to determine the a priori least-time itinerary from an origin to a destination given an initial time in an urban scheduled public transport (USPT) network. The network is bimodal (i.e., USPT lines and walking) and time dependent. The modified USPT network model results in more reasonable itinerary results. An itinerary is connected through a sequence of time-label arcs. The proposed Floyd-A algorithm is composed of two procedures designated as Itinerary Finder and Cost Estimator. The A-based Itinerary Finder determines the time-dependent, least-time itinerary in real time, aided by the heuristic information precomputed by the Floyd-based Cost Estimator, where a strategy is formed to preestimate the time-dependent arc travel time as an associated static lower bound. The Floyd-A algorithm is proven to guarantee optimality in theory and, demonstrated through a real-world example in Shenyang City USPT network to be more efficient than previous procedures. The computational experiments also reveal the time-dependent nature of the least-time itinerary. In the premise that lines run punctually, ``just boarding'' and ``just missing'' cases are identified.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1717836$69206058-5577-4B65-9D81-F9418C3462EE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$ED0A5659-1E85-45A4-9ACB-051BF19E68CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"810d660658648f9bc3138c1cd0aba8029bb9050c","datavalue":{"value":"90B06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$799C4F98-5787-4615-88EB-4BA8D68E71C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$FD607AD2-21D0-4DD1-A784-4669985E8D14","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0eff9420408dc5a134449cb73f1a754b6d895e89","datavalue":{"value":"7015867","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$DFC1CB74-8F03-40CD-8CF3-4818974757DF","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"dec3b27a93efebe3fcc6ee17f0d2ba8ccc765550","datavalue":{"value":"Q59063601","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$B07403BD-D482-43AD-87C3-299FEE384DE2","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"1412ceb6c71a23f10e8f7e008bf034264afa1496","datavalue":{"value":{"entity-type":"item","numeric-id":41444,"id":"Q41444"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$A4059906-3FA2-4BB0-BB19-8DB2AA800B25","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":"Q1717836$BD947493-672A-4CAA-A718-1E33F202DE4B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"24c1f6b85638c4d804d93043e8be87fa1264ff7a","datavalue":{"value":"https://doi.org/10.1155/2014/185383","type":"string"},"datatype":"url"},"type":"statement","id":"Q1717836$33076C15-A695-4960-803A-F7C19E711001","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"d4b3b0b2bee03d5a80919cc7308f6741a795134b","datavalue":{"value":"W2064908938","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1717836$1A4027E6-9E8F-4023-A27F-F940B09F2E6F","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"8711427bfaa2f692ac88a43ecce32a992b6d16ec","datavalue":{"value":{"entity-type":"item","numeric-id":3644732,"id":"Q3644732"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$B4FE063D-06DE-4100-AC8A-38AF2A57103C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7ea387bba8c12bbc7757585a45d48fb0363a3311","datavalue":{"value":{"entity-type":"item","numeric-id":1761096,"id":"Q1761096"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$B22D2D56-ED52-41CB-BE55-431D010AEBD9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ef5f21d5b0bf77098817cf3e6a0c3b3389dc5d43","datavalue":{"value":{"entity-type":"item","numeric-id":948645,"id":"Q948645"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$B48F30A1-F00F-4590-B4C0-CA321F99ED00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c07d22ba0039473f2a01010138788bd5c02117d3","datavalue":{"value":{"entity-type":"item","numeric-id":2499162,"id":"Q2499162"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$C04F7B3D-4476-4B88-B4ED-7BA4747A4DB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9db380eab44c737154b8172f695ee88a055c1535","datavalue":{"value":{"entity-type":"item","numeric-id":2892160,"id":"Q2892160"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$0AE0A15B-4F71-4BEA-9721-3A921BAA02E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0276affe7451ebbbbf0ccd7bf8d7b29334863b93","datavalue":{"value":{"entity-type":"item","numeric-id":5448767,"id":"Q5448767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$BF97FA1F-1DB3-47EA-8678-0BDDEF7C26EB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"13e8eb9d5234035a4ad401012e1f97e0ade384fb","datavalue":{"value":{"entity-type":"item","numeric-id":5406210,"id":"Q5406210"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$74A14AA2-5291-4D27-BCA0-4C0EAED67D02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"cd54a3ffeb675acc1e8e9c4f5d112b5533ca216d","datavalue":{"value":{"entity-type":"item","numeric-id":3507787,"id":"Q3507787"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$C937694F-6C7C-430C-B2E1-45125EECC92C","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"39381ceb83ddefaab6730a4968ae549c89939f47","datavalue":{"value":{"entity-type":"item","numeric-id":2847388,"id":"Q2847388"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ec7862dcac6d625282fda98b60f397bc9b18ebdf","datavalue":{"value":{"amount":"+0.7681236863136292","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":"Q1717836$F36921A6-F6D1-4057-8D68-6B273511B981","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"341083662232bd6c8149941031ecb90750357f3f","datavalue":{"value":{"entity-type":"item","numeric-id":1793543,"id":"Q1793543"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d5a15bcbaaaaf81ca77a63bb246ebea3ffed52b4","datavalue":{"value":{"amount":"+0.7515178322792053","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":"Q1717836$B9A59440-F273-4B9E-BDB1-8EA9E9CC9DDC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2c72145ad9e26166c9119077298b15abb66158eb","datavalue":{"value":{"entity-type":"item","numeric-id":3740578,"id":"Q3740578"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"78ddb10cba7de61a71b8a6ec06f3564d7c5405bb","datavalue":{"value":{"amount":"+0.7455536127090454","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":"Q1717836$BA3BE5A8-882C-4A42-9D46-CCE1EF27137D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"333496576fa2b1e1bc783a31a84e8b1ee2f5e048","datavalue":{"value":{"entity-type":"item","numeric-id":3452863,"id":"Q3452863"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"735bac90c0a38702baaadd275231dd12f52ab850","datavalue":{"value":{"amount":"+0.7437829375267029","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":"Q1717836$D4367300-3A27-4F13-A6BA-DD7C815749D6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a73d8ff52f12355cc55c02a58d344224de3543e7","datavalue":{"value":{"entity-type":"item","numeric-id":1388936,"id":"Q1388936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1b1e201b998a645a905dc08d3009d5cf262988aa","datavalue":{"value":{"amount":"+0.7370032668113708","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":"Q1717836$F424A498-8499-41C2-B587-192607E5822E","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"daf5f856a5d861312ad309ab567540337a5f61d6","datavalue":{"value":{"entity-type":"item","numeric-id":57050,"id":"Q57050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1717836$20F9C008-556D-4DC6-9414-D0E91513F010","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Floyd-A_algorithm_solving_the_least-time_itinerary_planning_problem_in_urban_scheduled_public_transport_network"}}}}}