Delivery-flow routing and scheduling subject to constraints imposed by vehicle flows in fractal-like networks

• Published in: Archives of control sciences Vol. 27; no. 2; pp. 135 - 150
• Main Authors: Bocewicz, Grzegorz, Banaszak, Zbigniew, Nielsen, Izabela
• Format: Journal Article
• Language: English
• Published: Warsaw De Gruyter Open 01.06.2017; De Gruyter Poland; Polish Academy of Sciences
• Subjects: declarative modeling; delivery flow; Delivery scheduling; fractal structure; Fractals; multimodal process; Network topologies; Networks; Recursive methods; Route planning; Schedules; Traffic engineering; Traffic flow; Transport; transport network; vehicles flow
• DOI: 10.1515/acsc-2017-0008
• ISSN: 2300-2611; 1230-2384

The problems of designing supply networks and traffic flow routing and scheduling are the subject of intensive research. The problems encompass the management of the supply of a variety of goods using multi-modal transportation. This research also takes into account the various constraints related to route topology, the parameters of the available fleet of vehicles, order values, delivery due dates, etc. Assuming that the structure of a supply network, constrained by a transport network topology that determines its behavior, we develop a declarative model which would enable the analysis of the relationships between the structure of a supply network and its potential behavior resulting in a set of desired delivery-flows. The problem in question can be reduced to determining sufficient conditions that ensure smooth flow in a transport network with a fractal structure. The proposed approach, which assumes a recursive, fractal network structure, enables the assessment of alternative delivery routes and associated schedules in polynomial time. An illustrative example showing the quantitative and qualitative relationships between the morphological characteristics of the investigated supply networks and the functional parameters of the assumed delivery-flows is provided.