Lidé na fakultě
Ing. Alena Rybičková, Ph.D.

2024, Transportation, 51, p. 1785-1807), ISSN 1572-9435

This paper provides insights into differences in carsharing users’ attitudes, motives for joining carsharing, and transport behaviour between users with and without another car at their disposal. It builds on revealed and stated data about members of the oldest carsharing company in the Czech Republic. Carsharing adopters without a car utilise shared cars more intensively than carsharing users with a car available in their household. On the other hand, unlike the second group, they drive fewer kilometres by car in total. The car availability in households also influences the shift in car use after joining carsharing. The sale of a car thanks to adopting carsharing is a factor leading to a decrease in overall car use. Those who have a car at their disposal within their household have a lower probability of decreasing kilometres driven after joining carsharing. Households without an additional car available seem to be less car-dependent on average than those utilising carsharing as a second or third car. They tend to be more environmentally conscious and more inclined towards policies supporting alternative modes and restricting private car use, although both groups share these beliefs. The findings open a debate over whether carsharing increases the legitimacy of restrictive transport measures against private car ownership and use.

Článek v periodiku excerpovaném SCI Expanded

2024, 2024 Smart City Symposium Prague (SCSP), New York, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC), p. 34-40), ISBN 979-8-3503-6095-0, ISSN 2691-3666

The optimization of winter maintenance operations is a multifaceted challenge, influenced especially by legal frameworks and requirements that differ among countries. As a result, algorithms for optimal road maintanace often include a number of specific constraints and therefore are not generally applicable to different environments. This paper focuses on the algorithmic techniques employed to increase efficiency and effectiveness of winter maintenance strategies, while addressing the challenges posed by legal requirements in Czechia, that include road hierarchy and maximum time limits for the service.

Stať ve sborníku z mezinár. konf.

2024, 2024 Smart City Symposium Prague (SCSP), New York, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC), p. 48-53), ISBN 979-8-3503-6095-0, ISSN 2691-3666

Following on our research project that is focused on the use value of a product and externalities arising from the application of the new tariff policy in passenger air transport, we have proceeded to study another segment within this environment. This segment is private jets companies. This paper analyses the position of private air transport with a focus on a specific business model - Business Jets. Topic that is currently widely used in corporate environments with production entities spread across Europe. The paper focuses on a comparison of private jet companies segment and scheduled air transport under the conditions where the end user is of the passenger air transport is a company or enterprise. The comparison of these two segments is a relevant way how to prove our thesis. Recently, there is a significant deterioration in quality of the air transport service. And above, as a result of the application of the new tariff policy, there is an allocation of several costs of scheduled passenger air transport operators to the end customer.

Stať ve sborníku z prestižní konf.

2023

Výsledek navrhne strukturu provozních souborů dálkových linek, u nichž se předpokládá objednávka Ministerstvem dopravy, či koncesní model spravovaný MD. Každý soubor bude co nejvíce homogenní z hlediska typu a kapacity soupravy, jakož i společných stanic, kde bude umožněn přechod soupravy mezi linkami s tím, že bude zvolena vhodná stanice pro provozní ošetření, pokud možno nevyžadující prázdné jízdy. Tento soubor tak může být přímo či v rámci nabídkového řízení zadán jedinému dopravci.

Technická zpráva v češtině

2022, 2022 Smart City Symposium Prague (SCSP), Vienna, IEEE Industrial Electronic Society), ISBN 978-1-6654-7923-3, ISSN 2691-3666

As the number of elderly population grows, a special attention to mobility of this age group is required. This paper focuses on increasingly popular service of on-demand taxi transport offered by municipalities for elderly for subsidised price. We have altered a nearest neighbour algorithm for vehicle routing problem with time windows for the purpose of the problem and evaluated on the case study of a Czech city. The goal of this study was to verify if such algorithmic approach could increase utility of vehicles and efficiency of the service and could be beneficial for the customers and service providers.

Stať ve sborníku z mezinár. konf.

2019, Neural Network World, 29 (3), p. 173-187), ISSN 1210-0552

This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.

Článek v periodiku excerpovaném SCI Expanded

2016, 2016 Smart Cities Symposium Prague (SCSP), New York, IEEE Press), ISBN 978-1-5090-1116-2

In this paper, we focus on solving location-routing problem that belongs to NP-hard problems and that often appears in the optimization of supply chain and distribution systems. The goal of location-routing problem is to determine the location of multiple depots together with vehicle routes such that the total cost of the system is minimal. A genetic algorithm is proposed to solve a deterministic location-routing problem. The representation of individuals together with genetic operators are designed to solve both location and routing part interdependently. Various parameters of genetic algorithm are tested to show their influence on the results and effectiveness of the proposed algorithm.

Stať ve sborníku z prestižní konf.

2015, Applied Mechanics and Materials, 803 (803(2015)), p. 69-75), ISSN 1660-9336

In this paper, we focus on the optimization of the system of the spare parts distribution for authorized garages in the Czech Republic. A spare parts market belongs to one of the key elements of the car industry. However, it has to adapt to still higher requirements on accuracy, speed and minimum error rate of the deliveries with keeping the costs at its minimum at the same time. The distribution of products from depots to customers is a practical and challenging problem in logistics that opens a significant space for application of software products. The design of optimal routes of vehicles from two depots can be formulated in combinatorial optimization as a multi-depot vehicle routing problem. The goal of a multi-depot vehicle routing problem is to design routes that start and end in one of the depots and visit a subset of customers in a specific sequence. Every customer has to be visited on one of the routes and the total costs for the delivery should be minimal. Vehicle routing problems belong to the class of NP-hard problems which means that there is no efficient algorithm for finding optimal solution available. To find a solution in an efficient way, we propose an approximate method based on a genetic algorithm.

Článek v odborném recenzovaném periodiku

2015, YTEC 2015 - Sborník příspěvků konference, Praha, České vysoké učení technické v Praze, Fakulta dopravní), p. 202-207), ISBN 978-80-01-05791-9

Location routing problem (LRP) combines two basic planning problems in logistics. These are facility location problem in which we decide about optimal location of arbitrary types of facilities (factories, warehouses, depots, hubs etc.) and vehicle routing problem that has a goal to determine optimal routes for vehicles. It is well known that making these two decisions independently can lead to significantly suboptimal results. Not only for this reason, much research is focused on LRP recently. The paper classifies LRP according to its most important characteristics and presents basic methods for its solution.

Stať ve sborníku z mezinár. konf. cizojazyčně

2015, 2015 Smart Cities Symposium Prague (SCSP), New York, IEEE Press), ISBN 978-1-4673-6727-1

In this paper we focus on the system of the spare parts distribution for authorised garages in the Czech republic and its optimization based on genetic algorithm. Real world problem of garages supply consists of the design of the optimal location of distribution depots and the design of routes that are used for everyday delivery of spare parts. Both of these subproblems that belong to NP-hard problems are solved separately using genetic algorithm. In the facility location problem, the set of customers, set of potential locations of facilities and distances for all their combinations are given and our goal is to select location of facilities with the minimum costs based on chosen criterion. In the second part of the optimization the vehicle routing problem is solved where the goal is to determine the routes described as a sequence of customers visited on this route. Every route starts and ends in the depot and is limited by capacity of the vehicle. Homogeneous fleet was used in this problem.

Stať ve sborníku z prestižní konf.

2015, Smart Cities Symposium Prague 2015 Proceedings - Czech Technical University in Prague, Praha, České vysoké učení technické v Praze, Fakulta dopravní), p. 27-27), ISBN 978-80-01-05742-1

In this paper we focus on the system of the spare arts distribution for authorised garages in the Czech republic and its optimization based on genetic algorithm. Real world problem of garages supply consists of the design of the optimal location of distribution depots and the design of routes that are used for everyday delivery of spare parts. Both of these subproblems that belong to NP-hard problems are solved separately using genetic algorithm. In the facility location problem, the set of customers, set of potential locations of facilities and distances for all their combinations are given and our goal is to select location of facilities with the minimum costs based on chosen criterion. In the second part of the optimization the vehicle routing problem is solved where the goal is to determine the routes described as a sequence of customers visited on this route. Every route starts and ends in the depot and is limited by capacity of the vehicle. Homogeneous fleet was used in this problem.

Abstrakt ve sborníku z mezinár. konf. cizojazyčně

2014, PARIPEX – Indian Journal of Research, III (VII), ISSN 2250-1991

The article concerns the proposal of the solution of genetic operators of a genetic algorithm for calculation of a transportation task in the travelling salesman problem. Travelling salesman problem belongs to NP-hard problems with significant use in transportation. Application of genetic algorithm to a specific problem includes mainly design of encoding and three operators of selection, crossover and mutation. For all these operators several variants were proposed with regard to travelling salesman problem specifics as well as some other adjustments to the problem.

Článek v odborném recenzovaném periodiku

2014, Neural Network World, 24 (1), p. 57-78), ISSN 1210-0552

Distribution of the goods from a producer to a customer is one of the most important tasks of transportation. This paper focuses on the usage of genetic algorithms (GA) for optimizing problems in transportation, namely vehicle routing problem (VRP). VRP falls in the field of NP-hard problems, which cannot be solved in polynomial time. The problem was solved using genetic algorithm with two types of crossover, both including and leaving-out elitism, setting variable parameters of crossover and mutation probability, as well as prevention of creating invalid individuals. The algorithm was programmed in Matlab, tested on real world problem of spare parts distribution for garages, while the results were compared with another heuristic method (Clarke-Wright method).

Článek v periodiku excerpovaném SCI Expanded

2014, Engineering Optimization 2014, Leiden, CRC Press/Balkema), p. 639-644), ISBN 978-1-138-02725-1

Distribution of goods from a producer to a customer belongs to the most important tasks of transportation. Our paper focuses on the usage of Genetic Algorithms (GA) for optimizing problems in transportation, namely uncapacitated facility location problem and vehicle routing problem. Both types of problems fall in the field of NP-hard problems, which cannot be solved in polynomial time. Two sets of customers and potential facilities and non-negative distances for any two elements are given in the facility location problem. The goal is to select facility locations such that the total cost is minimum. Vehicle routing problem can be described as a problem of determining vehicle routes, where every route starts in depot, then a subset of customers is visited in a specific sequence, followed by return to the depot. Every customer has to be assigned to exactly one route and the overall amount of delivered quantity of consignments assigned to one vehicle cannot exceed the capacity of the vehicle. Routes should be chosen so that the total cost of delivery is minimum. Real world problem from the field of spare parts distribution for automotive industry in the Czech Republic is solved using genetic algorithm. Spare parts supply chain consists of two depots and set of garages which are supplied on a daily basis.

Stať ve sborníku z mezinár. konf.

2014, 4th International Conference on Engineering Optimization, p. 191-192), ISBN 978-989-96276-6-6

Distribution of goods from a producer to a customer belongs to the most important tasks of transportation. Our paper focuses on the usage of genetic algorithms (GA) for optimizing problems in trans- portation, namely uncapacitated facility location problem and vehicle routing problem. Both types of problems fall in the field of NP-hard problems, which cannot be solved in polynomial time. Two sets of customers and potential facilities and non-negative distances for any two elements are given in the facility location problem. The goal is to select facility locations such that the total cost is minimum. Vehicle routing problem can be described as a problem of determining vehicle routes, where every route starts in depot, then a subset of customers is visited in a specific sequence, followed by return to the depot. Every customer has to be assigned to exactly one route and the overall amount of delivered quantity of consignmentsassigned to one vehicle cannot exceed the capacity of the vehicle. Routes should be chosen so that the total cost of delivery is minimum. Real world problem from the field of spare parts distribution for automotive industry in the Czech Republic is solved using genetic algorithm. Spare parts supply chain consists of two depots and set of garages which are supplied on daily basis.

Abstrakt ve sborníku z mezinár. konf. cizojazyčně