The paper is a result of a research work concerning the development of an environmentally friendly transport system - Project EMITRANSYS. The publication contains the issues of shaping the transport system, where important factor due to the aspect of sustainable development is including the external costs in transport activity. This paper presents a mathematical model of the distribution of the traffic flow in the transport network. The paper presents selected aspects of the problem of multi-variant distribution of the traffic stream on the network transport for defined scenarios for the transport system development. Traffic distribution on the network has been made due to the criterion function – external cost connected with air pollution. The paper presents modal split of traffic ecological flow for chosen scenarios of the development domestic transport system. Key words: distribution of traffic on the network,

This paper discusses selected environmental and technological issues of routing freight vehicles in urban areas. The conditions of organizing distribution minimizing not only realization time but also the emission of harmful components of exhaust gases are described. Time-dependant traffic conditions characteristic for densely populated urban areas are defined and discussed according to ecological aspects. Theoretical information about CO 2 emission in urban conditions are gathered and used to formulate the base of mathematical model of a Time-Dependant Vehicle Routing Problem with emission criteria function, as a version of Capacitated Vehicle Routing Problem.The model comprises selected characteristics of urban transport infrastructure such as distances, speed limits, zones, or the effect of rush hours. It allows considering different types of vehicles according to the task requirements and emission characteristics, and changing traffic conditions.The model is implemented onto a representation of a real transport network and solved for given data with two step-heuristics basing on a modified A-star algorithm and genetic programming. Appropriate results, future research directions and other potential uses are presented and discussed.

Based on the analysis of the current literature, mathematical modelling of the studied phenomenon was carried out. It was conducted according to the graph theory for vehicles transporting dangerous, oversized, and valuable cargo, moving within a transport network. The mapping of the parking areas included organisational, technical, and security aspects. The main algorithm determines the driving routes based on the parkings that meet the requirements specified by the carrier. These routes can ultimately be analysed and evaluated based on the parameters resulting from the formulated criterion functions. To verify the performance of the algorithm, its implementation was carried out in a computer environment using the Neo4j graph database. The transport network, consisting of 462 transport nodes and 602 transport links, was mapped based on the real national road network of the province in Poland. Data from 113 parking locations in the study area were included in the analysis. The research covered a total of three case studies, one for each vehicle type requiring specific parking conditions, for various input data. The results obtained allowed us to assess the validity of selecting particular routes and evaluating the scalability of the solution. The result of this work is a method, which, on the one hand, fits the current transportation requirements. On the other hand, it lends itself to scaling, extension by additional logical constraints, and is compatible with modern parking systems.INDEX TERMS vehicle routing problem, parking assignment, parking requirements, transport planning, transportation software, truck driver scheduling

The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.

This paper presents multi-criteria warehouses location problem in the logistics network. In order to solve this problem the location model was developed. The limitations and optimization criteria of the model were determined. Optimization criteria refer to transportation costs, costs associated with warehouses, e.g.: local taxes, expenditure on starting the warehouse, the constant costs, the labour force costs, the purchase costs of the additional land for the expansion, the transition costs of the raw material via the warehouses. The final location of warehouse facilities was obtained using a genetic algorithm. The genetic algorithm was developed in order to solve the multi-criteria warehouses location problem. This paper describes the stages of the genetic algorithm i.e. the stage of designating the initial population, the crossover and mutation process, the adaptation function. In this paper, the process of calibration of this algorithm was presented. The results of the genetic algorithm were compared with the random results.