Michal Koháni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Michal Koháni has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Jaroslav Janacek
2 shared publications- Jaroslav Janáček
Faculty of Management Science and Informatics, University of Zilina, Univerzitna 8215/1, 010 26 Zilina, Slovakia
2 shared publications Matej Cebecauer
KTH Royal Institute of Technology
2 shared publicationsMichal Váňa
University of Žilina
2 shared publicationsPeter Czimmermann
University of Žilina
2 shared publicationsĽuboš Buzna
University of Žilina
2 shared publications
Latest Publications
- Open Access
- 1 October 2021
- Published by University of Zilina in Communications - Scientific letters of the University of Zilina
- Vol. 23 (4) , E68-E75
Two Objective Public Service System Design Problem
The? public? service? system? serves? population? spread? over? a? geographical? area from a given number of service centers. One of the possible approaches to? the? problem? with? two? or? more? simultaneously? applied? contradicting? objecti...
- 1 October 2021
- Published by University of Zilina in Communications - Scientific letters of the University of Zilina
- Vol. 23 (4) , E68-E75
Open AccessTwo Objective Public Service System Design Problem
The? public? service? system? serves? population? spread? over? a? geographical? area from a given number of service centers. One of the possible approaches to? the? problem? with? two? or? more? simultaneously? applied? contradicting? objecti...
- Open Access
- 1 January 2020
- Published by INSTICC
- p. 179-186
Comparison of Continuous and Discontinuous Charging Models for the Electric Bus Scheduling Problem
- 1 January 2020
- Published by INSTICC
- p. 179-186
Open AccessComparison of Continuous and Discontinuous Charging Models for the Electric Bus Scheduling Problem
- 29 June 2018
- Published by Springer Nature
- p. 151-169
Location-Scheduling Optimization Problem to Design Private Charging Infrastructure for Electric Vehicles
- 29 June 2018
- Published by Springer Nature
- p. 151-169
Location-Scheduling Optimization Problem to Design Private Charging Infrastructure for Electric Vehicles
- 1 October 2017
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 83, 165-178
Optimization of periodic crew schedules with application of column generation method
- 1 October 2017
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 83, 165-178
Optimization of periodic crew schedules with application of column generation method
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 54-57
Acceleration strategies of the column generation method for the crew scheduling problem
Crew scheduling is an important optimization problem in the railway industry. In last decades, the extension of computational resources made it feasible to address real-life problems generating large-scale set covering problems. Broadly used is the concept of shift frames, which is well suited current practice of several railway operators. In the case when the problem is described by one complete model, which covers all characteristics of the crew scheduling problem, it may lead to a large linear programming problem formulation, which can attack the limits of a common IP-solver. To overcome this obstacle, column generation technique can be used. Column generation technique can reduce the size of solved model. Despite the fact that it cannot find the optimal solution, it can enable to solve larger instances. In this contribution we explain the concept of frames used in design of periodic timetable and analyze the property of the particular frame networks. We explain the column generating principle in connection with the crew scheduling problem. We present improving methods to accelerate the column generation method that are able to find solution of the solved sub-problem faster and different strategies of producing the initial collections of columns, which enable to make the column generation process more effective. Although the computational time in the scheduling problems is not an critical issue, the reduce of the computational time can enable to use this method in the decision supporting tool for the crew schedule design under practical conditions, especially in large scale problems. To test proposed improvements we use various benchmarks of real problems from crew scheduling in railway transportation systems.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 54-57
Acceleration strategies of the column generation method for the crew scheduling problem
Crew scheduling is an important optimization problem in the railway industry. In last decades, the extension of computational resources made it feasible to address real-life problems generating large-scale set covering problems. Broadly used is the concept of shift frames, which is well suited current practice of several railway operators. In the case when the problem is described by one complete model, which covers all characteristics of the crew scheduling problem, it may lead to a large linear programming problem formulation, which can attack the limits of a common IP-solver. To overcome this obstacle, column generation technique can be used. Column generation technique can reduce the size of solved model. Despite the fact that it cannot find the optimal solution, it can enable to solve larger instances. In this contribution we explain the concept of frames used in design of periodic timetable and analyze the property of the particular frame networks. We explain the column generating principle in connection with the crew scheduling problem. We present improving methods to accelerate the column generation method that are able to find solution of the solved sub-problem faster and different strategies of producing the initial collections of columns, which enable to make the column generation process more effective. Although the computational time in the scheduling problems is not an critical issue, the reduce of the computational time can enable to use this method in the decision supporting tool for the crew schedule design under practical conditions, especially in large scale problems. To test proposed improvements we use various benchmarks of real problems from crew scheduling in railway transportation systems.
- Open Access
- 1 January 2017
- Published by INSTICC
- p. 360-368
Designing Charging Infrastructure for a Fleet of Electric Vehicles Operating in Large Urban Areas
- 1 January 2017
- Published by INSTICC
- p. 360-368
Open AccessDesigning Charging Infrastructure for a Fleet of Electric Vehicles Operating in Large Urban Areas
- 11 July 2014
- Published by Taylor & Francis in Transportation Planning and Technology
- Vol. 37 (7) , 638-648
Estimation of a route choice model for urban public transport using smart card data
This paper describes a logit model of route choice for urban public transport and explains how the archived data from a smart card-based fare payment system can be used for the choice set generation and model estimation. It demonstrates the feasibility and simplicity of applying a trip-chaining method to infer passenger journeys from smart card transactions data. Not only origins and destinations of passenger journeys can be inferred but also the interchanges between the segments of a linked journey can be recognised. The attributes of the corresponding routes, such as in-vehicle travel time, transfer walking time and to get from alighting stop to trip destination, the need to change, and the time headway of the first transportation line, can be determined by the combination of smart card data with other data sources, such as a street map and timetable. The smart card data represent a large volume of revealed preference data that allows travellers' behaviour to be modelled with higher accuracy than by using traditional survey data. A multinomial route choice model is proposed and estimated by the maximum likelihood method, using urban public transport in Žilina, the Slovak Republic, as a case study
- 11 July 2014
- Published by Taylor & Francis in Transportation Planning and Technology
- Vol. 37 (7) , 638-648
Estimation of a route choice model for urban public transport using smart card data
This paper describes a logit model of route choice for urban public transport and explains how the archived data from a smart card-based fare payment system can be used for the choice set generation and model estimation. It demonstrates the feasibility and simplicity of applying a trip-chaining method to infer passenger journeys from smart card transactions data. Not only origins and destinations of passenger journeys can be inferred but also the interchanges between the segments of a linked journey can be recognised. The attributes of the corresponding routes, such as in-vehicle travel time, transfer walking time and to get from alighting stop to trip destination, the need to change, and the time headway of the first transportation line, can be determined by the combination of smart card data with other data sources, such as a street map and timetable. The smart card data represent a large volume of revealed preference data that allows travellers' behaviour to be modelled with higher accuracy than by using traditional survey data. A multinomial route choice model is proposed and estimated by the maximum likelihood method, using urban public transport in Žilina, the Slovak Republic, as a case study
- Open Access
- 17 June 2014
- Published by Hindawi Limited in Journal of Applied Mathematics
- Vol. 2014, 1-12
An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective
We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally designed to solve thep-median problem. By numerical experiments, we demonstrate that our algorithm allows increasing the size of solvable problems and provides high-quality solutions. The algorithm found an optimal solution for all tested instances where we could compare the results with the exact algorithm.
- 17 June 2014
- Published by Hindawi Limited in Journal of Applied Mathematics
- Vol. 2014, 1-12
Open AccessAn Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective
We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally designed to solve thep-median problem. By numerical experiments, we demonstrate that our algorithm allows increasing the size of solvable problems and provides high-quality solutions. The algorithm found an optimal solution for all tested instances where we could compare the results with the exact algorithm.