When demand for transportation is low or highly variable, traditional public bus services tend
to lose their efficiency and typically frustrate (potential) passengers. In the literature, a large …

Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …

Over the past decade, electric vehicles (EVs) have been considered in a growing number of
models and methods for vehicle routing problems (VRPs). This study presents a …

The paper introduces a fixed-path procedure to solve precedence-constrained routing
problems. The procedure can be applied within a branch-and-cut framework to improve the …

The dial-a-ride (DAR) service is a precursor to emerging shared mobility. Service providers
expect efficient management of fleet resources to improve service quality without degrading …

This paper proposes a new mixed integer programming formulation and branch and cut
(BC) algorithm to solve the dial-a-ride problem (DARP). The DARP is a route-planning …

This study addresses a vehicle routing problem (VRP) in which demands are discrete, split
delivery is allowed, service time is proportional to the units of delivered products, multiple …

This paper proposes a Branch-Cut-and-Price (BCP) algorithm to solve an equitable variant
of the Dial-a-Ride problem (DARP), namely Equity-Aware DARP (EDARP), a bi-objective …

In this paper, we consider that a private company has developed a platform to provide
intercity ride-sharing (IRS) services for riders between two cities. The riders between the two …

Ridepooling services require efficient optimization algorithms to simultaneously plan routes
and pool users in shared rides. We consider a static dial-a-ride problem (DARP) where a …