Publications by Mor Kaspi | EPFL Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

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 theor ...

Pergamon-Elsevier Science Ltd2024

A predictive large neighborhood search for the dynamic electric autonomous dial-a-ride problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

The dynamic electric autonomous Dial-a-Ride Problem (e-ADARP) is a generalization ofthe dial-a-ride problem which employs electric Autonomous Vehicles (e-AVs) to provide sharedrides to on-line requests. The goal of the dynamic e-ADARP is to maximize the nu ...

2020

The electric autonomous dial-a-ride problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provides shared-ride services to users specifying their origin, destination, and preferred arrival time. Typically, the problem consists of finding minimum cost routes, satisfying operational constraint ...

Elsevier2019

Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations

Nikolaos Geroliminis, Burak Boyaci, Martin Jean Marie Joseph Repoux, Mor Kaspi

In this paper, we study the operations of a one-way station-based carsharing system implementing a complete journey reservation policy. We consider the percentage of served demand as a primary performance measure and analyze the effect of several dynamic s ...

PERGAMON-ELSEVIER SCIENCE LTD2019

Predictive dynamic relocations in carsharing systems implementing journey reservations

Nikolaos Geroliminis, Burak Boyaci, Martin Jean Marie Joseph Repoux, Mor Kaspi

2019

A Two Phase Heuristic Approach For The Dynamic Electric Autonomous Dial-a-Ride Problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provide shared-ride services to users specifying their origin, destination, and preferred arrival time. In the dynamic version of the DARP, some trips are booked in advance while others come in real-tim ...

2018

Mor Kaspi

Graph Chatbot

A ride time-oriented scheduling algorithm for dial-a-ride problems

A predictive large neighborhood search for the dynamic electric autonomous dial-a-ride problem

The electric autonomous dial-a-ride problem

Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations

Predictive dynamic relocations in carsharing systems implementing journey reservations

A Two Phase Heuristic Approach For The Dynamic Electric Autonomous Dial-a-Ride Problem

On-line proactive relocation and regulation strategies for one-way station-based car-sharing systems

Operations of An Innovative Last-Kilometer Transportation System

The Electric Autonomous Dial-a-Ride Problem

The Electric Autonomous Dial-a-Ride Problem

A ride time-oriented scheduling algorithm for dial-a-ride problems

A predictive large neighborhood search for the dynamic electric autonomous dial-a-ride problem

The electric autonomous dial-a-ride problem

Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations

Predictive dynamic relocations in carsharing systems implementing journey reservations

Operations of An Innovative Last-Kilometer Transportation System

A Two Phase Heuristic Approach For The Dynamic Electric Autonomous Dial-a-Ride Problem

On-line proactive relocation and regulation strategies for one-way station-based car-sharing systems

The Electric Autonomous Dial-a-Ride Problem

The Electric Autonomous Dial-a-Ride Problem