• Title/Summary/Keyword: Transportation Time Constraints

Search Result 74, Processing Time 0.03 seconds

SUCCESS FACTORS FOR JIT MANAGEMENT OF PRIMARY COMMODITY SUPPLY CHAINS IN AUSTRALIA

  • Kim, Tae-Ho;Malcolm Wegener
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2004.05a
    • /
    • pp.191-201
    • /
    • 2004
  • Supply chains for agricultural commodities with their various constraints such as production lead time, seasonal production, and methods of storage are limited in the extent to which techniques like Just-in-Time (JIT) inventory management can be applied. It is beyond the ability of producers to control harvest time and many agricultural products are perishable so that they can incur exceptional losses in storage if they are not handled correctly. This is a source of additional costs and inefficiency in supply chain management. The purpose of this study is to reduce or eliminate such sources of loss and inefficiency and to identify success factors for the JIT inventory management system where it can be applied for agricultural products. Where ]IT techniques can be applied in supply chain management for agricultural products, costs such as transportation, inventory, and storage losses can be reduced with concurrent increases in efficiency. In the paper, some of the problems associated with applying ]IT inventory control methods in supply chain management for agricultural commodities will be reported through a series of case studies.

  • PDF

Analysis of Tour Information Services using Agent-based Simulation (시뮬레이션 모형을 통한 관광정보서비스 효과 분석)

  • Kim, Hyeon-Myeong;O, Jun-Seok
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.6 s.92
    • /
    • pp.103-117
    • /
    • 2006
  • This study develops an agent-based simulation model to evaluate tourist information systems under ubiquitous environment. In this study, individual tourist's activity chaining behavior is formulated as a utility maximization problem. The underlying assumption of the model is that tourists increase their activities within their time and budget constraints to maximize their utilities. The model seeks individual's optimal tour schedule by solving Prize-Collecting Multiple-Day Traveling Salesman Problem(PC MD TSP). The simulation-based evaluation framework allows investigating individual utility gains by their information type and the total expenditure at each tour attractions. The real-time tour activity scheduling system enables tourists to optimize their tour activities by minimizing their time loss and maximizing their opportunity to use high utility facilities.

A Model for Analyzing Time-Varying Passengers' Crowdedness Degree of Subway Platforms Using Smart Card Data (스마트카드자료를 활용한 지하철 승강장 동적 혼잡도 분석모형)

  • Shin, Seongil;Lee, Sangjun;Lee, Changhun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.49-63
    • /
    • 2019
  • Crowdedness management at subway platforms is essential to improve services, including the prevention of train delays and ensuring passenger safety. Establishing effective crowdedness mitigation measures for platforms requires accurate estimation of the congestion level. There are temporal and spatial constraints since crowdedness on subway platforms is assessed at certain locations every 1-2 years by hand counting. However, smart cards generate real-time big data 24 hours a day and could be used in estimating congestion. This study proposes a model based on data from transit cards to estimate crowdedness dynamically. Crowdedness was defined as demand, which can be translated into passengers dynamically moving along a subway network. The trajectory of an individual passenger can be identified through this model. Passenger flow that concentrates or disperses at a platform is also calculated every minute. Lastly, the platform congestion level is estimated based on effective waiting areas for each platform structure.

A Model for Integration of Process Planning and Scheduling with Outsourcing in Manufacturing Supply Chain (생산공급사슬에서의 아웃소싱을 고려한 공정계획 및 일정계획의 통합을 위한 모델)

  • Jeong, Chan-Seok;Lee, Young-Hae;Moon, Chi-Ung
    • IE interfaces
    • /
    • v.13 no.3
    • /
    • pp.512-520
    • /
    • 2000
  • An integrated process planning and scheduling model considering outsourcing in manufacturing supply chain is proposed in this paper. The process planning and scheduling considering outsourcing are actually interrelated and should be solved simultaneously. The proposed model considers the alternative process plans for job types, precedence constraints of job operations, due date of production, transportation time and production information for outsourcing. The integrated states include:(1) Operations sequencing, (2) Machine selection, (3) Scheduling with outsourcing under the due date. To solve the model, a heuristic approach based on genetic algorithm(GA) is developed. The proposed approach minimizes the makespan considering outsourcing and shows the best operation-sequences and schedule of all jobs.

  • PDF

Development of a Virtual Cyber-Tour System in the Virtual Reality Environment

  • Jongchel Yoo;Yongbem Kim;MyongKyu Park
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.177-180
    • /
    • 2000
  • This study is to explain the importance and the necessity of virtual cyber-tour in a virtual reality environment, and to present a way of its realization as a mean to surmount the fundamental constraints in current tourism, arising mainly from the individual health, cost, leisure time, and the low perception on tourism culture. This virtual cyber-tour using virtual reality technology will not only provide various indirect tour experiences to the existing tour resources, but also develop a new type of tour system, leading to new worlds which have not been accessible to the Public because of various restrictions coming from the current technology, transportation means, and physical limit's of human body.

  • PDF

A study on the production and distribution problem in a supply chain network using genetic algorithm (유전자 알고리즘을 이용한 공급사슬 네트워크에서의 최적생산 분배에 관한 연구)

  • 임석진;정석재;김경섭;박면웅
    • Journal of the Korea Society for Simulation
    • /
    • v.12 no.1
    • /
    • pp.59-71
    • /
    • 2003
  • Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involves reducing both production and distribution costs. The purpose of this study is to determine the optimum quantity of production and transportation with minimum cost in the supply chain network. We have presented a mathematical model that deals with real world factors and constraints. Considering the complexity of solving such model, we have applied the genetic algorithm approach for solving this model using a commercial genetic algorithm based optimizer. The results for computational experiments show that the real size problems we encountered can be solved in reasonable time.

  • PDF

A GA-based Heuristic for the Interrelated Container Selection Loading Problems

  • Techanitisawad, Anulark;Tangwiwatwong, Paisitt
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.1
    • /
    • pp.22-37
    • /
    • 2004
  • An integrated heuristic approach based on genetic algorithms (GAs) is proposed for solving the container selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem, determining a set of containers to minimize the transportation or shipment cost. The GA for container loading solves for the weighted coefficients in the evaluation functions that are applied in selecting loading positions and boxes to be loaded, so that the volume utilization is maximized. Several loading constraints such as box orientation, stack priority, stack stability, and container stability are also incorporated into the algorithm. In general, our computational results based on randomly generated data and problems from the literature suggest that the proposed heuristic provides a good solution in a reasonable amount of computational time.

Sizing of Powertrain in Fuel Cell Hybrid Vehicles (연료전지 하이브리드 자동차의 동력전달계의 용량 선정)

  • Zheng, Chun-Hua;Shin, Chang-Woo;Park, Yeong-Il;Cha, Suk-Won
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.19 no.6
    • /
    • pp.113-118
    • /
    • 2011
  • Fuel Cell Hybrid Vehicle (FCHV) is one of the most promising candidates for the next generation of transportation. It has many outstanding advantages such as higher energy efficiency and much lower emissions than internal combustion engine vehicles. It also has the ability of recovering braking energy. In order to design an FCHV drive train, we need to determine the size of the electric motor, the Fuel Cell System (FCS), and the battery. In this paper, the methodology for the sizing of these components is introduced based on the driveability constraints of the FCHV. A power management strategy is also presented because the battery energy capacity depends on it. The warm-up time of the FCS is also considered in the power management strategy and the simulation result is compared to that without considering the warm-up time.

A study on the determination of the number of mobility cluster (적정 이동군집수 결정에 관한 연구)

  • ;Ham, Sung Hun
    • Journal of the Korean Geographical Society
    • /
    • v.30 no.2
    • /
    • pp.120-131
    • /
    • 1995
  • To analyze mobility patterns, this study used three Constraint (Capability Constraint, Coupling Constraint, Authority Constraint) models which were proposed in Dr. Hagerstrand's Time-space theory. This paper shows that three constraint models have some effects upon mobility by age. In this study, Capability Constraint means a certain special constraint that is what we can't do during proceeding basic natural urges like sleep, fare, etc. Coupling constraint is a physical one. Each person limits the action range for staying on a special place in special time. For instance, students have to stay in school so that they have mobility constraints. Authority Constraint is a social one. When we use urban facilities or traffic, we may be controlled by mobility sphere by an agreement or a social position. It is social agreement that the opening hour of a store, the time table of mass-transportation and a social positional control that the personal income, the standard of education. In this study it has been in a process of determination of the cluster number that degree of influences a social constraint to mobility. Considering the mobility constraint of characteristics of space divides urban and rural, people in urban area have higher mobility rate than in rural area. Resuets of determination of the cluster, show similar mobility pattern. People in urban area are connected verity of mobility which related to urban space structures with determination of cluste-number. That is to say, mobility patterns can be changed by space charactcristics. Constraints by sex and age are also social constraints and they are influenced by mobility patterns. For instance, females at the age of twenties have similar mobility pattern to the same age male but they have sudden changes after thirty's age. Male entertains a similar pattern without restriction of age. That is to say, management by sex as a social constraint affects mobility. To establish more realistic traffie policy, mobility formation should be reflected to the space in a view of social-behavioral science. To embody this, some problems should be investigated as follows. 1. As a problem of methodology, if sufficient samples ensured, we could subdivide clusters and could open up a new method of analyzing the mobility clusters by using the neuro-network. 2. Extracting actions connected with mobility and finding life cycle which is classified by daily cluste-characteristics, suitable counterproposal could be presented to the traific policy.

  • PDF

Model Development for Machining Process Sequencing and Machine Tool Selection (가공 순서 결정과 기계 선택을 위한 모형 개발)

  • Seo, Yoon-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.3
    • /
    • pp.329-343
    • /
    • 1995
  • Traditionally, machining process sequence was influenced and constrained by the design information obtained from CAD data base, i.e., class of operations, geometric shape, tooling, geometric tolerance, etc. However, even though all the constraints from design information are considered, there may exist more than one way to feasibly machine parts. This research is focused on the integrated problem of operations sequencing and machine tools selection in the presence of the product mix and their production volumes. With the transitional costs among machining operations, the operation sequencing problem can be formulated as a well-known Traveling Salesman Problem (TSP). The transitional cost between two operations is expressed as the sum of total machining time of the parts on a machine for the first operation and transportation time of the parts from the first machine to a machine for the second operation. Therefore, the operation sequencing problem formulated as TSP cannot be solved without transitional costs for all operation pairs. When solved separately or serially, their mutual optima cannot be guaranteed. Machining operations sequencing and machine tool selection problems are two core problems in process planning for discretely machined parts. In this paper, the interrelated two problems are integrated and analyzed, zero-one integer programming model for the integrated problem is formulated, and the solution methods are developed using a Tabu Search technique.

  • PDF