PulseAugur
EN
LIVE 08:15:39
ENTITY Dial-a-Ride Problem

Dial-a-Ride Problem

PulseAugur coverage of Dial-a-Ride Problem — every cluster mentioning Dial-a-Ride Problem across labs, papers, and developer communities, ranked by signal.

Show in brief
Total · 30d
2
2 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
2
2 over 90d
TIER MIX · 90D
TOPICS
SENTIMENT · 30D

1 day(s) with sentiment data

RECENT · PAGE 1/1 · 2 TOTAL
  1. TOOL · CL_363827 ·

    New algorithm improves competitive ratio for traveling repairperson problem

    Researchers have developed a new deterministic algorithm for the online traveling repairperson problem, achieving a competitive ratio of 3.877 for arbitrary metrics. This improves upon the previous state-of-the-art 4-co…

  2. TOOL · CL_282191 ·

    AI-driven methods tested for autonomous ride-sharing under uncertainty

    A new research paper explores adaptive operator selection methods for solving the electric autonomous dial-a-ride problem (EADARP) under uncertainty. The study focuses on a bilevel large neighborhood search framework, c…