roadME: Fundamentals for Real World Applications of Metaheuristics: The vehicular case

 TIN2011-28194 Ministerio de Economía y Competitividad (Spain)
 UMA - University of Málaga



list19th Dec 2011. Starting Meeting
list 1st Jan 2012. The project starts
list 30th Jan 2012. Meeting
list 8th Jun 2012. 2nd VANET Meeting
list 5th Oct 2012.Meeting
list 18th Jan 2013. Meeting
list 14th Jun 2013. Meeting
list 17th Jan 2014. Meeting
list 6th Jun 2014. Meeting
list 1st Oct 2014. Meeting
list 3rd Dec 2014. Meeting






Optimizing the broadcasting protocol is especially important in VANETs, since it can speed up basic network operations with the aim of enhancing upper QoS applications. This problem can be tackled by targeting three main goals: reaching as many devices as possible, minimizing the network utilization, and reducing the duration time of the broadcasting process.

Optimal scheduling of traffic lights, and in particular optimal light cycle programs, is also a crucial task in actual cities with potential benefits in terms of energy consumption, traffic flow management, pedestrian safety, and environmental issues. Unlike new decentralized self-regulated lights, or traditional queue based systems, the use of metaheuristic algorithms to find successful cycle programs of traffic lights is still an open issue.
Dynamic Vehicle Routing Problem (dVRP), consists in assigning optimal routes to a fleet of vehicles that must give service to a set of clients. The problem conditions can be dynamic (especially if the fleet is connected to adapt to changing conditions), and therefore, highly variable: travel times may change due to traffic incidences, routes might be blocked off, new customer demands can be accepted and included in current routes, withdrawal of scheduled demands could be possible, etc.

Other related problems




site stats | Webmaster | Contact Us | ©2012 roadMe UMA