• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 춘계학술발표논문집 (상)
• /
• pp.317-320
• /
• 2003

본 논문에서는 각 도시마다 가중치가 있는 City domain을 tour하기 위한 문제를 해결하기 위해 Simulated Annealing Algorithm을 확장한 알고리즘을 제시하였고 Capacitated vehicle routing problem을 변형한 Augmented multiple salesman traveling problem을 정의하고 이를 해결하기 위한 에너지 함수와 알고리즘을 제시하였다.

• 산업공학
• /
• 제21권3호
• /
• pp.343-353
• /
• 2008

Vendor-managed inventory(VMI) is a supply chain strategy to improve the inventory turnover and customer service in supply chain management. Unfortunately, many VMI programs fail because they simply transfer the transactional aspects of placing replenishment orders from customer to vendor. In fact, such VMI programs often degrade supply chain performance because vendors lack capability to plan the VMI operations effectively in an integrated way under the dynamic, complex, and stochastic VMI supply chain environment. This paper presents a decision support system, termed DSSV, for VMI in the retail supply chain. DSSV supports the market forecasting, vendor's production planning, retailer's inventory replenishment planning, vehicle routing, determination of the system operating parameter values, retailer's purchase price decision, and what-if analysis. The potential benefits of DSSV include the provision of guidance, solution, and simulation environment for enterprises to reduce risks for their VMI supply chain operations.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권4호
• /
• pp.212-221
• /
• 2022

Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

• 대한교통학회지
• /
• 제28권5호
• /
• pp.91-106
• /
• 2010

최근 유류비와 도로혼잡의 증가, 환경오염에 대한 높은 관심으로 인하여 공급체인에서 수송부분에 대한 다양한 이슈가 제시되고 있다. 특히, 공급자와 소매상에 유리한 전략들이 운송회사 입장에서도 반드시 유리하지 않다는 이슈가 제시되면서 다양한 연구가 시도되기 시작하였다. 그러므로 본 연구에서는 전통적인 공급체인분석 관점에서 벗어나 운송회사 입장에서 재고전략 및 네트워크 구성에 따른 공급체인의 운영특성을 파악하고, 그에 따른 운송회사의 운영환경을 해석하고자 한다. 분석방법은 가상의 공급체인을 구성하고, 각 네트워크(분산형, 집중형)구성에서 EOQ재고전략(Economic Order Quantity)과 POQ재고전략(Periodic Order Quantity)에 따른 배송차량의 운영특성(배송차량의 적재율, 소요대수, 운행시간 등)을 TranCAD프로그램을 이용하여 분석하였다. 분석결과, 재고전략이 EOQ 재고전략에서 POQ 재고전략으로 바뀌면 운송회사가 보유해야 하는 배송차량과 운전자의 수를 줄일 수 있었으며, 차량 운행시간이 감소하였다. 또한 네트워크 구성이 분산형에서 집중형으로 변경되면 차량 적재율이 향상되고 차량 운행시간이 감소하였다. 즉, 운송회사 입장에서는 분산형 네트워크에서 EOQ 재고전략을 이용하는 것보다는 집중형 네트워크를 구성하고 POQ 재고전략을 이용하는 것이 유리하다는 사실을 확인 할 수 있었으며, 이러한 효과는 월 1,300만원의 고정비와 월 260만원의 변동비 절감효과를 가져왔다.

• 한국멀티미디어학회논문지
• /
• 제17권2호
• /
• pp.191-199
• /
• 2014

도심에서의 VANET 통신을 위한 유니캐스팅 라우팅은 사용자 편의를 위해 매우 중요한 요소 기술이다. 유니캐스팅을 위해서는 적절한 경로로 패킷이 전달되어야 하는데 차량노드에서 활용 가능한 라우팅 관련정보에 한계가 있어 많은 문제가 발생한다. 특히 경로 재탐색 시 이미 실패한 경로를 다시 선택하고, 동일한 과정을 거쳐 또 다시 이전 실패 경로를 선택하게 되는 실패 경로 재 선택의 문제가 최종 패킷 전달 실패의 원인이 된다. 본 논문에서는 이러한 문제를 해결할 수 있는 VANET 유니캐스팅 라우팅의 경로 재탐색 기능강화 방안을 제안한다. 제안하는 경로 재탐색 기능은 이미 실패한 경로 정보를 패킷에 저장하여 경로 재탐색시 활용하도록 한다. 소스 라우팅을 기반으로 하는 기존의 VANET 라우팅 기법과의 성능 비교에서 제안한 방식의 우수성을 알 수 있다.

• 한국항해항만학회지
• /
• 제29권2호
• /
• pp.141-146
• /
• 2005

For a long time, genetic algorithms have been recognized as a new method to solve difficult and complex problems and the performance of genetic algorithms depends on genetic operators, especially crossover operator. Various problems like the traveling salesman problem, the transportation problem or the job shop problem, in logistics engineering can be modeled as a sequencing problem This paper proposes modified genetic crossover operators to be used at various sequencing problems and uses the traveling salesman problem to be applied to a real world problem like the delivery problem and the vehicle routing problem as a benchmark problem Because the proposed operators use parental information as well as network information, they could show better efficiency in performance and computation time than conventional operators.

• 한국항해항만학회지
• /
• 제30권7호
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• 산업경영시스템학회지
• /
• 제35권2호
• /
• pp.189-195
• /
• 2012

Parcel delivery services are a bit different from general vehicle routing problems since the services require a deliver's walking time to give the parcel to the customer. This time takes more than 1/4 of total delivery time, but it is ignored for the convenience of algorithm design in general. The walking time is too big to be ignored if we need to estimate necessary delivery time precisely as much as possible, or to design a heuristic with varying vehicle moving speeds in metropolitan area. For these reasons, the walking times are surveyed and analyzed to use on the design of VRP heuristic for parcel delivery services in this research.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.153-168
• /
• 1994

This paper is concerned with the development of tree-search algorithm for the exact solution to the vehicle problem (VRP), where set of vehicles of known capacity based at depot, have to be routed in order to supply customers with known requirements. When is required is to design routes, so that the total cost (i. e. total route length or time duration, ect.) is minimized. For obtianing the exact solution, the most important factors are the value of bound and branching strategy. Using the bound based on with bound ascent procedures from subgradient and state-space ascents, the incorporation of bounds into tree search algorithm to solve the problem is shown. Computational results of the corresponding algorithm show that VRPs with up to 40 customers can be solved optimally with this algorithm.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.559-580
• /
• 1997

It is essential to construct on efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System(AGVS) ploys a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs became complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for partitioning the AGV system by introducing the concept of Central Path. This method named Central Path design has advantages, since each partitioned workstation group is served by one AGV and the material handling between groups is performed by special AGV that is used for the Central Path. Therefore the congestion problems never occur. Furthermore Central Path Design has a high flexibility for alteration and extension of system. Finally, we demonstrate its efficiency using simulation.