Get A1 Form Pdf

Page 1 out of 1 Proposal Submission Form EUROPEAN COMMISSION 6th Framework Programme on Research Technological Development and Demonstration Proposal Number Specific Targeted Research or Innovation Projects Proposal Acronym 000000 A1 ARRIVAL General Information on the Proposal Proposal Title Algorithms for Robust and on-line Railway optimization Improving the Validity and reliAbility of Large-scale systems Duration in months Call identifier FP6-2002-IST-C Activity code s most relevant to your topic IST-2002-2. 3. 4. 1 Keyword 1 Algorithms Operations research Computer science Free Keywords Graph and Network Algorithms Approximation Algorithms Mathematical Programming Largescale optimization Constraint Programming Planning Scheduling Robust Optimization On-line Optimization Abstract up to 2000 characters Algorithmic methods have reached a state of maturity as a consequence of decades of research where real-world problems were posed to the algorithms community triggering important developments in the field. Despite this success the current state of algorithmic research still faces severe difficulties or cannot cope at all with highly-complex and data-intensive applications as those dealing with optimization issues in large-scale communication and transportation networks. The complexity and size of such optimization problems pose new challenges for algorithmic research and their efficient solution requires a radically new foundational paradigm* In this project we are interested in establishing such a new paradigm and considerably advance the current state of algorithmic research by attacking optimization questions in perhaps the most complex and largest in scale transportation setting that of railway systems. Railway optimization deals with planning and scheduling problems over several time horizons. We focus on two important and nearly unexplored facets of planning that pose even harder optimization questions robust planning and on-line real-time planning. These two tightly coupled facets constitute a proactive and a reactive approach respectively to deal with disruptions to the normal operation* Our main goal is to develop the necessary foundational algorithmic research in order to provide ingenious and sound answers to the fundamental efficiency and quality issues encapsulated in robust and on-line planning of complex large-scale systems as those in railways. We will endeavor to develop a thorough understanding of the fundamental issues that make robust with hardness through an integrated interdisciplinary approach drawn from algorithmic operations research and constraint programming techniques. 3. 4. 1 Keyword 1 Algorithms Operations research Computer science Free Keywords Graph and Network Algorithms Approximation Algorithms Mathematical Programming Largescale optimization Constraint Programming Planning Scheduling Robust Optimization On-line Optimization Abstract up to 2000 characters Algorithmic methods have reached a state of maturity as a consequence of decades of research where real-world problems were posed to the algorithms community triggering important developments in the field. Despite this success the current state of algorithmic research still faces severe difficulties or cannot cope at all with highly-complex and data-intensive applications as those dealing with optimization issues in large-scale communication and transportation networks.