|
|
|
|
A time-dependent ATSP with time window and precedence constraints in air travel
|
|
|
|
|
|
|
|
نویسنده
|
saradatta t. ,pongchairerks p.
|
|
منبع
|
journal of telecommunication, electronic and computer engineering - 2017 - دوره : 9 - شماره : 2-3 - صفحه:149 -153
|
|
چکیده
|
This paper considers a time-dependent asymmetric travelling salesman problem with time window and precedence constraints,based on the real application of air transport. this problem is much more complicated than the classical asymmetric travelling salesman problem due to the properties of the airfare prices,the time window constraints and the precedence constraints. to solve this problem,this paper proposes a modified nearest neighbor algorithm and two local search algorithms.
|
|
کلیدواژه
|
Air Transportation; Asymmetric Travelling Salesman Problem; ATSP; Local Search Algorithm; Precedence Constraint; Time Window; TimeDependent; Travelling Salesman Problem; TSP
|
|
آدرس
|
faculty of engineering,thai-nichi institute of technology,bangkok, Thailand, faculty of engineering,thai-nichi institute of technology,bangkok, Thailand
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|