| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 198 | Kousuke Shinoda, Itsuki Noda, Masayuki Ohta, Yoichiro Kumada, Hideyuki Nakashima |
Is Dial-a-Ride Bus Reasonable in Large Scale Towns? Evaluation of Usability of Dial-a-Ride Systems by Simulation.  |
MAMUS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 194 | Inge Li Gørtz, Viswanath Nagarajan, R. Ravi 0001 |
Minimum Makespan Multi-vehicle Dial-a-Ride. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 186 | Moses Charikar, Balaji Raghavachari |
The Finite Capacity Dial-A-Ride Problem. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
dial-a-ride, stacker crane, probabilistic approximation of metric spaces, algorithm, routing, approximation, capacity, vehicle, delivery, tree metric |
| 171 | Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie |
On-Line Dial-a-Ride Problems Under a Restricted Information Model. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
On-line optimization, Dial-a-ride, Competitive analysis |
| 167 | Anupam Gupta 0001, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi 0001 |
Dial a Ride from k -Forest. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 167 | Itsuki Noda |
Scalability of Dial-a-Ride Systems-A Case Study to Assess Utilities of Ubiquitous Mass User Support. |
MMAS |
2004 |
DBLP DOI BibTeX RDF |
|
| 167 | Itsuki Noda, Masayuki Ohta, Kousuke Shinoda, Yoichiro Kumada, Hideyuki Nakashima |
Evaluation of Usability of Dial-a-Ride Systems by Social Simulation. |
MABS |
2003 |
DBLP DOI BibTeX RDF |
|
| 125 | Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie |
On-Line Dial-a-Ride Problems under a Restricted Information Model. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 112 | Itsuki Noda, Masayuki Ohta, Yoichiro Kumada, Kousuke Shinoda, Hideyuki Nakashima |
Usability of dial-a-ride systems. |
AAMAS |
2005 |
DBLP DOI BibTeX RDF |
|
| 112 | Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau |
The Online Dial-a-Ride Problem under Reasonable Load. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 104 | Jean-François Cordeau, Gilbert Laporte |
The dial-a-ride problem: models and algorithms. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
Dial-a-ride problem, Static and dynamic pickup and delivery problems, Survey |
| 104 | Broderick Crawford, Carlos Castro 0001, Éric Monfroy |
Solving Dial-a-Ride Problems with a Low-Level Hybridization of Ants and Constraint Programming. |
IWINAC (2) |
2007 |
DBLP DOI BibTeX RDF |
Dial-a-ride Problem, Ant Colony Optimization, Constraint Programming, Hybrid Algorithm, Set Partitioning |
| 104 | Broderick Crawford, Carlos Castro 0001, Éric Monfroy, Claudio Cubillos |
Decomposition Approach to Solve Dial-a-Ride Problems Using Ant Computing and Constraint Programming. |
BVAI |
2007 |
DBLP DOI BibTeX RDF |
Dial-A-Ride Problem, Ant Colony Optimization, Constraint Programming |
| 104 | Jean-François Cordeau, Gilbert Laporte |
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. |
4OR |
2003 |
DBLP DOI BibTeX RDF |
dial-a-ride problem, static and dynamic pick-up and delivery problems, survey |
| 85 | Inge Li Gørtz |
Hardness of Preemptive Finite Capacity Dial-a-Ride. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 71 | Fanglei Yi, Yinfeng Xu, Chunlin Xin |
Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
| 58 | Roberto Wolfler Calvo, Alberto Colorni |
An effective and fast heuristic for the Dial-a-Ride problem. |
4OR |
2007 |
DBLP DOI BibTeX RDF |
90C59, 90C11, MSC classification 90B06 |
| 58 | Anke Fabri, Peter Recht |
Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors. |
OR |
2006 |
DBLP DOI BibTeX RDF |
|
| 58 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Hard Dial-a-Ride Problem that is Easy on Average. |
J. Sched. |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithm, NP-hard, average-case analysis |
| 58 | Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie |
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 58 | Fanglei Yi, Lei Tian |
On the Online Dial-A-Ride Problem with Time-Windows. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
|
| 58 | Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau |
Online Dial-a-Ride Problems: Minimizing the Completion Time. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 46 | Kota Tsubouchi, Kazuo Hiekata, Hiroyuki Yamato |
Scheduling Algorithm for On-Demand Bus System. |
ITNG |
2009 |
DBLP DOI BibTeX RDF |
On-line Dial-A-Ride Problem with Time Window, On-demand Bus |
| 46 | Manar Ibrahim Hosny 0001, Christine L. Mumford |
Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators. |
GECCO (Companion) |
2007 |
DBLP DOI BibTeX RDF |
dial-a-ride, pickup and delivery with time windows, genetic algorithms, vehicle routing |
| 44 | Janka Chlebíková, Clément Dallard, Niklas Paulsen |
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
| 44 | Christian Pfeiffer, Arne Schulz |
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization. |
OR Spectr. |
2022 |
DBLP DOI BibTeX RDF |
|
| 44 | Claudia Bongiovanni, Nikolas Geroliminis, Mor Kaspi |
A ride time-oriented scheduling algorithm for dial-a-ride problems. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 44 | Douglas Oliveira Santos, Eduardo C. Xavier |
Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive. |
Expert Syst. Appl. |
2015 |
DBLP DOI BibTeX RDF |
|
| 31 | Chijia Liu, Alain Quilliot, Hélène Toussaint, Dominique Feillet |
A Guided Insertion Mechanism for Solving the Dynamic Large-Scale Dial-a-Ride Problem. |
INOC |
2024 |
DBLP DOI BibTeX RDF |
|
| 31 | Alexander Birx, Yann Disser, Kevin Schewior |
Improved Bounds for Open Online Dial-a-Ride on the Line. |
Algorithmica |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer, Arne Schulz, Michael Stiglmayr |
A Tight Formulation for the Dial-a-Ride Problem. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo |
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. (PDF / PS) |
Proc. VLDB Endow. |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Mourad Baïou, Rafael Colares, Hervé Kerivin |
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Yue Su, Nicolas Dupin, Jakob Puchinger |
A deterministic annealing local search for the electric autonomous dial-a-ride problem. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit 0001, Haya Brama |
Graph representation of the fixed route dial-a-ride problem. |
J. Sched. |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Yves Molenbruch, Kris Braekers, Ohad Eisenhandler, Mor Kaspi |
The Electric Dial-a-Ride Problem on a Fixed Circuit. |
Transp. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Samuel Vercraene, Fabien Lehuédé, Thibaud Monteiro, Olivier Péton |
The Dial-a-Ride Problem with School Bell Time Adjustment. |
Transp. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Chijia Liu, Alain Quilliot, Hélène Toussaint, Dominique Feillet |
A Filtering System for the Large-Scale Dial-A-Ride Problem With Shared Autonomous Vehicles. |
SoICT |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker |
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. |
WADS |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Grzegorz Gutowski, Grzegorz Herman |
Long-Distance Directional Dial-a-Ride Problems. |
VEHITS |
2023 |
DBLP DOI BibTeX RDF |
|
| 31 | Sezgi Tekil-Ergün, Erwin Pesch, Katarzyna Anna Kuzmicz |
Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation. |
Int. J. Prod. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Jingyi Zhao, Mark Poon, Zhenzhen Zhang, Ruixue Gu |
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem. |
Comput. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Yannik Rist, Michael A. Forbes 0002 |
A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem. |
Comput. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Cleder M. Schenekemberg, Antonio Augusto Chaves, Leandro C. Coelho, Thiago A. Guimarães, Geraldo Avelino |
The dial-a-ride problem with private fleet and common carrier. |
Comput. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Lissa Melis, Kenneth Sörensen |
The static on-demand bus routing problem: large neighborhood search for a dial-a-ride problem with bus station assignment. |
Int. Trans. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | André L. S. Souza, Marcella Bernardo, Puca Huachi Vaz Penna, Jürgen Pannek, Marcone J. F. Souza |
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects. |
Optim. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Zhexi Fu, Joseph Y. J. Chow |
Dial-a-ride problem with modular platooning and en-route transfers. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo |
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker |
An Improved Algorithm for Open Online Dial-a-Ride. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Júlia Baligács, Yann Disser, David Weckbecker |
Tight analysis of lazy: an improved algorithm for open online dial-a-ride. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Ulrike Ritzinger, Jakob Puchinger, Christian Rudloff, Richard F. Hartl |
Comparison of anticipatory algorithms for a dial-a-ride problem. |
Eur. J. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Lennart Christian Johnsen, Frank Meisel |
Interrelated trips in the rural dial-a-ride problem with autonomous vehicles. |
Eur. J. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Chang Lu, Yuehui Wu, Shanchuan Yu |
A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction. |
Eur. J. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Sunil Morapitiye, Tamás Kis |
Strong cuts from compatibility relations for the Dial-a-Ride Problem. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Oscar Tellez, Samuel Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro |
The time-consistent dial-a-ride problem. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Christoph Grüne, Stephan Zieger |
Solving the Dial-a-Ride Problem for Railway Traffic by Means of Heuristics. |
SMARTGREENS/VEHITS (Selected Papers) |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker |
An Improved Algorithm for Open Online Dial-a-Ride. |
WAOA |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Jiayuan Li, Kohji Tomita, Akiya Kamimura |
A Novel Genetic Algorithm for a Multi-Vehicle Dial-a-Ride Problem. |
ICARM |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Slim Belhaiza, Rym M'Hallah, Munirah Al-Qarni |
A Data-Driven Forecasting and Solution Approach for the Dial-A-Ride Problem with Time Windows. |
SSCI |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Martin Aleksandrov, Philip Kilby |
Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences. |
AI |
2022 |
DBLP DOI BibTeX RDF |
|
| 31 | Andy Ham |
Dial-a-Ride Problem With Meeting Point Feature Known-as Express-Pool. |
IEEE Access |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Igor Malheiros, Rodrigo Ramalho, Bruno Passeti, Teobaldo Bulhões, Anand Subramanian 0001 |
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem. |
Comput. Oper. Res. |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Minshi Chen, Jianxun Chen, Peng Yang 0008, Shengcai Liu, Ke Tang 0001 |
A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking. |
Multim. Tools Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Ramesh Ramasamy Pandi, Songguang Ho, Sarat Chandra Nagavarapu, Justin Dauwels |
A Generic GPU-Accelerated Framework for the Dial-A-Ride Problem. |
IEEE Trans. Intell. Transp. Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Jacopo Pierotti, J. Theresia van Essen |
MILP models for the Dial-a-ride problem with transfers. |
EURO J. Transp. Logist. |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Ananya D. Christman, Christine Chung 0001, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen |
Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride. |
Oper. Res. Forum |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Yannik Rist, Michael A. Forbes 0002 |
A New Formulation for the Dial-a-Ride Problem. |
Transp. Sci. |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr |
Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. |
ATMOS |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Barbara M. Anthony, Ananya D. Christman, Christine Chung 0001, David S. Yuen |
Serving Rides of Equal Importance for Time-Limited Dial-a-Ride. |
MOTOR |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Sonia Nasri, Hend Bouziri, Wassila Aggoune-Mtalaa |
A new hybrid evolutionary algorithm for dial-a-ride problems. |
GECCO Companion |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Qinrui Tang, Maria Giuliana Armellini |
An ant colony algorithm with penalties for the dial-a-ride problem with time windows and capacity restriction. |
MT-ITS |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Konstantinos Gkiotsalitis |
The Dial-A-Ride Problem considering the in-vehicle crowding inconvenience due to COVID-19. |
ITSC |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Christian Ackermann, Julia Rieck |
New Optimization Guidance for Dynamic Dial-a-Ride Problems. |
OR |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Claudio Arbib, Fatemeh K. Ranjbar, Stefano Smriglio |
A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab. |
ICORES |
2021 |
DBLP BibTeX RDF |
|
| 31 | Stjepan Zelic, Marko Durasevic, Domagoj Jakobovic, Lucija Planinic |
Solving the Dial-a-Ride Problem Using an Adapted Genetic Algorithm. |
AI*IA |
2021 |
DBLP DOI BibTeX RDF |
|
| 31 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. |
SIAM J. Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Tai-Yu Ma |
Optimal charging scheduling for dynamic dial-a-ride services using electric vehicles. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 31 | Sven Vallée, Ammar Oulamara, Wahiba Ramdane Chérif-Khettaf |
New online reinsertion approaches for a dynamic Dial-a-Ride Problem. |
J. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Célia Paquay, Yves Crama, Thierry Pironet |
Recovery management for a dial-a-ride system with real-time disruptions. |
Eur. J. Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Ramesh Ramasamy Pandi, Songguang Ho, Sarat Chandra Nagavarapu, Twinkle Tripathy, Justin Dauwels |
Disruption Management for Dial-A-Ride Systems. |
IEEE Intell. Transp. Syst. Mag. |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Mohamed Amine Masmoudi, Manar Hosny 0001, Emrah Demir, Erwin Pesch |
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. |
J. Heuristics |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Alba Assis Campos, André Renato Sales Amaral |
An Iterated Local Search for the Multi-objective Dial-a-Ride Problem. |
ISDA |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Pedro M. M. Guerreiro, Pedro J. S. Cardoso, Hortênsio C. L. Fernandes |
A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem. |
ICCS (7) |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Ananya Christman, Christine Chung 0001, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen |
New Bounds for Maximizing Revenue in Online Dial-a-Ride. |
IWOCA |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Saïd Hammouda, Mokhtar Taffar, Ali Lemouari |
A Simulated Annealing for The Resolution of "Dial-A-Ride-Problem with Transfer" Using Hybrid Neighborhood Methods. |
ICECOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 31 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 31 | Ananya Christman, Christine Chung 0001, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu |
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 31 | Slim Belhaiza |
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem. |
Algorithms |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Timo Gschwind, Michael Drexl |
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem. |
Transp. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Zhixing Luo, Mengyang Liu, Andrew Lim 0001 |
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation. |
Transp. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | André Luyde S. Souza, Jonatas B. C. Chagas, Puca Huachi Vaz Penna, Marcone J. F. Souza |
A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem. |
ICVNS |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Barbara M. Anthony, Ricky Birnbaum, Sara Boyd, Ananya Christman, Christine Chung 0001, Patrick Davis, Jigar Dhimar, David S. Yuen |
Maximizing the Number of Rides Served for Dial-a-Ride. |
ATMOS |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Mehdi Abedi, Raymond Chiong, Rukshan Athauda, Hany Seidgar, Zbigniew Michalewicz, Andrew Sturt |
A Regional Multi-Objective Tabu Search Algorithm for a Green Heterogeneous Dial-A-Ride Problem. |
CEC |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Ramesh Ramasamy Pandi, Songguang Ho, Sarat Chandra Nagavarapu, Justin Dauwels |
Adaptive Algorithm for Dial-A-Ride Problem with Vehicle Breakdown. |
ECC |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Sven Vallée, Ammar Oulamara, Wahiba Ramdane Chérif-Khettaf |
Reinsertion Algorithm Based on Destroy and Repair Operators for Dynamic Dial a Ride Problems. |
ICCS (1) |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Pedro M. M. Guerreiro, Pedro J. S. Cardoso, Hortênsio C. L. Fernandes |
Applying NSGA-II to a Multiple Objective Dial a Ride Problem. |
ICCS (5) |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Sevket Gökay, Andreas Heuvels, Karl-Heinz Krempels |
A High-level Category Survey of Dial-a-Ride Problems. |
VEHITS |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Alexander Birx, Yann Disser, Kevin Schewior |
Improved Bounds for Open Online Dial-a-Ride on the Line. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 31 | Fabian Feitsch, Sabine Storandt |
The Clustered Dial-a-Ride Problem. |
ICAPS |
2019 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license