• Title/Summary/Keyword: Travel routes

Search Result 148, Processing Time 0.032 seconds

Using Genetic-Fuzzy Methods To Develop User-preference Optimal Route Search Algorithm

  • Choi, Gyoo-Seok;Park, Jong-jin
    • The Journal of Information Technology and Database
    • /
    • v.7 no.1
    • /
    • pp.42-53
    • /
    • 2000
  • The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

  • PDF

A Two-phase Method for the Vehicle Routing Problems with Time Windows (시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발)

  • Hong, Sung-Chul;Park, Yang-Byung
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

Searching optimal path using genetic algorithm (유전 알고리즘을 이용한 최적 경로 탐색)

  • Kim, Kyungnam;cho, Minseok;Lee, Hyunkyung
    • Proceeding of EDISON Challenge
    • /
    • 2015.03a
    • /
    • pp.479-483
    • /
    • 2015
  • In case of the big city, choosing the adequate root of which we can reach the destination can affect the driver's condition and driving time. so it is quite important to find the optimal routes for arriving the destination as considering the factors, such as driving conditions or travel time and so on. In this paper, we develop route choice model with considering driving conditions and travel time, and it can search the optimal path which make drivers reduce their fatigues using genetic algorithm.

  • PDF

A Comparative Study of Satisfaction of Chinese and Japanese Transit Passengers at Incheon International Airport (인천국제공항에서 환승하는 중국인.일본인의 환승만족도에 대한 차이분석)

  • Yoon, Han-Young;Park, Sung-Sik;Bang, Jang-Kyu
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.19 no.3
    • /
    • pp.69-82
    • /
    • 2011
  • This paper tried to find out what the main factors are to impact on satisfaction level of transit passengers at Incheon airport. Incheon airport has made lots of transit facilities and services to attract transit passengers from neighboring airports to increase transit rate as high as advanced foreign airports such as Heathrow, Schiphol and Hong Kong. A survey was performed on 450 transit passengers resting at airport transit lounge in airside area. According to the result, it was found out to be significant factors affecting satisfaction of transit that convenience of security screening, price of duty-free product, a direction board & signage and terminal orientation among Chinese transit passengers. On the other hands, it seemed that Japanese transit passengers thought diversity of airline routes, convenient transfer flight schedule, total transit time and terminal orientation are major variables affecting their satisfaction. Considering the effect of demographic factors, Chinese passenger's satisfaction was more affected by age, travel purpose, the number of travel per year and flight destinations. However, Japanese transit passenger's satisfaction was only affected by the flight destinations, especially willing to travel to North America and Europe.

Flow Path Design for Automated Transport Systems in Container Terminals Considering Traffic Congestion

  • Singgih, Ivan Kristianto;Hong, Soondo;Kim, Kap Hwan
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.1
    • /
    • pp.19-31
    • /
    • 2016
  • A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

A Development of Optimal Travel Course Recommendation System based on Altered TSP and Elasticsearch Algorithm (변형된 TSP 및 엘라스틱서치 알고리즘 기반의 최적 여행지 코스 추천 시스템 개발)

  • Kim, Jun-Yeong;Jo, Kyeong-Ho;Park, Jun;Jung, Se-Hoon;Sim, Chun-Bo
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.9
    • /
    • pp.1108-1121
    • /
    • 2019
  • As the quality and level of life rise, many people are doing search for various pieces of information about tourism. In addition, users prefer the search methods reflecting individual opinions such as SNS and blogs to the official websites of tourist destination. Many of previous studies focused on a recommendation system for tourist courses based on the GPS information and past travel records of users, but such a system was not capable of recommending the latest tourist trends. This study thus set out to collect and analyze the latest SNS data to recommend tourist destination of high interest among users. It also aimed to propose an altered TSP algorithm to recommend the optimal routes to the recommended destination within an area and a system to recommend the optimal tourist courses by applying the Elasticsearch engine. The altered TSP algorithm proposed in the study used the location information of users instead of Dijkstra's algorithm technique used in previous studies to select a certain tourist destination and allowed users to check the recommended courses for the entire tourist destination within an area, thus offering more diverse tourist destination recommendations than previous studies.

A Travel Time Prediction Model under Incidents (돌발상황하의 교통망 통행시간 예측모형)

  • Jang, Won-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.1
    • /
    • pp.71-79
    • /
    • 2011
  • Traditionally, a dynamic network model is considered as a tool for solving real-time traffic problems. One of useful and practical ways of using such models is to use it to produce and disseminate forecast travel time information so that the travelers can switch their routes from congested to less-congested or uncongested, which can enhance the performance of the network. This approach seems to be promising when the traffic congestion is severe, especially when sudden incidents happen. A consideration that should be given in implementing this method is that travel time information may affect the future traffic condition itself, creating undesirable side effects such as the over-reaction problem. Furthermore incorrect forecast travel time can make the information unreliable. In this paper, a network-wide travel time prediction model under incidents is developed. The model assumes that all drivers have access to detailed traffic information through personalized in-vehicle devices such as car navigation systems. Drivers are assumed to make their own travel choice based on the travel time information provided. A route-based stochastic variational inequality is formulated, which is used as a basic model for the travel time prediction. A diversion function is introduced to account for the motorists' willingness to divert. An inverse function of the diversion curve is derived to develop a variational inequality formulation for the travel time prediction model. Computational results illustrate the characteristics of the proposed model.

A Computer Method for GT Plant Layout and Its Simulation Analysis (컴퓨터를 이용한 GT설비배치(設備配置)와 시뮬레이션에 의한 평가(評價))

  • Sin, Hyeon-Pyo
    • Journal of Korean Society for Quality Management
    • /
    • v.12 no.1
    • /
    • pp.17-30
    • /
    • 1984
  • A computer method is developed for group technology layout and its simulation analysis. The method is composed of three phases: Phase I sorts the parts by its similar production routes and forms part families. Phase II plots the layout by machine cell and evaluates the group layout alternatives by the total process time analysis and the part travel distance evaluation analysis. Phase III also evaluates the alternatives by simulation analysis using SIMAN simulation software. All the computer programs are developed with BASIC except SIMAN simulation.

  • PDF

A Route Choice Model with Considering Fuel Cost by Travel Distance (통행거리에 따른 유류비를 반영한 경로선택모형 개발)

  • Park, Bora;Lee, Jaeyoung;Choi, Keechoo;Song, Pilyong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.30 no.6D
    • /
    • pp.599-604
    • /
    • 2010
  • In this study, the value of travel time was estimated with reflecting the fuel cost according to travel distance. The main objective of this study is whether the addition of the fuel cost as a factor for route choice behavior is appropriate or not, through the stated preference survey. The route choice model was developed using SP survey technique with the consideration of level difference and the value of travel time, toll and fuel costs. Consequently, the fuel cost is identified as a main factor like travel time and toll cost in choosing routes from drivers' viewpoints. Nevertheless, since toll costs are recognized as out-of-pocket expenses whereas fuel costs as periodical expenses, it seems drivers are more sensitive to toll than fuel costs.

Creation of Vector Network Data with Considering Terrain Gradient for Analyzing Optimal Haulage Routes of Dump Trucks in Open Pit Mines (노천광산 덤프트럭의 최적 운반경로 분석을 위한 지형경사가 고려된 벡터 네트워크 자료의 생성 방법)

  • Park, Boyoung;Choi, Yosoon;Park, Han-Su
    • Tunnel and Underground Space
    • /
    • v.23 no.5
    • /
    • pp.353-361
    • /
    • 2013
  • Previous studies for analyzing optimal haulage routes of dump trucks in open pit mines mostly used raster data. However, the raster data has several problems in performing optimal route analyses: (1) the jagged appearance of haulage roads according the cell resolution often causes overestimation of the travel cost; (2) it difficult to trace the topological relationships among haulage roads. These problems can be eliminated by using vector network data, however a new method is required to reflect the performance characteristics of a dump truck according to terrain gradient changes. This study presents a new method to create vector network data with the consideration of terrain gradient for analyzing optimal haulage routes of dump trucks in open pit mines. It consists of four procedures: (a) creating digital elevation models, (b) digitizing haulage road networks, (c) calculating the terrain gradient of haulage roads, and (d) calculating the average speed and travel time of a dump truck along haulage roads. A simple case study at the Roto South pit in the Pasir open pit coal mine, Indonesia is also presented to provide proof that the proposed method is easily compatible to ArcGIS Network Analyst software and is effective in finding optimal haulage routes of dump trucks with considering terrain gradient in open pit mines.