• Title/Summary/Keyword: Transportation Time Constraints

Search Result 74, Processing Time 0.024 seconds

Supplier Selection and Assignment of Order Quantities to suppliers for the Efficient Purchasing Management in Supply Chain Management (공급사슬경영에서의 효율적인 구매 관리를 위한 공급자 선택 및 주문량 할당에 관한 연구)

  • 정주기;이영해
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.99-102
    • /
    • 2000
  • In the supply chain network design, how to select the best location, capacity configuration of the suppliers and to assign manufacturers orders are a challenging issue. Especially when multi-tiers'suppliers are existed, the performance of supply chain is influenced by 2$\^$nd/ and 3$\^$rd/ suppliers. Supplier selection is multi-criteria problem which includes both qualitative and quantitative factors in supply chains. In order to select the best supplier it is necessary to make a trade off between these two factors such as cost, product quality, capacity, production lead time, deliver lead time and transportation lead tine of supplier constraints existed in multi-tiers supplier purchasing chain. In these circumstances, purchasing agents should decide two problems: which is the best supplier in each tier and how much should be purchased from each selected supplier. This research is intended to develop an integration of an analytical hierarchy process (AHP) and mathematical modeling proposed to consider two factors which may be conflicted in choosing the best supplier in each tier and placing the optimum order quantities to the supplier among multi-tiers suppliers.

  • PDF

Shortest Path Problems of Military Vehicles Considering Traffic Flow Characteristics (교통류특성을 고려한 군화물차량군 경로선정)

  • 방현석;김건영;강경우
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.71-82
    • /
    • 2003
  • The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.

A Study on the Transport-related Impacts of Flexible Working Policy using Activity-Based Model (활동기반모형을 이용한 유연근무제의 교통부문 영향 연구)

  • CHO, Sung-Jin;BELLEMANS, Tom;JOH, Chang-Hyeon;CHOI, Keechoo
    • Journal of Korean Society of Transportation
    • /
    • v.35 no.6
    • /
    • pp.511-524
    • /
    • 2017
  • This study aims to evaluate the availability of ABM (Active-Based Model), FEATHERS, as a policy evaluation tool. To achieve the goal, scenario analysis on flexible working policy was conducted to measure its impact on activity-travel behavior. As a consequence, there seems no significant change in worker's daily life, other than mitigating traffic congestion due to decreasing commuting travel in the rush hour. The result of VKT (vehicle kilometers traveled) shows an opposite pattern according to given household/individual constraints. The scenario analysis on telecommuting indicates a decreasing trend in both travel frequency and distance because of the diminished number of commuting trips. As the activity space of telecommuters is shifted to a residential area, there are more short-distance trips by using non-motorized transport, which leads to decrease in VKT (using a private vehicle). Thus, the sensitivity of VKT by population groups varies due to transport mode shift (between personal and another mode) and growing non-work trips (using a private mode). This study found few things. First, it is necessary to evaluate the details of policy impact by population groups since it can be varied depending on household/individual characteristics. Second, the case study shows a promising performance of ABM as policy measurement that provides reality in policy evaluation. Third, ABM allows us to do more accurate analysis (i.e. time-series analysis by population groups) of policy assessment than those of FSM (Four-Step Model). Lastly, a further effort in data collection, literature review, and expert survey should be made to enhance the accuracy and confidence of future research.

Evaluation of Onshore Wind Resource Potential According to the Road Proximity (도로인접성에 따른 육상 풍력자원 잠재량 평가)

  • Kim, Hyun-Goo;Hwang, Hyo-Jung;Kang, Yong-Heack;Yun, Chang-Yeol
    • New & Renewable Energy
    • /
    • v.9 no.4
    • /
    • pp.13-18
    • /
    • 2013
  • Wind turbines should generally be installed at a certain distance from a road to ensure passengers' safety. In Korea, there is no clear guidance as the Ministry of Environment first proposed a road setback distance of 400 m in the Onshore Wind Farm Siting Guidelines draft proposed in July 2012, and then modified it to 1.5 times the height of the wind turbine in October of the same year. This study analyzed the dynamic range of onshore wind resource potential according to how the road setback distance is set using the Korea Wind Atlas with 100m spatial resolution made by the Korea Institute of Energy Research, the transportation network of the Ministry of Construction and Transportation, and the forest road network of the Korea Forestry Service. Owing to the geographical characteristics of Korea, where mountainous terrain accounts for 70% of the total territory, the wind resource potential within 1 km from forest roads are estimated to be 14.3 GW, 14% of Korea's total wind resource potential. In addition, the construction distance of new road for transporting wind turbines from the existing road to a wind farm site is estimated as less than 2 km. Given the limited wind resource potential and geographical constraints, an assessment system that can maximize wind resource utilization and ensure road safety at the same time, and which takes into account the regional characteristics instead of applying the fixed road setback distance across-the-road, is required.

Optimal Life Cycle Cost Design of a Bridge (교량의 생애주기비용 최적설계)

  • Park, Jang-Ho;Shin, Yung-Seok
    • Journal of the Korean Society of Safety
    • /
    • v.25 no.6
    • /
    • pp.115-122
    • /
    • 2010
  • The importance of the life cycle cost (LCC) analysis for bridges has been recognized over the last decade. However, it is difficult to predict LCC precisely since the costs occurring throughout the service life of the bridge depend on various parameters such as design, construction, maintenance, and environmental conditions. This paper presents a methodology for the optimal life cycle cost design of a bridge. Total LCC for the service life is calculated as the sum of initial cost, damage cost, maintenance cost, repair and rehabilitation cost, user cost, and disposal cost. The optimization method is applied to design of a bridge structure with minimal cost, in which the objective function is set to LCC and constraints are formulated on the basis of Korean Bridge Design Code. Initial cost is calculated based on standard costs of the Korea Construction Price Index and damage cost on damage probabilities to consider the uncertainty of load and resistance. Repair and rehabilitation cost is determined using load carrying capacity curves and user cost includes traffic operation costs and time delay costs. The optimal life cycle cost design of a bridge is performed and the effects of parameters are investigated.

Personalized Itinerary Recommendation System based on Stay Time (체류시간을 고려한 여행 일정 추천 시스템)

  • Park, Sehwa;Park, Seog
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.38-43
    • /
    • 2016
  • Recent developments regarding transportation technology have positioned travel as a major leisure activity; however, trip-itinerary planning remains a challenging task for tourists due to the need to select Points of Interest (POI) for visits to unfamiliar cities. Meanwhile, due to the GPS functions on mobile devices such as smartphones and tablet PCs, it is now possible to collect a user's position in real time. Based on these circumstances, our research on an automatic itinerary-planning system to simplify the trip-planning process was conducted briskly. The existing studies that include research on itinerary schedules focus on an identification of the shortest path in consideration of cost and time constraints, or a recommendation of the most-popular travel route in the destination area; therefore, we propose a personalized itinerary-recommendation system for which the stay-time preference of the individual user is considered as part of the personalized service.

Determination of bearing type effect on elastomeric bearing selection with SREI-CAD

  • Atmaca, Barbaros;Ates, Sevket
    • Advances in Computational Design
    • /
    • v.2 no.1
    • /
    • pp.43-56
    • /
    • 2017
  • The aim of this paper is to develop software for designing of steel reinforced elastomeric isolator (SREI) according to American Association for State Highway and Transportation Officials Load and Resistance Factor Design (AASHTO LRFD) Specifications. SREI is used for almost all bridge types and special structures. SREI-structures interface defines support boundary conditions and may affect the seismic performance of bridges. Seismic performance of the bridge is also affected by geometrical and materials properties of SREI. The selection of SREI is complicated process includes satisfying all the design constraints arising from code provisions and maximizing performance at the lowest possible cost. In this paper, design stage of SREI is described up to AASHTO LRFD 2012. Up to AASHTO LRFD 2012 analysis and design program of SREI performed different geometrical and material properties are created with C# object-oriented language. SREI-CAD, name of the created software, allows an accurate design for economical estimation of a SREI in a short time. To determine types of SREI effects, two different types of bearings, rectangular and circular with similar materials and dimension properties are selected as an application. Designs of these SREIs are completed with SREI-CAD. It is seen that ensuring the stability of circular elastomer bearing at the service limit state is generally complicated than rectangular bearing.

Design and Implementation of A Brokering System for Ships and Cargos (선박과 화물에 대한 중개 시스템의 설계 및 구현)

  • Seo Sang-Koo;Yoon Kyung-Hyun
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.1
    • /
    • pp.49-68
    • /
    • 2005
  • It is one of the crucial components of electronic logistics systems to manage logistics information of cargos and transportation companies and to mediate appropriate brokerage between them. Due to the advance of e-Commerce technologies many kinds of logistics transactions can be handled by means of EDI or XML/EDI applications. but the brokering processing relies mostly on the traditional processes and the research in this field is still at the initial stage. In this paper we study a logistics brokering system for ships and cargos and describe the design and implementation of the system. We analyze the brokering constraints for logistics of cargos and ships and construct an optimization model for their brokering. We also suggest a brokering procedure and a simple heuristic algorithm with respect to the proposed matching criteria. The experimental result shows that the proposed greedy-based heuristic algorithm performs very well. In its response time the proposed algorithm executed within a couple of seconds independently of the number of cargos and the container capacities of ships. The output of the algorithm is very close to that of the optimal solution. showing higher than 95% of approximation. The proposed system is implemented for the Web environment using JSP and PL/SQL.

  • PDF

Optimization of Long-term Generator Maintenance Scheduling considering Network Congestion and Equivalent Operating Hours (송전제약과 등가운전시간을 고려한 장기 예방정비계획 최적화에 관한 연구)

  • Shin, Hansol;Kim, Hyoungtae;Lee, Sungwoo;Kim, Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.2
    • /
    • pp.305-314
    • /
    • 2017
  • Most of the existing researches on systemwide optimization of generator maintenance scheduling do not consider the equivalent operating hours(EOHs) mainly due to the difficulties of calculating the EOHs of the CCGTs in the large scale system. In order to estimate the EOHs not only the operating hours but also the number of start-up/shutdown during the planning period should be estimated, which requires the mathematical model to incorporate the economic dispatch model and unit commitment model. The model is inherently modelled as a large scale mixed-integer nonlinear programming problem and the computation time increases exponentially and intractable as the system size grows. To make the problem tractable, this paper proposes an EOH calculation based on demand grouping by K-means clustering algorithm. Network congestion is also considered in order to improve the accuracy of EOH calculation. This proposed method is applied to the actual Korean electricity market and compared to other existing methods.

Heuristics for Rich Vehicle Routing Problem : A Case of a Korean Mixed Feed Company (다특성 차량경로문제에 대한 휴리스틱 알고리즘 : 국내 복합사료 업체 사례)

  • Son, Dong Hoon;Kim, Hwa-Joong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.1
    • /
    • pp.8-20
    • /
    • 2019
  • The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.