Mor Kaspi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mor Kaspi has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Tal Raviv
School of Industrial and Intelligent Systems Engineering, Tel Aviv University, Tel Aviv 6997801, Israel
8 shared publications Michal Tzur
Department of Industrial Engineering, Faculty of Engineering, Tel-Aviv University, Tel-Aviv, Israel
4 shared publications- Claudia Bongiovanni2 shared publications
- Marlin Wolf Ulmer
Otto-von-Guericke-Universität Magdeburg, 39106 Magdeburg, Germany
2 shared publications Nikolas Geroliminis
2 shared publications- Amichai Painsky
Tel Aviv University
1 shared publication
Latest Publications
- 29 October 2026
- Published by Springer Nature in Journal of Heuristics
- Vol. 32 (4) , 36
Large and variable neighborhood search approaches for large scale partial set covering problems
- 29 October 2026
- Published by Springer Nature in Journal of Heuristics
- Vol. 32 (4) , 36
Large and variable neighborhood search approaches for large scale partial set covering problems
- Open Access
- 2 September 2026
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 15
The Dial-A-Ride Problem with transfers and walking
- 2 September 2026
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 15
Open AccessThe Dial-A-Ride Problem with transfers and walking
- Open Access
- 2 April 2026
- Published by Wiley in Naval Research Logistics (NRL)
Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach
Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting in which AMRs are allowed to travel onboard public transit vehicles, with the objective of extending the service range and reducing energy consumption. To model this problem, we propose two mixed‐integer linear programming formulations: an arc‐based formulation and a path‐based formulation. For the latter, we develop a column generation approach coupled with a four‐stage dynamic programming algorithm to efficiently solve the underlying pricing subproblem. This solution approach is further embedded within a rolling horizon framework to address dynamic and large‐scale operational settings. A case study conducted in a subregion of Tel Aviv demonstrates the ability of the proposed methodology to handle large‐scale instances based on real‐world parameters. A sensitivity analysis highlights the effects of request time‐window widths, public transit capacity, and AMR battery range on the number of requests that can be served. Finally, the results obtained under the rolling horizon framework confirm the feasibility and practical applicability of the proposed column generation approach.
- 2 April 2026
- Published by Wiley in Naval Research Logistics (NRL)
Open AccessLeveraging Public Transit for Robotic Deliveries: A Column Generation Approach
Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting in which AMRs are allowed to travel onboard public transit vehicles, with the objective of extending the service range and reducing energy consumption. To model this problem, we propose two mixed‐integer linear programming formulations: an arc‐based formulation and a path‐based formulation. For the latter, we develop a column generation approach coupled with a four‐stage dynamic programming algorithm to efficiently solve the underlying pricing subproblem. This solution approach is further embedded within a rolling horizon framework to address dynamic and large‐scale operational settings. A case study conducted in a subregion of Tel Aviv demonstrates the ability of the proposed methodology to handle large‐scale instances based on real‐world parameters. A sensitivity analysis highlights the effects of request time‐window widths, public transit capacity, and AMR battery range on the number of requests that can be served. Finally, the results obtained under the rolling horizon framework confirm the feasibility and practical applicability of the proposed column generation approach.
- 9 October 2024
- Published by Elsevier in Case Studies on Transport Policy
- Vol. 18
Quantifying the external costs of autonomous on-demand ride pooling services
- 9 October 2024
- Published by Elsevier in Case Studies on Transport Policy
- Vol. 18
Quantifying the external costs of autonomous on-demand ride pooling services
- Open Access
- 6 October 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 344 (1) , 267-285
The Israeli queue with a capacitated server: modeling and approximations
The Israeli Queue is a batch service polling system where a single server attends to multiple queues based on seniority. Each arriving customer belongs to one of several classes. Upon arrival, a customer either joins an existing queue for their class or initiates a new queue if they are the first of their class to arrive. Customers from the class with the most senior member are served together as a batch, with the service time remaining constant regardless of the batch size. This service model is found in applications like advanced elevator systems and on-demand shared mobility, where passengers heading to the same destination can share a ride. However, in many real-world scenarios, the vehicle capacities are small and constraining, which calls for a deeper exploration of the Israeli queue with a capacitated server (IQCS). In this paper, we formally define the IQCS and address the challenges of creating a mathematically tractable model to represent it. To approximate the IQCS, we develop a quasi-birth-death process and derive approximations for key performance measures. To validate our approach, we implement a simulation model and use it to compare the IQCS, the approximate model, and the original Israeli Queue. Our results across various scenarios demonstrate the accuracy of the approximate model. Nonetheless, the presence of a remaining gap underscores the ongoing challenge of precisely and efficiently modeling the IQCS, posing an open question for the research community.
- 6 October 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 344 (1) , 267-285
Open AccessThe Israeli queue with a capacitated server: modeling and approximations
The Israeli Queue is a batch service polling system where a single server attends to multiple queues based on seniority. Each arriving customer belongs to one of several classes. Upon arrival, a customer either joins an existing queue for their class or initiates a new queue if they are the first of their class to arrive. Customers from the class with the most senior member are served together as a batch, with the service time remaining constant regardless of the batch size. This service model is found in applications like advanced elevator systems and on-demand shared mobility, where passengers heading to the same destination can share a ride. However, in many real-world scenarios, the vehicle capacities are small and constraining, which calls for a deeper exploration of the Israeli queue with a capacitated server (IQCS). In this paper, we formally define the IQCS and address the challenges of creating a mathematically tractable model to represent it. To approximate the IQCS, we develop a quasi-birth-death process and derive approximations for key performance measures. To validate our approach, we implement a simulation model and use it to compare the IQCS, the approximate model, and the original Israeli Queue. Our results across various scenarios demonstrate the accuracy of the approximate model. Nonetheless, the presence of a remaining gap underscores the ongoing challenge of precisely and efficiently modeling the IQCS, posing an open question for the research community.
- 23 February 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
A ride time-oriented scheduling algorithm for dial-a-ride problems
- 23 February 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
A ride time-oriented scheduling algorithm for dial-a-ride problems
- Open Access
- 23 August 2023
- Published by SAGE Publications in Journal of Sports Analytics
- Vol. 9 (3) , 245-259
Decision making for basketball clutch shots: A data driven approach
Decision making is considered one of the most important aspects for winning a basketball game. In the final minutes of the game (clutch time), these decisions become even more crucial. In particular –who shall take the final, game-winning shots? While some coaches believe it is the team’s star, others may prefer the ‘clutch’ player (who seemingly performs better in clutch time), or the ‘hot’ player who was having a great game that night. In this work we study policy making in clutch minutes. Specifically, we introduce different policies for choosing the shot-taker (for example, according to field goal percentage). Then, we compare the policies and rank them to create a policy hierarchy, which serves as a decision guide for the coach. We show that when our recommendations are implemented (i.e., the highest ranked player takes the shot) the success rate is significantly greater: 51.2%, compared to 41.3% in commonly taken clutch shots. Furthermore, our results indicate that players who excelled in past clutch shots are more likely to succeed, independently to their performance in the current game.
- 23 August 2023
- Published by SAGE Publications in Journal of Sports Analytics
- Vol. 9 (3) , 245-259
Open AccessDecision making for basketball clutch shots: A data driven approach
Decision making is considered one of the most important aspects for winning a basketball game. In the final minutes of the game (clutch time), these decisions become even more crucial. In particular –who shall take the final, game-winning shots? While some coaches believe it is the team’s star, others may prefer the ‘clutch’ player (who seemingly performs better in clutch time), or the ‘hot’ player who was having a great game that night. In this work we study policy making in clutch minutes. Specifically, we introduce different policies for choosing the shot-taker (for example, according to field goal percentage). Then, we compare the policies and rank them to create a policy hierarchy, which serves as a decision guide for the coach. We show that when our recommendations are implemented (i.e., the highest ranked player takes the shot) the success rate is significantly greater: 51.2%, compared to 41.3% in commonly taken clutch shots. Furthermore, our results indicate that players who excelled in past clutch shots are more likely to succeed, independently to their performance in the current game.
- 1 May 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 57 (3) , 594-612
The Electric Dial-a-Ride Problem on a Fixed Circuit
Shared mobility services involving electric autonomous shuttles have increasingly been implemented in recent years. Because of various restrictions, these services are currently offered on fixed circuits and operated with fixed schedules. This study introduces a service variant with flexible stopping patterns and schedules. Specifically, in the electric dial-a-ride problem on a fixed circuit (eDARP-FC), a fleet of capacitated electric shuttles operates on a given circuit consisting of a recharging depot and a sequence of stations where passengers can be picked up and dropped off. The shuttles may perform multiple laps, between which they may need to recharge. The goal of the problem is to determine the vehicles’ stopping sequences and schedules, including recharging plans, so as to minimize a weighted sum of the total passenger excess time and the total number of laps. The eDARP-FC is formulated as a nonstandard lap-based mixed integer linear programming and is shown to be NP-Hard. Efficient polynomial time algorithms are devised for two special scheduling subproblems. These algorithms and several heuristics are then applied as subroutines within a large neighborhood search metaheuristic. Experiments on instances derived from a real-life system demonstrate that the flexible service results in a 32%–75% decrease in the excess time at the same operational costs. Funding: This work was supported by the Fonds Wetenschappelijk Onderzoek [Project Data-Driven Logistics: Grant S007318N; Project Optimizing the Design of a Hybrid Urban Mobility System: Grant G020222N; and Grant OR4Logistics]. Y. Molenbruch is partially funded by the Fonds Wetenschappelijk Onderzoek [Grant 1202719N]. The computational resources and services used in this work were provided by the Flemish Supercomputer Center funded by the Fonds Wetenschappelijk Onderzoek and the Flemish Government. Supplemental Material: The electronic companion is available at https://doi.org/10.1287/trsc.2023.1208 .
- 1 May 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 57 (3) , 594-612
The Electric Dial-a-Ride Problem on a Fixed Circuit
Shared mobility services involving electric autonomous shuttles have increasingly been implemented in recent years. Because of various restrictions, these services are currently offered on fixed circuits and operated with fixed schedules. This study introduces a service variant with flexible stopping patterns and schedules. Specifically, in the electric dial-a-ride problem on a fixed circuit (eDARP-FC), a fleet of capacitated electric shuttles operates on a given circuit consisting of a recharging depot and a sequence of stations where passengers can be picked up and dropped off. The shuttles may perform multiple laps, between which they may need to recharge. The goal of the problem is to determine the vehicles’ stopping sequences and schedules, including recharging plans, so as to minimize a weighted sum of the total passenger excess time and the total number of laps. The eDARP-FC is formulated as a nonstandard lap-based mixed integer linear programming and is shown to be NP-Hard. Efficient polynomial time algorithms are devised for two special scheduling subproblems. These algorithms and several heuristics are then applied as subroutines within a large neighborhood search metaheuristic. Experiments on instances derived from a real-life system demonstrate that the flexible service results in a 32%–75% decrease in the excess time at the same operational costs. Funding: This work was supported by the Fonds Wetenschappelijk Onderzoek [Project Data-Driven Logistics: Grant S007318N; Project Optimizing the Design of a Hybrid Urban Mobility System: Grant G020222N; and Grant OR4Logistics]. Y. Molenbruch is partially funded by the Fonds Wetenschappelijk Onderzoek [Grant 1202719N]. The computational resources and services used in this work were provided by the Flemish Supercomputer Center funded by the Fonds Wetenschappelijk Onderzoek and the Flemish Government. Supplemental Material: The electronic companion is available at https://doi.org/10.1287/trsc.2023.1208 .
- Open Access
A ride time-oriented scheduling algorithm for dial-a-ride problems
This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theory, aims at finding minimal user ride time schedules in polynomial time. The algorithm can either return optimal feasible routes or it can return incorrect infeasibility declarations, on which feasibility can be recovered through a specifically-designed heuristic. The algorithm is furthermore supplemented by a battery management algorithm that can be used to determine charging decisions for electric and autonomous vehicle fleets. Timing solutions from the proposed scheduling algorithm are obtained on millions of routes extracted from DARP and e-ADARP benchmark instances. They are compared to those obtained from a linear program, as well as to popular scheduling procedures from the DARP literature. Results show that the proposed procedure outperforms state-of-the-art scheduling algorithms, both in terms of compute-efficiency and solution quality.
Open AccessA ride time-oriented scheduling algorithm for dial-a-ride problems
This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theory, aims at finding minimal user ride time schedules in polynomial time. The algorithm can either return optimal feasible routes or it can return incorrect infeasibility declarations, on which feasibility can be recovered through a specifically-designed heuristic. The algorithm is furthermore supplemented by a battery management algorithm that can be used to determine charging decisions for electric and autonomous vehicle fleets. Timing solutions from the proposed scheduling algorithm are obtained on millions of routes extracted from DARP and e-ADARP benchmark instances. They are compared to those obtained from a linear program, as well as to popular scheduling procedures from the DARP literature. Results show that the proposed procedure outperforms state-of-the-art scheduling algorithms, both in terms of compute-efficiency and solution quality.