Results 31 to 40 of about 59,736 (194)
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
Algorithms, 2019 The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules.
Slim Belhaiza
doaj +1 more source
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights [PDF]
, 2014 In the Steiner k-Forest problem we are given an edge weighted graph, a collection D of node pairs, and an integer k leq |D|. The goal is to find a minimum cost subgraph that connects at least k pairs.
Dinitz, Michael +2 more
core +1 more source
The Dial-a-Ride Problem with Split Requests and Profits [PDF]
Transportation Science, 2015 In this paper we introduce the dial-a-ride problem with split requests and profits (DARPSRP). Users place transportation requests, specifying a pickup location, a delivery location, and a time window for either of the two. Based on maximum user ride time considerations, the second time window is generated.
Sophie N. Parragh +2 more
openaire +2 more sources
Comparison of anticipatory algorithms for a dial-a-ride problem
European Journal of Operational Research, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ulrike Ritzinger +3 more
openaire +2 more sources
The Dial-a-Ride Problem with School Bell Time Adjustment
Transportation Science, 2023 In this paper, we study a paratransit application in which children are transported every day from their homes to their special schools or medical-social establishments. To optimize this transportation system, the establishments collaborate to propose a joint transportation plan.
Vercraene, Samuel +3 more
openaire +3 more sources
A tight formulation for the dial-a-ride problem
European Journal of Operational ResearchRidepooling services play an increasingly important role in modern transportation systems. With soaring demand and growing fleet sizes, the underlying route planning problems become increasingly challenging. In this context, we consider the dial-a-ride problem (DARP): Given a set of transportation requests with pick-up and delivery locations, passenger
Daniela Gaul +4 more
openaire +2 more sources
How FDI reshapes host markets’ trade profile and politics
American Journal of Political Science, EarlyView.Abstract A fast‐growing literature indicates that firms’ engagement in foreign direct investment (FDI) and trade is key to understanding deepening global value chains and their political implications. However, existing studies have mainly focused on the ramifications for FDI home countries while often overlooking the firm‐product level interactions ...
In Song Kim, Steven Liao, Sayumi Miyano
wiley +1 more source
Networks, Volume 87, Issue 2, Page 111-130, March 2026.ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum +2 more
wiley +1 more source
Maximizing Revenues for Online-Dial-a-Ride
, 2013 In the classic Dial-a-Ride Problem, a server travels in some metric space to serve requests for rides. Each request has a source, destination, and release time.
B Broden +9 more
core +1 more source
Innovative systems for the transportation disadvantaged: towards more efficient and operationally usable planning tools [PDF]
, 2004 When considering innovative forms of public transport for specific groups, such as demand responsive services, the challenge is to find a good balance between operational efficiency and 'user friendliness' of the scheduling algorithm even when ...
Diana, Marco
core +1 more source