Add to ORKGSIGLECNRS RP 251 (337) / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
In a Dial-a-Ride system, a fleet of vehicles without fixed routes and schedules carries people from ...
The dynamic electric autonomous dial-a-ride problem (e-ADARP) is an extended version of the traditio...
This research studies a static and real-time dial-a-ride problem with time varying travel times, sof...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
International audienceThe organization of a specialized transportation system to perform transports ...
The dial-a-ride problem (DARP) is a widely studied theoretical challenge related to dispatching vehi...
Dynamic programming algorithm for the vehicle routing problem with time windows and EC social legisl...
This work deals with the optimization of the routes for a Dial-a-Ride Transportation System (DRTS), ...
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilite ́ ...
International audienceThis paper presents a heuristic, which concentrates on solving a large-scale s...
International audienceThe paper describes a system for the solution of Dial a Ride Problem (DRP). Di...
International audienceThe Dial-a-Ride Problem is a variant of the pickup and delivery problem with t...
Le Problème de Transport à la Demande (PTD), consiste à prendre en charge le transport des personnes...
International audienceThe Dial-a-Ride Problem (DARP) models an operation research problem related to...
This article provides an overview of state-of-the-art technologies relevant to dynamic transportatio...
In a Dial-a-Ride system, a fleet of vehicles without fixed routes and schedules carries people from ...
The dynamic electric autonomous dial-a-ride problem (e-ADARP) is an extended version of the traditio...
This research studies a static and real-time dial-a-ride problem with time varying travel times, sof...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
International audienceThe organization of a specialized transportation system to perform transports ...
The dial-a-ride problem (DARP) is a widely studied theoretical challenge related to dispatching vehi...
Dynamic programming algorithm for the vehicle routing problem with time windows and EC social legisl...
This work deals with the optimization of the routes for a Dial-a-Ride Transportation System (DRTS), ...
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilite ́ ...
International audienceThis paper presents a heuristic, which concentrates on solving a large-scale s...
International audienceThe paper describes a system for the solution of Dial a Ride Problem (DRP). Di...
International audienceThe Dial-a-Ride Problem is a variant of the pickup and delivery problem with t...
Le Problème de Transport à la Demande (PTD), consiste à prendre en charge le transport des personnes...
International audienceThe Dial-a-Ride Problem (DARP) models an operation research problem related to...
This article provides an overview of state-of-the-art technologies relevant to dynamic transportatio...
In a Dial-a-Ride system, a fleet of vehicles without fixed routes and schedules carries people from ...
The dynamic electric autonomous dial-a-ride problem (e-ADARP) is an extended version of the traditio...
This research studies a static and real-time dial-a-ride problem with time varying travel times, sof...