• 제목/요약/키워드: Delivery problem

검색결과 720건 처리시간 0.022초

제왕절개분만 산욕부와 신생아의 가정간호 사례분석 (A Case Analysis of Home Health Care for Cesarean Postpartum Women and Their Newborns)

  • 김혜숙;최연순;전은미
    • 대한간호학회지
    • /
    • 제24권4호
    • /
    • pp.696-705
    • /
    • 1994
  • This study was done to provide a basis for home health care management for women following Cesarean delivery. Furthermore it was initiated as an possible application of home health care in the future. In this study, client selection criteria was developed by the researcher and assessment tools for home health care, recording system and problem oriented recording system were revised from Jun's(1993) methods. The selection criteria tool for home health care for women who had a Cesarean delivery was structured and consisted of five areas : physical status, functional status, psychological-emetional status, educational needs status and environmental status. The structured assessment tool consisted of general items, obstetric history, past medical history, methods of feeding, medications taken before ad-mission, laboratory results, discharge instructions, discharge medications, family tree, economic status, environmental status, a map, health assessment of women and their newborns. The visit note consisted of the date : nursing problems : nursing process including initial assessment : nursing goals : visit plan : health status of the postpartum women and their newborn : nursing diagnoses : nursing implementation evaluation : summary : next visit plan and revision. The problem oriented recording system consisted of the date, problem numbers, nursing diagnoses, problem appearance date, problem resolution date. The results of the research are as follows : The seven cases having had a Cesarean delivery were discharged on an average on the 5th day after the Cesarean birth. The total number of home visits was 13. According to Cordon's functional health patterns the total possible nursing diagnoses was 34 diagnoses for the methers and their newborns. Among the 34 diagnoses, there were 13 diagnoses in the health perception /management pattern, 7 in the psychosocial health perception / management pattern, 8 in the psychosocial self-perception, 2 in the nutrition / metabolism pattern of physical function, 2 in the knowledge deficit of newborn management, anxiety related to newborn management, knowledge deficit related to disease process of new-born, anxiety related to disease process of newborn anxiety related to prognosis of baby's condition, knowledge deficit related to newborn jaundice each appeared once. The changes in the number of nursing diagnoses was related to not the number of visits but to the number of nursing diagnoses decreasing. The con-tent of the home health care was categorized ac-cording to assessment, direct care, counseling, education, family care. The recommendation based on the results of this research are Home health care nurses for Cesarean postpartum women and their neonates requires comprehensive knowledge of pregnancy, delivery, and the postpartum period and of the neonate so that they can provide appropriate care and holistic views. Most of cases terminated after the second visit, this outcome may be related to the subjects being discharged on the 5th day after delivery. Therefore, study done with earlier discharge after delivery may have different outcome. It is very hard to assess psychological aspects that need follow-up and to develop communication channels.

  • PDF

물품보관소 위치를 고려한 차량경로문제 최적화 (Optimization for Vehicle Routing Problem with Locations of Parcel Lockers)

  • 김기태
    • 산업경영시스템학회지
    • /
    • 제45권4호
    • /
    • pp.134-141
    • /
    • 2022
  • Transportation in urban area has been getting hard to fulfill the demand on time. There are various uncertainties and obstacles related with road conditions, traffic congestions, and accidents to interrupt the on-time deliveries. With this situation, the last mile logistics has been a keen issue for researchers and practitioners to find the best strategy of the problem. A way to resolve the problem is to use parcel lockers. Parcel locker is a storage that customers can pick up their products. Transportation vehicles deliver the products to parcel lockers instead of all customer sites. Using the parcel lockers, the total delivery costs can be reduced. However, the inconvenience of customer has to increase. Thus, we have to optimal solution to balance between the total delivery costs and customers' inconvenience. This paper formulates a mathematical model to find the optimal solution for the vehicle routing problem and the location problem of parcel lockers. Experimental results provide the viability to find optimal strategy for the routing problem as well as the location problem.

효율적 제조자원의 활용을 고려한 생산일정 및 납기일 결정기법 (Simulation-based Delivery Date Determination Algorithm)

  • 박창규
    • 경영과학
    • /
    • 제17권2호
    • /
    • pp.125-134
    • /
    • 2000
  • Keeping the promised delivery date for a customer order is crucial for a company to promote customer satisfaction and generate further businesses. For this, a company should be able to quote the delivery date that can be achieved with the capacity available on the shop floor. In a dynamic make-to-order manufacturing environment, the problem of determining a delivery date for an incoming order with consideration of resource capacity, workload, and finished-product inventory can hardly be solved by an analytical solution procedure. This paper considers a situation in which a delivery date for a customer order is determined based on a job schedule, and presents the SimTriD algorithm that provides the best scheduling for determining a delivery date of customer order through the job schedule that efficiently utilizes manufacturing resources with consideration of interacting factors such as resource utilization, finished-product inventory, and due date.

  • PDF

컨테이너 운송체계 개선을 위한 화물수거-배송계획 시스템 개발 (GIS-based Pickup-Delivery Scheduling Model for Container Transportation)

  • 윤항묵;황흥석;김형보
    • 한국항해항만학회지
    • /
    • 제29권3호
    • /
    • pp.221-226
    • /
    • 2005
  • 본 연구는 화물 운송 문제에 GIS 기법을 응용하여 화물의 수거 및 배송문제를 개선한 논문이다. 최근 국내 물류업체들은 인터넷을 기반으로 주문, 검색 및 화물의 추적 등을 온라인상에서 실행토록 하는 방법을 중시하게 되었다. 국내외 배송 관련 기업들은 빠른 서비스를 요 구하는 긴급주문의 비중이 커 가는 시장변환에 대처해서, 서비스 능력의 향상과 효율적인 차량관리를 위해서 GPS와 TRS 등의 정보통신기술을 이용하여, 기업의 배차업무를 개선하려고 노력하고 있다. 하지만 아직까지 배차 담당자의 의사결정을 지원할 수 있는 배차기법에 대한 연구는 거의 이루어지지 않고 있는 것이 현 실정이다, 본 연구에서는 GIS기반 하에서의 거리산정방법을 제안하고 이를 이용하여 차량운송 및 수거계획 알고리즘을 개발하였다. 또한 본 연구에서는 차량 및 화물정보를 GIS환경에서 실시간으로 조회해 볼 수 있도록 하였으며, 입출력자료와 차량 및 화물정보 조회결과를 GIS환경에서 구현하도록 하였다. 사용자들을 위하여 GUI-type 프로그램을 개발하고 실 예제를 통하여 Sample 출력을 보였다. 본 연구의 결과는 추후 약간의 수정 보완을 통하여 실제 물류센터에서의 운송계획 작성시 바로 적용할 수 있을 것이라고 판단된다.

시간단위 차량통행 속도정보의 활용을 위한 구역분할 방법의 연구 (A Study on Area Division Method to use the Hour-based Vehicle Speed Information)

  • 박성미;문기주
    • 산업경영시스템학회지
    • /
    • 제33권4호
    • /
    • pp.201-208
    • /
    • 2010
  • This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.

Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery

  • Zhai, Shuai;Mao, Chao
    • 유통과학연구
    • /
    • 제10권12호
    • /
    • pp.19-24
    • /
    • 2012
  • Purpose - This paper discusses the heterogeneous fixed fleet vehicle routing problem with pick-up and delivery (HFFVRPPD), for vehicles with different capacities, fixed costs, and travel costs. Research Design, data, methodology - This paper made nine assumptions for establishing a mathematical model to describe HFFVRPPD. It established a practical mathematical model, and because of the non-deterministic polynomial-time hard (NP-hard), improved the traditional simulated annealing algorithm and tested a new algorithm using a certain scale model. Result - We calculated the minimum cost of the heterogeneous fixed fleet vehicle routing problem (HFFVRP) with a single task and, on comparing the results with the actual HFFVRP for the single task alone, observed that the total cost of HFFVRPPD reduced significantly by 46.7%. The results showed that the new algorithm provides better solutions and stability. Conclusions - This paper, by comparing the HFFVRP and HFFVRPPD results, highlights certain advantages of using HFFVRPPD in physical distribution enterprises, such as saving distribution vehicles, reducing logistics cost, and raising economic benefits.

  • PDF

컴퓨터 시뮬레이션 활용 수업이 학습자의 문제 해결력과 동기에 미치는 영향 (The Effects of Simulation Delivery Instruction on Students' Problem Solving Performance and Motivation)

  • 이영민
    • 컴퓨터교육학회논문지
    • /
    • 제8권5호
    • /
    • pp.43-50
    • /
    • 2005
  • 본 연구에서는 두 가지 수업 방식 (강의 중심 수업과 컴퓨터 시뮬레이션을 활용한 수업)이 학습자의 구조화된 문제 해결력과 비구조화된 문제 해결력 및 동기 수준에 미치는 영향을 탐색하였다. 29명의 공과대 학생이 연구에 참여하였고 반복 측정 설계법이 적용되었다. 연구 결과, 컴퓨터 시뮬레이션을 활용한 수업은 학습자의 비구조화된 문제 해결력에 유의미한 영향을 주는 것으로 나타났다. 그러나 동기 하위 수준중에는 관련성 요인에만 유의미한 영향을 주는 것으로 나타났다.

  • PDF

시간제약하 배달과 수거를 동시에 수행하는 차량경로문제를 위한 개미군집시스템 (Ant Colony System for Vehicle Routing Problem with Simultaneous Delivery and Pick-up under Time Windows)

  • 이상헌;김용대
    • 대한산업공학회지
    • /
    • 제35권2호
    • /
    • pp.160-170
    • /
    • 2009
  • This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

  • Chung, Jibok;Choi, Byungcheon
    • 유통과학연구
    • /
    • 제15권7호
    • /
    • pp.35-41
    • /
    • 2017
  • Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

적시생산시스템에서 납기와 생산효율성을 고려한 Scheduling (A Study on Scheduling Considering Delivery and Production Efficiency in the JIT Systems)

  • 김정
    • 산업융합연구
    • /
    • 제5권2호
    • /
    • pp.21-32
    • /
    • 2007
  • This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

  • PDF