Have a personal or library account? Click to login
Budget Travel in the Mediterranean: A Methodology for Reconstructing Ancient Journeys through Least Cost Networks Cover

Budget Travel in the Mediterranean: A Methodology for Reconstructing Ancient Journeys through Least Cost Networks

By: Fiona Carroll and  Edward Carroll  
Open Access
|Mar 2022

Figures & Tables

jcaa-5-1-88-g1.png
Figure 1

Schematic illustration of rotate and oversample method. Here n = 5, the solid line resulting from step 5, dashed from step 6.

jcaa-5-1-88-g2.png
Figure 2

Least costs paths on a flat surface radiating from a central point. Standard queen’s move (left), rotate methodology (right).

jcaa-5-1-88-g3.png
Figure 3

Rotate and oversample LCP (thick) compared with standard queen’s move LCP (thin).

jcaa-5-1-88-g4.png
Figure 4

Schematic of travel costs between three points. Lines AB and BC represent the costs of travelling established roads. Dotted line AC represents a proposed direct road from A to C.

jcaa-5-1-88-g5.png
Figure 5

LCP networks of increasing complexity generated for late third century BCE Cyprus. GPO method used for λ < 1, others using LOS.

jcaa-5-1-88-g6.png
Figure 6

Frequency plots of normalized difference between LCPnet and TP. For λ = 4, 7 and 10 at 0.1 bin intervals.

jcaa-5-1-88-g7.png
Figure 7

Frequency plots of actual and modelled normalized difference. Red+purple covers actual frequency distribution (as in Figure 6), whilst blue+purple give that modelled by the sum of the two Gaussian functions shown, defined by population sizes (N), standard deviation (σ) and mean (μ).

jcaa-5-1-88-g8.png
Figure 8

Modelled networks in late third century BCE Peloponnese. Major (thick black) and minor (thin blue) roads from a putative network created with λ = 0.65 (β = 1.31) and λ = 7.0 (β = 3.0). All roads in the simpler network are also in the more complex network. The area around Geronthrai is magnified.

jcaa-5-1-88-g9.png
Figure 9

Section of combined land and sea network. Based on Pleiades locations extant in the late third century BCE.

jcaa-5-1-88-g10.png
Figure 10

Delphic theoroi itinerary for Cyprus. Top: Actual itinerary from theorodokoi list with routes between numbered destinations inferred from network defined by λ = 7. Unnumbered are intermediate nodes in network derived from backlink matrix. Middle: TSP solution, sea speed 3.9 knots. Bottom: TSP solution, sea speed 2.5 knots.

jcaa-5-1-88-g11.png
Figure 11

Delphic theoroi itinerary for Crete. Top: Actual itinerary from theorodokoi list with routes between numbered destinations inferred from network defined by λ = 7. Unnumbered are intermediate nodes in network derived from backlink matrix. Middle: TSP solution, sea speed 3.9 knots. Bottom: TSP solution, sea speed 2.2 knots. Kaudos is inserted as an end point since it seems that the itinerary then continued with Cyrene in Libya.

Table 1

Threshold sea speeds (knots) at which TSP routes become similar to Delphic theoroi routes for networks of different complexity (λ).

λ = 4λ = 7λ = 10
Cyprus2.52.52.5
Crete1.92.22.3
DOI: https://doi.org/10.5334/jcaa.88 | Journal eISSN: 2514-8362
Language: English
Submitted on: Jan 12, 2022
|
Accepted on: Mar 11, 2022
|
Published on: Mar 31, 2022
Published by: Ubiquity Press
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2022 Fiona Carroll, Edward Carroll, published by Ubiquity Press
This work is licensed under the Creative Commons Attribution 4.0 License.