Results 71 to 80 of about 888 (166)

Out of Sync? Rare Genetic Disease and the Chronopolitics of Care

open access: yesSociology of Health &Illness, Volume 47, Issue 8, November 2025.
ABSTRACT Drawing on the experiences of parents of children diagnosed with Noonan Syndrome, I examine how living in and between multiple temporalities of care impacts parents’ sense of temporal autonomy and social inclusion. Employing the concept of ‘crip time’, I connect everyday choreographies of care with their temporal politics to analyse the ...
Catherine Coveney
wiley   +1 more source

Improved Approximations for Dial-a-Ride Problems

open access: yesCoRR
The multi-vehicle dial-a-ride problem (mDaRP) is a fundamental vehicle routing problem with pickups and deliveries, widely applicable in ride-sharing, economics, and transportation. Given a set of $n$ locations, $h$ vehicles of identical capacity $λ$ located at various depots, and $m$ ride requests each defined by a source and a destination, the goal ...
Jingyang Zhao 0001, Mingyu Xiao 0001
openaire   +2 more sources

Social beneficence

open access: yesPhilosophy and Phenomenological Research, Volume 111, Issue 3, Page 773-795, November 2025.
Abstract A background assumption in much contemporary political philosophy is that justice is the first virtue of social institutions, taking priority over other values such as beneficence. This assumption is typically treated as a methodological starting point, rather than as following from any particular moral or political theory.
Jacob Barrett
wiley   +1 more source

Precedence‐Constrained Shortest Path

open access: yesNetworks, Volume 86, Issue 3, Page 282-295, October 2025.
ABSTRACT We propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs (a,b)$$ \left(a,b\right) $$ which indicate that a vertex a$$ a $$ is the predecessor of a vertex b$$ b $$.
Christina Büsing   +2 more
wiley   +1 more source

Autonomous Ride-Sharing Service Using Graph Embedding and Dial-a-Ride Problem: Application to the Last-Mile Transit in Lyon City

open access: yesMathematics
Autonomous vehicles are anticipated to revolutionize ride-sharing services and subsequently enhance the public transportation systems through a first–last-mile transit service.
Omar Rifki
doaj   +1 more source

Revenue Maximization in Online Dial-A-Ride.

open access: yes, 2017
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server's goal is to maximize its total revenue within a given time limit, T. We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem.
Christman, Ananya   +5 more
openaire   +3 more sources

The electric autonomous dial-a-ride problem

open access: yes, 2020
This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a-Ride Problem (e-ADARP), and includes battery management and autonomous aspects along with classic
openaire   +1 more source

Enhancing Service Quality of On-Demand Transportation Systems Using a Hybrid Approach with Customized Heuristics

open access: yesSmart Cities
As customers’ expectations continue to rise, advanced on-demand transport services face the challenge of meeting new requirements. This study addresses a specific transportation issue belonging to dial-a-ride problems, including constraints aimed at ...
Sonia Nasri   +2 more
doaj   +1 more source

The Laugh of the Tramp

open access: yes
Critical Quarterly, Volume 67, Issue 4, Page 17-31, December 2025.
Damian Maher
wiley   +1 more source

The Line-Based Dial-a-Ride Problem

open access: yes
20 pages, 5 figures, to be published in OASIcs, Volume 123, ATMOS ...
Kendra Reiter   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy