Results 51 to 60 of about 59,736 (194)
On-line single-server dial-a-ride problems
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feuerstein, E., Stougie, L.
openaire +4 more sources
Regulation &Governance, Volume 20, Issue 1, Page 35-63, January 2026.ABSTRACT Existing literature largely agrees that authoritarian regimes establish channels for political participation to gather valuable information on citizens' anti‐regime sentiments and policy preferences and to supervise lower‐level bureaucrats and firms.
Anton Bogs
wiley +1 more source
International Journal of Energy Research, Volume 2026, Issue 1, 2026.This paper presents a new two‐stage protection strategy for active distribution networks that not only addresses selectivity constraints along protected lines but also incorporates fault‐ride‐through (FRT) requirements of inverter‐based distributed energy resources (IBDERs). The proposed coordination strategy (PCS), which distinguishes it from previous
Amin Yazdaninejadi +4 more
wiley +1 more source
Optimizing Patient Transport under Infection Control Constraints: A Milp-Based Dial-a-Ride Approach
CommunicationsWith aging populations and rising healthcare demands, efficient patient transportation has become a critical challenge, particularly in the context of infection control. In this paper is presented an extended mixed-integer linear programming (MILP) model
Martin Tóth +2 more
doaj +1 more source
, 2006 The operation of a demand responsive transport service usually involves the management of dynamic requests. The underlying algorithms are mainly adaptations of procedures carefully designed to solve static versions of the problem, in which all the ...
Colorni +24 more
core +1 more source
Philosophy 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
Extension of Biased Random-Key Genetic Algorithm With Q-Learning for Dial-a-Ride Problem
IEEE AccessWith the widespread adoption of delivery services and advancements in autonomous driving technology, route optimization problems are being intensively studied.
Takuto Shimaoka +3 more
doaj +1 more source
Insertion techniques and constraint propagation for the DARP [PDF]
, 2012 International audienceThis paper deals with the Dial and Ride Problem (DARP), while using randomized greedy insertion techniques together with constraint propagation techniques. Though it focuses here on the static version of Dial and Ride, it takes into
Deleplanque, Samuel, Quilliot, Alain
core +1 more source
The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem [PDF]
, 2013 In this paper, a dynamic nearest neighbor (DNN) policy is proposed for operating a fleet of vehicles to serve customers, who place calls in a Euclidean service area according to a Poisson process.
Balcioglu, Ahmet Baris +6 more
core +1 more source
Precedence‐Constrained Shortest Path
Networks, 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