مسيرهاي بهينه تركيبي (هوايي - دريايي) با استفاده از درخت پوشاي كمينه و برنامه ريزي عدد صحيح

OPTIMUM MIXED (MARITIME- AERIAL) ROUTE-PLANNING USING MINIMUM SPANNING TREE an‎d INTEGER PROGRAMMING

در اين مطالعه روشي براي كمينه سازي هزينه ي شبكه ي مركب حمل و نقلي ارايه مي شود. زمينه سازي با اتكا بر هزينه ي عملياتي مستقيم، «هزينه ي زماني» و براي توري نمونه در محدوده ي جزاير خليج فارس و با تركيب هم زمان وسيله هاي آب پايه و هواپيما پياده سازي شده و مسيرهاي مختلف بهينه معرفي شده اند. بهينه سازي شبكه ي نهايي با استفاده از درخت پوشاي كمينه و برنامه ريزي عدد صحيح با فرض هزينه هاي زماني 6 و 8 دلار بر ساعت انجام پذيرفت. نتايج تخصيص هم زمان هواپيما و كشتي نشان گر آن است كه استفاده از كشتي در مسافت هاي كم تر از 300 كيلومتر با هزينه ي زماني 6 دلار بر ساعت و مسافت هاي كم تر از 200 كيلومتر با ارزش زماني 8 دلار بر ساعت هزينه ي كم تري خواهد داشت. مقايسه ي دو روش بهينه سازي، بيان گر اين است كه طراحي شبكه ي گردشگري به روش برنامه ريزي عدد صحيح و طراحي شبكه ي هاب و اسپوك به روش درخت پوشاي كمينه مقرون به صرفه است.

Based on World Tourism Organization (WTO) statistics in recent 70 years, the number of tourists has increased from 25 million in 1950 to 1 billion and 235 million in 2016. Extending and developing the transport network is one of the main reasons for this growth. A more developed transport network can improve the tourism rate in country which in return can help the economic growth rate. Iran is considered a very rich country in terms of natural and historical tourism resources; moreover, it has a great potential to become one of the main tourism hubs in the region. Meanwhile, in some cities and places, tourism standards have improved; however, in the southern islands of Iran, despite eye-catching attractions, there has not been enough concerns about them and this issue can be improved by developing the current transport network and designing a new one. In this study, based on the system-system approach, the focus is to design and offer different maritime and air transport solutions between some of Iran's islands in Persian Gulf. In this regard, the research aims to minimize the total cost of a combinational trip consisting of both aerial as well as maritime routes. The devised methodology was applied to finding optimal connecting routes among Persian Gulf islands. The method exploits both Direct Operating Cost (DOC) as well as the value of ``time factor''. In this study, the final network optimization was performed using two methods of minimum spanning tree and integer programming with exact solution, taking into account time factor of 6and 8 per hour. The results of the simultaneous allocation of aircraft and passenger ships indicate the use of ships at distances less than 300 km at a time factor of 6perhouranddistanceslessthan200kmatatimefactorof 8 per hour; also, a comparison of the two optimization methods used for network design shows that the design of the tourism network by integer programming and the hub-and-spoke network design by the minimum spanning tree will be efficient.