Transportation Path Assignment Within the Airports in Turkey

2020 ◽  
pp. 207-217
Author(s):  
Emre Demir ◽  
İbrahim Aydoğdu
Keyword(s):  
Path Assignment

Power-saving Aware Optical Path Assignment for over-Peta-bit-throughput SDM Photonic Node

2021 ◽  
Author(s):  
Fumikazu Inuzuka ◽  
Toshifumi Nakamura ◽  
Hidemi Noguchi ◽  
Shigeyuki Yanagimachi ◽  
Takafumi Tanaka ◽  
...  
Keyword(s):  
Power Saving ◽  
Optical Path ◽  
Path Assignment

SHORTEST PATH, ASSIGNMENT AND TRANSPORTATION PROBLEMS

1963 ◽  
Author(s):  
A. J. Hoffman ◽  
H. M. Markowitz
Keyword(s):  
Shortest Path ◽  
Transportation Problems ◽  
Path Assignment

Joint Scheduling of Vessel Traffic and Pilots in Seaport Waters

2020 ◽  
Vol 54 (6) ◽  
pp. 1495-1515 ◽  
Author(s):  
Shuai Jia ◽  
Lingxiao Wu ◽  
Qiang Meng
Keyword(s):  
Lagrangian Relaxation ◽  
Traffic Management ◽  
Programming Model ◽  
A Priori ◽  
Relaxation Algorithm ◽  
Congestion Mitigation ◽  
Computational Performance ◽  
Time Space ◽  
Path Assignment ◽  
Lagrangian Relaxation Algorithm

In the busiest seaports, vessel traffic and vessel pilotage management play a crucial role in congestion mitigation. The management of vessel traffic and pilotage involves scheduling the vessels for sailing into and out of a seaport and scheduling the pilots for navigating the vessels in the port waters. In this paper, we study the integrated vessel traffic and pilot scheduling problem of a seaport. We manage the vessel traffic by optimizing the utilization of the navigation channels and the utilization of the anchorage areas in the terminal basin and incorporate the decision of pilot scheduling into the decision of vessel traffic management for congestion mitigation and vessel service enhancement. We formulate the problem on a time–space network with vessel- and pilot-dependent arc costs and develop an integer programming model that minimizes the sum of the berthing and departure tardiness cost of vessels, the cost of unsatisfied vessel service requests, and the pilot dispatching cost. For solving the model, we enumerate feasible vessel paths a priori and develop a Lagrangian relaxation algorithm that decomposes the problem into a vessel and pilot path assignment subproblems. Computational performance of the Lagrangian relaxation algorithm is tested on problem instances generated based on the physical layout and operational data of the Waigaoqiao Port in Shanghai.

scholarly journals Integrated aircraft-path assignment and robust schedule design with cruise speed control

2017 ◽  
Vol 84 ◽  
pp. 127-145 ◽  
Author(s):  
Özge Şafak ◽  
Si̇nan Gürel ◽  
M. Seli̇m Aktürk
Keyword(s):  
Speed Control ◽  
Schedule Design ◽  
Path Assignment
Sign in / Sign up

Export Citation Format

Share Document