• 한국경영과학회지
• /
• 제19권3호
• /
• pp.63-79
• /
• 1994

Many vehicle fleet planning systems have been suggested to minimize the routing distances of vehicles or reduce the transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to vehicle fleet planning system. This paper is considered multi-objective optimization. The vehicle fleet planning system developed by this study involves such complicated and restricted conditions as one depot, multiple nodes (demand points), multiple vehicle types, multipel order items, and other many restrictions for operating vehicles. The proposed algorithm is compared with the nearest neighbor heuristic (NNH) and the savings heuristic (SAH) algorithm in terms of total logistics cost and driving time. This method constructs a route with a minimum number of vehicles for a given demand. This method can be used to any companys which vehicle fleet planning system under circumstances considered in this paper.

• 한국대기환경학회지
• /
• 제28권4호
• /
• pp.396-410
• /
• 2012

The purpose of this study is to quantify the contribution of high emitting vehicles to mobile emission inventories. Analyzed emission data include $NO_x$, HC, and CO results, which were measured through the vehicle Inspection and Maintenance (I/M) program in Seoul metropolitan area. The high emitting vehicles were identified as the top 5% worst polluting cars of the fleet. We estimated that 5% of the gasoline passenger car fleet, which is high emitters, generated 25.5% of $NO_x$, 34.5% of HC, and 66.1% of CO emissions of total inventories for gasoline passenger car fleet in year 2010. In the study, we identified that the older vehicles (older than ten years) and high mileage vehicles (more than 120,000 km driven) comprised high emitter fleet with 70.9% and 71.2%, respectively. The emission contribution of high emitters became larger in younger fleet than in the older fleet. This is due to the reduced emission rates in newly manufactured vehicles, which were developed under the more stringent emission regulation limits. This analysis implies that high emitters could be responsible for an even larger fraction of total vehicular emissions as more advanced technology vehicles are being incorporated into the current vehicle fleet. The findings suggested that the high emitting vehicles should be primarily considered for in-use vehicle emission management program, such as I/M, accelerated vehicle retirement, or catalytic converter replacement, in order to enhance the effectiveness of selected program.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.171-174
• /
• 2000

This paper presents an approach to determine the vehicle fleet size for container shuttle service in a stochastic working environment. The shuttle service can be defined as the repetitive travel between the designated places during working period. The initial number of vehicles is temporarily calculated using the transportation model. Simulation is carried out in order to investigate dynamic behavior of container shuttle. Finally, the equation for estimating the vehicle fleet size is obtained through the multiple regression model based on simulation results.

• International Journal of Reliability and Applications
• /
• 제12권2호
• /
• pp.95-102
• /
• 2011

This paper uses the auto regression model to modeling failure number of a bus fleet. The fitted model can be used to predict the failure number in the future. A numerical example is presented to illustrate the modeling process and the appropriateness of the fitted model. At last, some possible applications of the model are discussed.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.179-184
• /
• 2002

We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.209-215
• /
• 2002

In this paper, we propose a freight and fleet optimization model under CVO environment. The model is a kind of multi commodity network flow model based on Vehicle Routing Problem(VRP) and Vehicle Scheduling Problem(VSP), and considering operations and purposes of CVO. The main purpose of CVO is the freight and fleet management to reduce logistics cost and to Improve in vehicle safety. Thus, the objective of this model is to minimize routing cost of all the vehicle and to find the location of commodities which have origin and destination. We also present some computing test results.

• 한국경영과학회지
• /
• 제36권1호
• /
• pp.27-38
• /
• 2011

In this paper, we deal with the periodic heterogeneous fleet vehicle routing problem (PHVRP). PHVRP is a problem of designing vehicle routes in each day of given period to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited once or more times over the planning horizon according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by assigning the customer-day and the customer-car simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.

• 경영과학
• /
• 제17권2호
• /
• pp.87-95
• /
• 2000

This paper presents two analytical approaches to determine the vehicle fleet size for container shuttle service. The shuttle service can be defined as the repetitive travel between the designated places during working period. In the first approach, the transportation model is adopted in order to determine the number of vehicles required. Its advantages and disadvantages in practical application are also discussed. In the second approach, a logical network which is oriented on job is transformed from a physical network which is focused on demand site. Nodes on the logical network represent jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next job. Then a mathematical formulation is constructed similar to the multiple traveling salesman problem (TSP). A solution procedure is carried out based on the well-known insertion heuristic with the real world data.

• 대한교통학회지
• /
• 제22권2호
• /
• pp.145-154
• /
• 2004

본 논문에서는 실시간으로 화물차량의 위치와 상태정보가 의사결정자에게 전달되며 핸드폰 등을 이용하여 의사결정자와 운전자의 쌍방향 의사소통이 가능한 시스템 하에서 동적으로 들어오는, 즉 미리 알 수 없는 운송의뢰에 대하여 즉각적으로 최적의 차량운행 계획을 수립하고 이를 새로운 정보에 따라 지속적으로 개선할 수 있는 알고리즘을 개발하였다. 이러한 동적 시스템 하에서 운송의뢰의 성격은 TL(truckload)로 한정하였으며 각 화물은 출발지, 도착지 그리고 배송에 대한 시간제약이 주어진다. 의사결정자는 이러한 화물에 대한 정보를 미리 알지 못하며 인터넷이나 전화 등의 매체를 이용하여 운송의뢰가 들어오는 즉시 운송가능여부를 응답하고 주어진 운송의뢰를 최적의 차량에 배당하며 각 차량에 대한 최적의 운송계획을 수립한다. 이러한 차량의 운송계획은 새로운 정보나 상황에 따라 변화할 수 있다. 이러한 동적 문제에 대하여 본 논문에서는 휴리스틱적 방법론과 최적화 기법의 장점을 취합한 2단계 하이브리드 알고리즘을 제시하고 대규모의 차량군을 다룰 수 있는 기법을 개발하였다. 또한 제안된 다양한 알고리즘에 대하여 시뮬레이션을 통한 실험결과를 제시한다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 1999년도 춘계공동학술대회:정보화시대의 지식경영
• /
• pp.15-16
• /
• 1999