Heuristic Approach to Capacitated Traffic Assignment Problem for Large-Scale Transport Networks

2015 ◽  
Vol 2498 (1) ◽  
pp. 1-11 ◽  
Author(s):  
Saeed Asadi Bagloee ◽  
Majid Sarvi
Keyword(s):  
Assignment Problem ◽  
Large Scale ◽  
Traffic Assignment ◽  
Heuristic Approach ◽  
Transport Networks ◽  
Traffic Assignment Problem

scholarly journals Selective Simulated Annealing for Large Scale Airspace Congestion Mitigation

Aerospace ◽  
2021 ◽  
Vol 8 (10) ◽  
pp. 288
Author(s):  
Julien Lavandier ◽  
Arianit Islami ◽  
Daniel Delahaye ◽  
Supatcha Chaimatanan ◽  
Amir Abecassis
Keyword(s):  
Simulated Annealing ◽  
Combinatorial Optimization ◽  
Assignment Problem ◽  
Large Scale ◽  
Optimization Problem ◽  
Traffic Assignment ◽  
Combinatorial Optimization Problem ◽  
Slot Allocation ◽  
Traffic Assignment Problem ◽  
Aircraft Trajectories

This paper presents a methodology to minimize the airspace congestion of aircraft trajectories based on slot allocation techniques. The traffic assignment problem is modeled as a combinatorial optimization problem for which a selective simulated annealing has been developed. Based on the congestion encountered by each aircraft in the airspace, this metaheuristic selects and changes the time of departure of the most critical flights in order to target the most relevant aircraft. The main objective of this approach is to minimize the aircraft speed vector disorder. The proposed algorithm was implemented and tested on simulated trajectories generated with real flight plans on a day of traffic over French airspace with 8800 flights.

Sign in / Sign up

Export Citation Format

Share Document