# Peter H. RichterO&S Consultancy / www.os-consultancy.de / info@os-consultancy.de · Development

Peter H. Richter

Dr.-Ing. (Mathematics & Informatics)

Mission Oriented Research in Navigation and Logistics for SMEs: Problem Analysis --> Optimization --> Development

## About

24

Publications

2,411

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

10

Citations

Introduction

"Multiple Destination Tours' and Paths' Efficient Determination in Directed Graphs - Open & Closed Routes’ Fast Computation for Navigation & Logistics", ISBN 978-1-63648-284-2, ELIVA PRESS, Paperback – 4. August 2021, https://www.amazon.de/dp/1636482848, derived from
Richter, P. H.: "The Asymmetric Steiner Traveling Salesman Path Problem ASTSPP - Open and Closed Tours’ Efficient Determination in General Digraphs", conference ecco2021 https://ecco2021madrid.com/en/.

Additional affiliations

September 1969 - September 1972

**DVZ Berlin**

Position

- Programmer

September 1967 - September 1969

**Transformer Plant TRO Berlin**

Position

- Engineer

Description

- Transformer Design Engineer

Education

January 1999 - January 2004

**SATCON GmbH Teltow**

Field of study

- Efficient Communication within Satellite Nets

January 1994 - January 1999

January 1991 - January 1994

**Institute for Computer Integrated Engineering CoIn**

Field of study

- Artificial Intelligence & Expert Systems

## Publications

Publications (24)

The GTSPP looks in asymmetric directed graphs, whose nodes are partially segmented into several classes (services, clusters), for a shortest walk from a given start s to a given target t such that each class is visited at least once. The proposed construction method arises from the problem's decomposition into (a) Search for a Densest Set S of Serv...

The Presentation highlights the substance of an efficient construction algorithm’s strategy tackling the Generalized Traveling Salesman Path Problem GTSPP.

The Asymmetric Steiner Traveling Salesman Path Problem (ASTSPP) has been unattended in the past despite its high practical importance for real-time navigation in digital traffic nets! We are given a digraph G with asymmetric arc weights, start point s, target point t, and a subset S ⊆ V(G). The objective is to find a shortest route from s to t in G...

The objective of the ASTSPP is to find a shortest route from start s to target t in digraph G visiting all destinations S ⊆ V(G) at least once. The proposed, implemented and intensively tested ASTSPP heuristic allows:
(a) graphs not necessarily complete ones
(b) the use of asymmetric or symmetric arc costs
(c) routes not required to visit all V(G)...

Proposing a new efficient heuristic near-optimally solving the Asymmetric Steiner Traveling Salesman Path Problem ASTSPP. It is shown, that this heuristic also tackles Traveling Salesman Walk Problem, Asymmetric Traveling Salesman Walk Problem, Steiner Traveling Salesman Problem, Asymmetric Steiner Traveling Salesman Problem, Steiner Traveling Sale...

We consider the Asymmetric Traveling Salesman Walk Problem ATSWP. In contrast to the Asymmetric Traveling Salesman Path Problem ATSPP, ATSWP meets the important request allowing vertices to be visited more than once. We are given an asymmetric digraph G= (V(G), E(G)) with a set stopovers S⊂ V(G) (connection points, vertices, cities, …), arc weight...

The Asymmetric Multi-Stopover Problem AMSP definitely plays an increasing rule for application in traffic, navigation, and aviation due to harshly competitive restriction in time and energy consumption. This paper describes two deterministic algorithms, each of them efficiently solving the Asymmetric Multi-Stopover Problem AMSP as well as the Asymm...

We present an θ(|S| * |EG|) deterministic construction heuristic for the Asymmetric Traveling Salesman Problem ATSP on digraphs G. The heuristic relies on the fast determination of an approximate bidirectional Steiner Tree with respect to the stopovers S in V(G). The algorithm is a robust and very fast general ATSP-solution method. It has an astoni...

In this paper an advanced MANET algorithm / protocol is given based on a graph theoretical approach. We start with a general mathematical / graph theoretical analysis of the universal instance and problem in order to state a traceable objective function for the optimization. Afterwards we give an efficient and optimal solution algorithm that (a) .....

The Asymmetric Traveling Salesman Problem ATSP as well as a the Asymmetric Multi-Stopover Problem AMSP (also Multi-Destination Problem), is intractable (NP -hard). However, using the fastest optimal path algorithms combined with the fastest permutation method enables the real-time solution for problem sizes |S| ≤ 10 (12 including start and target,...

The paper gives the mathematical concept as well as an algorithm that efficiently tackles the optimal path problem considering turn restrictions. The internal graph representation remains unchanged apart from the necessary assignment of turn restriction. The algorithm develops Reverse Optimal Path Graphs (ROPGs) that are not necessarily cycles-free...

Today’s optimal path strategies are the more competitive the lower memory space and performance time they need. That is why the concept of hierarchical maps has been introduced to delegate the main part of long distance path determination to maps with levels as high as possible (larger regions <=> roads of higher levels). The size of the correspond...

Traffic flow planners have to consider that the optimiza-tion for minimum length (ore time) traffic flow layouts is not only a matter of shortest or fastest paths (cost crite-rion here called “routing cost” = “travel expense”): The traffic density of all the flows themselves traversing a road constitutes the important cost criterion “road charges”...

We present an efficient algorithm for the Traffic Flow Layout Problem TFLP that approximately minimizes both traveling expenses (time, length) and traffic intensity dependant road charges (capacity, noise, exhaustion, traffic calming, ..). The solution can be seen as a hybrid of the Quadratic Semi-Assignment Problem (QSAP) and the General Steiner P...

We give an efficient constructive deterministic approximation algorithm that determines minimum installation layouts with respect to cable cost and trace cost (the latter for supporting and safeguarding the cables) in order to embed intensity weighted flow nets (wiring diagrams, power supply systems, … ) into industrial, technical, or urban environ...

Changing the QAP's hard definition such that the facilities M are allowed to be mapped by a (single-valued, not necessarily injective) function π into the set of possible locations Y subject to a relation Π, π in Π, it arises the Semi-QAP that might be regarded as a relaxation of the QAP. In contrast to the Tree-QAP (flow graph F is a tree) the cor...

As to the General Connection Problem in Graphs we present an efficient constructive algorithm that tackles in a simultaneous manner both the placement
[(p)\vec]\vec \pi
of the entities M with respect to constraints and the routing
[(j)\vec] [(p)\vec] \vec \varphi _{\vec \pi }
with respect to connection rule
W Í M2 ×[(A)\tilde] ×[(N)\tilde]\Ome...

We present two new algorithms solving the Steiner problem in graphs. Provided the graphs are sparse the first algorithm ST l derived from the multiple-component proceeding of Ihe generalised minimum spanning tree (GMST) method runs independently of the number k of vertices Y intended to be connected in graph G, with a time effort of O(m * logn) (li...

Berlin, Akad. d. Wiss. d. DDR, Diss. A, 1989 (Nicht f.d. Austausch).
NEUE EFFEKTIVE ALGORITHMEN ZUR OPTIMIERUNG VON VERBINDUNGSSTRUKTUREN IN GRAPHEN
1. Interne Graph-Representation
2. Kürzeste-Wege-Baum-Algorithmen für grosse sparse Graphen - Funktions- und Laufzeitanalyse
• Label-Correcting-Methoden
- AI g. LC1 nach Bell man / Moor / Ford
- Alg....

PRESENT APPROXIMATIVE ALGORITHMS FOR
STEINER'S PROBLEM IN GRAPHS
CLASSIFICATION AND TWO NEW FAST APPROACHES
We present two new algorithms solving the Steiner problem in graphs. Provided the graphs are sparse the first algorithm ST1 derived from the multiple-component proceeding of the generalized minimum spanning tree (GMST) method runs independe...

The general tracing problem in graphs considers trace cost minimum layouts where the cost result from the traces used as well as from the lines conducted via them. Dependent on a specific trace cost δ, common or separate line conduction essentially influence the layout cost. A new constructive O(ρ 2 ·k 2 ·mlogn) approximation algorithm is proposed...

## Questions

Question (1)

Dear Mr. Y. Tan,

referring to your paper "Genetic algorithm of distance matrix ...", please let us know what you mean with the unusual denotations "First and Second Kind of GTSP" and where you found the corresponding definition. Possibly there is a link to the GTSP (sought is a shortest tour through each cluster) and the E-GTSP ("Equal GTSP" - sought is a shortest Hamiltonian tour through each cluster), isn't it?

Thanks and regards,

Peter Richter