• Title/Summary/Keyword: Optimal transportation Network planning

Search Result 19, Processing Time 0.031 seconds

A Decision Support System for an Optimal Transportation Network Planning in the Third Party Logistics

  • Park, Yong-Sung;Choi, Hyung-Rim;Kim, Hyun-Soo;Park, Nam-Kyu;Cho, Jae-Hyung;Gang, Moo-Hong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2006.10a
    • /
    • pp.240-257
    • /
    • 2006
  • In an effort to gain competitiveness, recently many companies are trying to outsource their logistics activities to the logistics specialists, while concentrating on their core and strategic business area. Because of this trend, the third party logistics comes to the fore, catching people's attention, and expanding its market rapidly. Under these circumstances, the third party logistics companies are making every effort to improve their logistics services and to develop an information system in order to enhance their competitiveness. In particular, among these efforts one of the critical parts is the decision support system for effective transportation network planning. To this end, this study has developed an efficient decision support system for an optimal transportation network planning by comprehensively considering the transportation mode, routing, assignment, and schedule. As a result of this study, the new system enables the expansion of the third party logistics companies' services including the multimodal transportation, not to mention one mode of transportation, and also gets them ready to plan an international transportation network.

  • PDF

Optimal Poultry Litter Management through GIS-based Transportation Analysis System

  • Kang, M.S.;Srivastava, P.;Fulton, J.P.;Tyson, T.;Owsley, W.F.;Yoo, K.H.
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.48 no.7
    • /
    • pp.73-86
    • /
    • 2006
  • Concentrated poultry production in the State of Alabama, U.S.A. results in excessive poultry litter. Application of poultry litter to pastures and row crops serves as a cheap alternative to commercial fertilizer. However, over the years, poultry litter application to perennial forage crops in the Appalachian Plateau region of North Alabama has resulted in phosphorus (P) buildup in soils. Phosphorus index (P-index) and comprehensive nutrient management plans (CNMP) are often used as a best management practice (BMP) for proper land application of litter. Because nutrient management planning is often not done for small animal feeding operations (AFOs), and also because, in case of excess litter, litter transportation infrastructure has not been developed, over application of poultry litter to near by area is a common practice. To alleviate this problem, optimal poultry litter management and transportation infrastructure needs to be developed. This paper presents a methodology to optimize poultry litter application and transportation through efficient nutrient management planning and transportation network analysis. The goal was accomplished through implementation of three important modules, a P-Index module, a CNMP module, and a transportation network analysis module within ArcGIS, a Geographic Information System (GIS). The CNMP and P-Index modules assist with land application of poultry litter at a rate that is protective of water quality, while the transportation network analysis module helps transport excess litter to areas requiring litter in the Appalachian Plateau and Black Belt (a nutrient-deficient area) regions. Once fully developed and implemented, such a system will help alleviate water quality problems in the Appalachian Plateau region and poor soil fertility problems in the Black Belt region by optimizing land application and transportation. The utility of the methodology is illustrated through a hypothetical case study.

A Tabu Search Algorithm for the Postal Transportation Planning Problem (우편집중국간 우편물 운송계획 문제의 타부 탐색 알고리듬)

  • 최지영;송영효;강성열
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.4
    • /
    • pp.13-34
    • /
    • 2002
  • This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.

  • PDF

Exercising The Traditional Four-Step Transportation Model Using Simplified Transport Network of Mandalay City in Myanmar (미얀마 만달레이시의 단순화된 교통망을 이용한 전통적인 4단계 교통 모델에 관한 연구)

  • Wut Yee Lwin;Byoung-Jo Yoon;Sun-Min Lee
    • Journal of the Society of Disaster Information
    • /
    • v.20 no.2
    • /
    • pp.257-269
    • /
    • 2024
  • Purpose: The purpose of this study is to explain the pivotal role of the travel forecasting process in urban transportation planning. This study emphasizes the use of travel forecasting models to anticipate future traffic. Method: This study examines the methodology used in urban travel demand modeling within transportation planning, specifically focusing on the Urban Transportation Modeling System (UTMS). UTMS is designed to predict various aspects of urban transportation, including quantities, temporal patterns, origin-destination pairs, modal preferences, and optimal routes in metropolitan areas. By analyzing UTMS and its operational framework, this research aims to enhance an understanding of contemporary urban travel demand modeling practices and their implications for transportation planning and urban mobility management. Result: The result of this study provides a nuanced understanding of travel dynamics, emphasizing the influence of variables such as average income, household size, and vehicle ownership on travel patterns. Furthermore, the attraction model highlights specific areas of significance, elucidating the role of retail locations, non-retail areas, and other locales in shaping the observed dynamics of transportation. Conclusion: The study methodically addressed urban travel dynamics in a four-ward area, employing a comprehensive modeling approach involving trip generation, attraction, distribution, modal split, and assignment. The findings, such as the prevalence of motorbikes as the primary mode of transportation and the impact of adjusted traffic patterns on reduced travel times, offer valuable insights for urban planners and policymakers in optimizing transportation networks. These insights can inform strategic decisions to enhance efficiency and sustainability in urban mobility planning.

A Simple Method for Solving Type-2 and Type-4 Fuzzy Transportation Problems

  • Senthil Kumar, P.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.225-237
    • /
    • 2016
  • In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer's over time work, unexpected failures in machine, seasonal changes and many more. To counter these problems, depending on the nature of the parameters, the TP is classified into two categories namely type-2 and type-4 fuzzy transportation problems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992) is used to transform the type-2 and type-4 FTPs into a crisp one so that the conventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.

Building a mathematics model for lane-change technology of autonomous vehicles

  • Phuong, Pham Anh;Phap, Huynh Cong;Tho, Quach Hai
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.641-653
    • /
    • 2022
  • In the process of autonomous vehicle motion planning and to create comfort for vehicle occupants, factors that must be considered are the vehicle's safety features and the road's slipperiness and smoothness. In this paper, we build a mathematical model based on the combination of a genetic algorithm and a neural network to offer lane-change solutions of autonomous vehicles, focusing on human vehicle control skills. Traditional moving planning methods often use vehicle kinematic and dynamic constraints when creating lane-change trajectories for autonomous vehicles. When comparing this generated trajectory with a man-generated moving trajectory, however, there is in fact a significant difference. Therefore, to draw the optimal factors from the actual driver's lane-change operations, the solution in this paper builds the training data set for the moving planning process with lane change operation by humans with optimal elements. The simulation results are performed in a MATLAB simulation environment to demonstrate that the proposed solution operates effectively with optimal points such as operator maneuvers and improved comfort for passengers as well as creating a smooth and slippery lane-change trajectory.

Optimization of Planning-Level Locomotive Scheduling at KNR and Development of Its Implementation Prototype Program (한국철도에서의 계획단계 동력차 스케줄링 최적화 및 전문가 지원시스템의 프로토타입 프로그램 개발에 관한 연구)

  • 문대섭;김동오
    • Proceedings of the KSR Conference
    • /
    • 1999.11a
    • /
    • pp.46-53
    • /
    • 1999
  • As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

  • PDF

An Iterative Linear Approximation Algorithm for a Unified Model of Traffic Assignment and Line Planning in Railway Networks (통행배정-노선계획 통합 모형을 위한 선형 근사화 알고리듬 개발)

  • Park, Bum Hwan
    • Journal of the Korean Society for Railway
    • /
    • v.17 no.2
    • /
    • pp.140-147
    • /
    • 2014
  • Line planning is an important step to determine the optimal frequencies of trains given the forecasted demand for each train type. The main input data for line planning is the leg traffic demand which can be derived using suitable traffic assignment models. However most assignment models require a line plan, in other words, train frequencies or headways, so that inconsistent results just by the procedural approach to find an optimal line plan after determining leg traffic can be avoided. This paper suggests a unified model that can consider the traffic assignment and line planning, simultaneously. We further provide an elaborated approximation algorithm and, finally, provide experimental results determined for the Korean railway network.

Optimal Placement of UAVs for Self-Organizing Communication Relay: Voronoi Diagram-Based Method (군집 무인기들의 자가구성 통신중계 최적 배치: 보로노이 다이어그램 기반 접근법)

  • Junhee Jang;Hyunwoo Kim;Minsu Park;Seunghwan Choi;Chanyoung Song;Hyeok Yu;Deok-Soo Kim
    • Journal of Aerospace System Engineering
    • /
    • v.18 no.3
    • /
    • pp.1-7
    • /
    • 2024
  • The utilization of Unmanned Aerial Vehicles (UAVs) is expanding in various industries such as logistics, manufacturing, and transportation. However, to operate a large number of UAVs, it is imperative to first plan a secure and efficient self-configuring communication network for UAVs. In this study, we proposed a method for planning a secure and efficient UAV self-configuring communication network using Voronoi diagrams in the following three steps: 1) generating Voronoi diagrams using obstacles, 2) selecting obstacles to consider for path generation, and 3) planning the optimal path and outputting the path. The real-time feasibility of using the proposed method for planning optimal communication paths for a realistic number of UAVs was experimentally validated.

Multi-objective optimization of submerged floating tunnel route considering structural safety and total travel time

  • Eun Hak Lee;Gyu-Jin Kim
    • Structural Engineering and Mechanics
    • /
    • v.88 no.4
    • /
    • pp.323-334
    • /
    • 2023
  • The submerged floating tunnel (SFT) infrastructure has been regarded as an emerging technology that efficiently and safely connects land and islands. The SFT route problem is an essential part of the SFT planning and design phase, with significant impacts on the surrounding environment. This study aims to develop an optimization model considering transportation and structure factors. The SFT routing problem was optimized based on two objective functions, i.e., minimizing total travel time and cumulative strains, using NSGA-II. The proposed model was applied to the section from Mokpo to Jeju Island using road network and wave observation data. As a result of the proposed model, a Pareto optimum curve was obtained, showing a negative correlation between the total travel time and cumulative strain. Based on the inflection points on the Pareto optimum curve, four optimal SFT routes were selected and compared to identify the pros and cons. The travel time savings of the four selected alternatives were estimated to range from 9.9% to 10.5% compared to the non-implemented scenario. In terms of demand, there was a substantial shift in the number of travel and freight trips from airways to railways and roadways. Cumulative strain, calculated based on SFT distance, support structure, and wave energy, was found to be low when the route passed through small islands. The proposed model helps decision-making in the planning and design phases of SFT projects, ultimately contributing to the progress of a safe, efficient, and sustainable SFT infrastructure.