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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MAMUS ![In: Multi-Agent for Mass User Support, International Workshop, MAMUS 2003 Acapulco, Mexico, August 10, 2003 Revised and Invited Papers, pp. 105-119, 2003, Springer, 3-540-21940-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
194 | Inge Li Gørtz, Viswanath Nagarajan, R. Ravi 0001 |
Minimum Makespan Multi-vehicle Dial-a-Ride. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 540-552, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
186 | Moses Charikar, Balaji Raghavachari |
The Finite Capacity Dial-A-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 458-467, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 319-329, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 241-252, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMAS ![In: Massively Multi-Agent Systems I, First International Workshop, MMAS 2004, Kyoto, Japan, December 10-11, 2004, Revised Selected and Invited Papers, pp. 323-334, 2004, Springer, 3-540-26974-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MABS ![In: Multi-Agent-Based Simulation III, 4th International Workshop, MABS 2003, Melbourne, Australia, July 14th, 2003, Revised Papers, pp. 167-181, 2003, Springer, 3-540-20736-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 674-685, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
112 | Itsuki Noda, Masayuki Ohta, Yoichiro Kumada, Kousuke Shinoda, Hideyuki Nakashima |
Usability of dial-a-ride systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The Netherlands, pp. 1281-1282, 2005, ACM, 1-59593-094-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
112 | Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau |
The Online Dial-a-Ride Problem under Reasonable Load. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 125-136, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
104 | Jean-François Cordeau, Gilbert Laporte |
The dial-a-ride problem: models and algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 153(1), pp. 29-46, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWINAC (2) ![In: Nature Inspired Problem-Solving Methods in Knowledge Engineering, Second International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2007, La Manga del Mar Menor, Spain, June 18-21, 2007, Proceedings, Part II, pp. 317-327, 2007, Springer, 978-3-540-73054-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BVAI ![In: Advances in Brain, Vision, and Artificial Intelligence, Second International Symposium, BVAI 2007, Naples, Italy, October 10-12, 2007, Proceedings, pp. 448-457, 2007, Springer, 978-3-540-75554-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 1(2), pp. 89-101, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 200-211, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 22-31, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
58 | Roberto Wolfler Calvo, Alberto Colorni |
An effective and fast heuristic for the Dial-a-Ride problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 5(1), pp. 61-73, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research, Proceedings 2006, Selected Papers of the Annual International Conference of the German Operations ResearchSociety (GOR), Jointly Organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6-8, 2006, pp. 445-450, 2006, 978-3-540-69994-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(3), pp. 197-210, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 258-269, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
58 | Fanglei Yi, Lei Tian |
On the Online Dial-A-Ride Problem with Time-Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 85-94, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
58 | Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau |
Online Dial-a-Ride Problems: Minimizing the Completion Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 639-650, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
46 | Kota Tsubouchi, Kazuo Hiekata, Hiroyuki Yamato |
Scheduling Algorithm for On-Demand Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Sixth International Conference on Information Technology: New Generations, ITNG 2009, Las Vegas, Nevada, USA, 27-29 April 2009, pp. 189-194, 2009, IEEE Computer Society, 978-0-7695-3596-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, Companion Material, pp. 2489-2496, 2007, ACM, 978-1-59593-698-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 960, pp. 113923, June 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR Spectr. ![In: OR Spectr. 44(1), pp. 87-119, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
44 | Claudia Bongiovanni, Nikolas Geroliminis, Mor Kaspi |
A ride time-oriented scheduling algorithm for dial-a-ride problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.07347, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 42(19), pp. 6728-6737, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INOC ![In: Proceedings of the 11th International Network Optimization Conference, INOC 2024, Dublin, Ireland, March 11-23, 2024., pp. 70-75, 2024, OpenProceedings.org, 978-3-89318-096-7. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
31 | Alexander Birx, Yann Disser, Kevin Schewior |
Improved Bounds for Open Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1372-1414, May 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.11285, 2023. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 16(5), pp. 1195-1207, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 310(2), pp. 552-565, October 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 309(3), pp. 1091-1111, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 26(5), pp. 479-495, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
31 | Yves Molenbruch, Kris Braekers, Ohad Eisenhandler, Mor Kaspi |
The Electric Dial-a-Ride Problem on a Fixed Circuit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 57(3), pp. 594-612, May 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 57(1), pp. 156-173, January 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoICT ![In: Proceedings of the 12th International Symposium on Information and Communication Technology, SOICT 2023, Ho Chi Minh, Vietnam, December 7-8, 2023, pp. 679-686, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings, pp. 43-64, 2023, Springer, 978-3-031-38905-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
31 | Grzegorz Gutowski, Grzegorz Herman |
Long-Distance Directional Dial-a-Ride Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VEHITS ![In: Proceedings of the 9th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2023, Prague, Czech Republic, April 26-28, 2023., pp. 187-197, 2023, SCITEPRESS, 978-989-758-652-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 60(1), pp. 297-323, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 147, pp. 105938, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 140, pp. 105649, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 147, pp. 105933, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 29(3), pp. 1417-1453, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 16(1), pp. 355-374, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Zhexi Fu, Joseph Y. J. Chow |
Dial-a-ride problem with modular platooning and en-route transfers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.00289, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.05000, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.13854, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.13850, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 301(2), pp. 591-608, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Lennart Christian Johnsen, Frank Meisel |
Interrelated trips in the rural dial-a-ride problem with autonomous vehicles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 303(1), pp. 201-219, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 302(3), pp. 1031-1044, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Sunil Morapitiye, Tamás Kis |
Strong cuts from compatibility relations for the Dial-a-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 309, pp. 240-257, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 79(4), pp. 452-478, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Christoph Grüne, Stephan Zieger |
Solving the Dial-a-Ride Problem for Railway Traffic by Means of Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMARTGREENS/VEHITS (Selected Papers) ![In: Smart Cities, Green Technologies, and Intelligent Transport Systems - 11th International Conference, SMARTGREENS 2022, and 8th International Conference, VEHITS 2022, Virtual Event, April 27-29, 2022, Revised Selected Papers, pp. 93-133, 2022, Springer, 978-3-031-37469-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings, pp. 154-171, 2022, Springer, 978-3-031-18366-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Jiayuan Li, Kohji Tomita, Akiya Kamimura |
A Novel Genetic Algorithm for a Multi-Vehicle Dial-a-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARM ![In: International Conference on Advanced Robotics and Mechatronics , ICARM 2022, Guilin, China, July 9-11, 2022, pp. 682-689, 2022, IEEE, 978-1-6654-8306-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: IEEE Symposium Series on Computational Intelligence, SSCI 2022, Singapore, December 4-7, 2022, pp. 101-110, 2022, IEEE, 978-1-6654-8768-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Martin Aleksandrov, Philip Kilby |
Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: AI 2022: Advances in Artificial Intelligence - 35th Australasian Joint Conference, AI 2022, Perth, WA, Australia, December 5-8, 2022, Proceedings, pp. 690-703, 2022, Springer, 978-3-031-22694-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Andy Ham |
Dial-a-Ride Problem With Meeting Point Feature Known-as Express-Pool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 9, pp. 86404-86411, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 129, pp. 105196, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 80(20), pp. 30775-30787, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Intell. Transp. Syst. ![In: IEEE Trans. Intell. Transp. Syst. 22(10), pp. 6473-6488, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Jacopo Pierotti, J. Theresia van Essen |
MILP models for the Dial-a-ride problem with transfers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURO J. Transp. Logist. ![In: EURO J. Transp. Logist. 10, pp. 100037, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Forum ![In: Oper. Res. Forum 2(3), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Yannik Rist, Michael A. Forbes 0002 |
A New Formulation for the Dial-a-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 55(5), pp. 1113-1135, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATMOS ![In: 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, September 9-10, 2021, Lisbon, Portugal (Virtual Conference)., pp. 8:1-8:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-213-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MOTOR ![In: Mathematical Optimization Theory and Operations Research - 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5-10, 2021, Proceedings, pp. 35-50, 2021, Springer, 978-3-030-77875-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Sonia Nasri, Hend Bouziri, Wassila Aggoune-Mtalaa |
A new hybrid evolutionary algorithm for dial-a-ride problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO Companion ![In: GECCO '21: Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France, July 10-14, 2021., pp. 57-58, 2021, ACM, 978-1-4503-8351-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MT-ITS ![In: 7th International Conference on Models and Technologies for Intelligent Transportation Systems, MT-ITS 2021, Heraklion, Greece, June 16-17, 2021, pp. 1-6, 2021, IEEE, 978-1-7281-8995-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Konstantinos Gkiotsalitis |
The Dial-A-Ride Problem considering the in-vehicle crowding inconvenience due to COVID-19. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITSC ![In: 24th IEEE International Intelligent Transportation Systems Conference, ITSC 2021, Indianapolis, IN, USA, September 19-22, 2021, pp. 3746-3751, 2021, IEEE, 978-1-7281-9142-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Christian Ackermann, Julia Rieck |
New Optimization Guidance for Dynamic Dial-a-Ride Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31 - September 3, 2021, pp. 283-288, 2021, Springer, 978-3-031-08623-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICORES ![In: Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, ICORES 2021, Online Streaming, February 4-6, 2021., pp. 281-286, 2021, SCITEPRESS, 978-989-758-485-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Stjepan Zelic, Marko Durasevic, Domagoj Jakobovic, Lucija Planinic |
Solving the Dial-a-Ride Problem Using an Adapted Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI*IA ![In: AIxIA 2021 - Advances in Artificial Intelligence - 20th International Conference of the Italian Association for Artificial Intelligence, Virtual Event, December 1-3, 2021, Revised Selected Papers, pp. 689-699, 2021, Springer, 978-3-031-08420-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(2), pp. 1409-1443, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Tai-Yu Ma |
Optimal charging scheduling for dynamic dial-a-ride services using electric vehicles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.01541, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. ![In: J. Comput. Sci. 47, pp. 101199, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 280(3), pp. 953-969, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Intell. Transp. Syst. Mag. ![In: IEEE Intell. Transp. Syst. Mag. 12(4), pp. 219-234, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 26(1), pp. 83-118, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISDA ![In: Intelligent Systems Design and Applications - 20th International Conference on Intelligent Systems Design and Applications (ISDA 2020) held December 12-15, 2020, pp. 1302-1313, 2020, Springer, 978-3-030-71186-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (7) ![In: Computational Science - ICCS 2020 - 20th International Conference, Amsterdam, The Netherlands, June 3-5, 2020, Proceedings, Part VII, pp. 382-396, 2020, Springer, 978-3-030-50435-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, pp. 180-194, 2020, Springer, 978-3-030-48965-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECOCS ![In: 2nd IEEE International Conference on Electronics, Control, Optimization and Computer Science, ICECOCS 2020, Kenitra, Morocco, December 2-3, 2020, pp. 1-6, 2020, IEEE, 978-1-7281-6921-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.04272, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.06300, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
31 | Slim Belhaiza |
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(2), pp. 39, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 53(2), pp. 480-491, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 53(1), pp. 113-130, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICVNS ![In: Variable Neighborhood Search - 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3-5, 2019, Revised Selected Papers, pp. 53-66, 2019, Springer, 978-3-030-44931-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATMOS ![In: 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2019, September 12-13, 2019, Munich, Germany., pp. 11:1-11:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-128-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2019, Wellington, New Zealand, June 10-13, 2019, pp. 2082-2089, 2019, IEEE, 978-1-7281-2153-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECC ![In: 17th European Control Conference, ECC 2019, Naples, Italy, June 25-28, 2019, pp. 2682-2688, 2019, IEEE, 978-3-907144-00-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (1) ![In: Computational Science - ICCS 2019 - 19th International Conference, Faro, Portugal, June 12-14, 2019, Proceedings, Part I, pp. 81-95, 2019, Springer, 978-3-030-22733-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (5) ![In: Computational Science - ICCS 2019 - 19th International Conference, Faro, Portugal, June 12-14, 2019, Proceedings, Part V, pp. 55-69, 2019, Springer, 978-3-030-22749-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Sevket Gökay, Andreas Heuvels, Karl-Heinz Krempels |
A High-level Category Survey of Dial-a-Ride Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VEHITS ![In: Proceedings of the 5th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2019, Heraklion, Crete, Greece, May 3-5, 2019., pp. 594-600, 2019, SciTePress, 978-989-758-374-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 15:1-15:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Alexander Birx, Yann Disser, Kevin Schewior |
Improved Bounds for Open Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 21:1-21:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Fabian Feitsch, Sabine Storandt |
The Clustered Dial-a-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPS ![In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2019, Berkeley, CA, USA, July 11-15, 2019., pp. 510-518, 2019, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|