Structural synthesis of dispatching rules for dynamic dial-A-ride problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8111 LNCS, Issue PART 1, 2013, Pages 276-283

  Vonolfen, Stefan ^a   Beham, Andreas ^a   Kommenda, Michael ^a   Affenzeller, Michael ^a  

^a UNIVERSITY OF APPLIED SCIENCES UPPER AUSTRIA   (Austria)

Author keywords

Dispatching Rules; Dynamic Dial A ride Problem; Genetic Programming

Indexed keywords

AUTONOMOUS AGENTS; BENCHMARKING; GENETIC ALGORITHMS; MULTI AGENT SYSTEMS; SYSTEM THEORY; TRANSPORTATION ROUTES;

COMPLEX DECISION; DIAL-A-RIDE PROBLEM; DISPATCHING RULES; EVOLUTIONARY PROCESS; PASSENGER TRANSPORTATION; STRUCTURAL SYNTHESIS; VARIABLE FREQUENCIES;

GENETIC PROGRAMMING;

EID: 84892565966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-53856-8_35     Document Type: Conference Paper

References (16)

1. Affenzeller, M., Winkler, S., Wagner, S., Beham, A.: Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications (Numerical Insights), 1st edn. Chapman & Hall (April 2009)
2. Attanasio, A., Cordeau, J., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-A-ride problem. Parallel Computing 30(3), 377-387 (2004)
3. Beham, A., Kofler, M., Wagner, S., Affenzeller, M.: Agent-based simulation of dispatching rules in dynamic pickup and delivery problems. In: 2nd International Logistics and Industrial Informatics, LINDI 2009, pp. 1-6. IEEE (2009)
4. Berbeglia, G., Cordeau, J., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1), 8-15 (2010)
5. Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15(1), 1-31 (2007)
6. Bertsimas, D.J., Van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the euclidean plane. Operations Research 39(4), 601-615 (1991)
7. Cordeau, J.F., Laporte, G.: The dial-A-ride problem: models and algorithms. Annals of Operations Research 153(1), 29-46 (2007)
8. Cordeau, J., Laporte, G.: The dial-A-ride problem (darp): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research 1(2), 89-101 (2003)
9. Fu, M.C., Glover, F.W., April, J.: Simulation optimization: a review, new developments, and applications. In: 2005 Proceedings of theWinter Simulation Conference, 13. p. IEEE (2005)
10. Kronberger, G.: Symbolic Regression for Knowledge Discovery - Bloat, Overfitting, and Variable Interaction Networks. No. 64 in Johannes Kepler University, Linz, Reihe C, Trauner Verlag+Buchservice GmbH (2011)
11. Laporte, G.: Recent algorithms for the dial-A-ride problem. In: Operations Research for Complex Decision Making, p. 13 (2010)
12. Larsen, A., Madsen, O., Solomon, M.: Partially dynamic vehicle routing-models and algorithms. Journal of the Operational Research Society, 637-646 (2002)
13. van Lon, R., Holvoet, T., Vanden Berghe, G., Wenseleers, T., Branke, J.: Evolutionary synthesis of multi-Agent systems for dynamic dial-A-ride problems. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference Companion, pp. 331-336. ACM (2012)
14. Pitzer, E., Beham, A., Affenzeller, M., Heiss, H., Vorderwinkler, M.: Production fine planning using a solution archive of priority rules. In: 2011 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI), pp. 111-116. IEEE (2011)
15. Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-A-ride problem with expected return transports. Computers & Operations Research 38(12), 1719-1730 (2011)
16. Wagner, S.: Heuristic Optimization Software Systems - Modeling of Heuristic Optimization Algorithms in the HeuristicLab Software Environment. Ph.D. thesis, Johannes Kepler University, Linz, Austria (2009)