Problem 458. Parcel Routing

Created by @bmtran (Bryant Tran)

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given a matrix that represent the distance along highways between major cities numbered 1 to</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>N</w:t></w:r><w:r><w:t>, provide the path and shortest distance from a given city,</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>from</w:t></w:r><w:r><w:t>, to a given city,</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>to</w:t></w:r><w:r><w:t>. Assume that 0 represents no direct path between two cities. If there is no solution to the problem, return -1 for both the path and the distance.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

62 Solutions
11 Solvers

Last Solution submitted on Oct 17, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Solution 8863815

1 Comment

1 Comment

Dyuman Joshi on 3 Aug 2022

Thanks to problem #54810

Solution 57507

3 Comments

3 Comments

Alfonso Nieto-Castanon on 6 Mar 2012

something strange with test cases 22, 23, and 25, the solution provided does not look like the shortest path (e.g. test case 22; the path 23-7-24-4-14 is shorter than the solution path 23-7-14), perhaps your solver is assuming triangular property of distances while the data provided does not have this property?

@bmtran (Bryant Tran) on 7 Mar 2012

i'll look into it

@bmtran (Bryant Tran) on 7 Mar 2012

I agree with you. i'm ammending my test cases now.

Problem Recent Solvers11

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 458. Parcel Routing

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers11

Suggested Problems

More from this Author56

Problem Tags

Community Treasure Hunt

Problem 458. Parcel Routing

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers11

Suggested Problems

More from this Author56

Problem Tags

Community Treasure Hunt

Players