2010•Unpublished venueRequires access

Research on the Logistics Optimization of One-way Street of City

Jiang Jianhua, Wu Aidi, Wang Pengtao

Abstract

One-way Street of city is described as a strongly connected directed graph. Mathematical model is established by using related theory of strongly connected directed graph. The two algorithms are proposed, one is for solving the shortest distance between any two nodes in a strongly connected graph, and another is for computing the length of a minimal oriented H cycle based on improved genetic algorithm. Experimental results show the two algorithms are feasible and effective.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Computer science, Graph theory, Strongly connected component, Graph, Directed graph, Theoretical computer science, Mathematical optimization, Connectivity