• 한국경영과학회지
• /
• 제25권4호
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.201-204
• /
• 1997

This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2002년도 추계학술대회논문집
• /
• pp.743-748
• /
• 2002

The eventual Purpose of this research is to make optimum standards for acoustic-environment by using not only physical characteristics but also subjective appraisals. Basic physical data were measured which were necessary to establish standards for acoustic environment in campus buildings, TSP has used to measure sound levels, reverberation times, clearness indexes, and speech-transmission-index. In addition to physical characteristics, questionnaires were given to university students to given subjective appraisals. For instance, questions about volume or clearness of lectures. The relevancy between physical characteristics and subjective appraisals was studied.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.328-338
• /
• 1994

TSP(Traveling Salesman Problem) is a famous problem in Operations Research fields due to its applicability to various problems. It is also well-known that the problem is hard to solve in reasonable time, since it is in the NP-Complete class. Hence it is desired to develop heuristics which have polynominal complexity and also solve the problem to near-optimality. This paper presents a heuristic algorithm for TSP using the concept of dynamic programming. The proposed method has the complexity of O(N$\^$3/), and gives improved solutions than other well-known algorithms in our extensive computational experiments.

• 한국대기환경학회지
• /
• 제18권3호
• /
• pp.247-252
• /
• 2002

In this technical information, the TSP measurement data at Gosan between 1992 and 1999 are presented and analyzed. The average ratio of N $O_3$$^{[-10]}$ /nss-S $O_4$$^{2-}$ is highest in March. The annual average ratio concentration of N $O_3$$^{[-10]}$ increased and it was found that the annual average ratio of N $O_3$$^{[-10]}$ /nss-S $O_4$$^{2-}$ increased during the period, probably due to the change of emission characteristics of China.

• 한국대기환경학회지
• /
• 제5권1호
• /
• pp.22-32
• /
• 1989

In order to assess the level of atmospheric pollution and to contribute the health improve ment of residents in Pusan, the authors measured the $CO, SO_2, NO_2, TSP, Noise, Pb, Cd, Cr and V$ level at 3 place by time from Jan. 1988 to Feb. 1988. THe places were Kukje, Daehyeon, Pujeon underground commercial floor. The results were as follows; 1. The range of concentration of air pollutants (1) CO : 0.5 - 3.0 ppm (2) $SO_2$ : 0.012 - 0.360 ppm (3) $NO_2$ : 0.018 - 0.089 ppm (4) TSP : 30 - 330 $\mug/m^3$ (5) Pb : 0.219 - 3.116 $\mug/m^3$ (6) Cd : 0.000 - 0.070 $\mug/m^3$ (7) Cr : 0.378 - 4.098 $\mug/m^3$ (8) V : 0.000 - 1.010 $\mug/m^3$ (9) Noise : 47 - 77 dB(A) 2. The level of all air pollutants were higher in the afternoon or night than in the morning. 3. The mean concentration of $SO_2$ in all places exceede the ambient air quality standard of $SO_2$,.

• 대한산업공학회지
• /
• 제36권2호
• /
• pp.78-86
• /
• 2010

The traveling purchaser problem(TPP) is a generalization of the well-known traveling salesman problem(TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem(VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a review of the TPP. The purpose of this paper is to review the TPP and to describe solution procedures proposed for this problem. We also introduce the ILP formulation for the multiple TPP(mTPP) which is generalized type of TPP. We compare the system performance according to change from TPP to mTPP.

• 한국대기환경학회지
• /
• 제10권3호
• /
• pp.191-196
• /
• 1994

Concentration of particulate nitrate originated from sea salt in ambient air was determined from February to October 1993. Sampling was carried out using a two-stage Anderson air sampler at the top of a five-story building located at Kon-Kuk University in Seoul. Concentration of NaNO$_3$, which originated from sea salt was highest in spring time and lowest in summer the and the concentration range was between 0.10 and 0.66 $\mu\textrm{g}$/㎥. NaNO$_3$/TSP ratio was very low 0.05~0.39%) indicating that the portion of NaNO$_3$ in TSP was negligible.

• International Journal of Aeronautical and Space Sciences
• /
• 제18권4호
• /
• pp.767-779
• /
• 2017

Automated mission planning for unmanned aerial vehicles (UAVs) is difficult because of the propagation of several sources of error into the solution, as for any large scale autonomous system. To ensure reliable system performance, we quantify all sources of error and their propagation through a mission planner for operation of UAVs in an obstacle rich environment we developed in prior work. In this sequel to that work, we show that the mission planner developed before can be made robust to errors arising from the mapping, sensing, actuation, and environmental disturbances through creating systematic buffers around obstacles using the calculations of uncertainty propagation. This robustness makes the mission planner truly autonomous and scalable to many UAVs without human intervention. We illustrate with simulation results for trajectory generation of multiple UAVs in a surveillance problem in an urban environment while optimizing for either maximal flight time or minimal fuel consumption. Our solution methods are suitable for any well-mapped region, and the final collision free paths are obtained through offline sub-optimal solution of an mTSP (multiple traveling salesman problem).

• 농촌계획
• /
• 제5권1호
• /
• pp.20-25
• /
• 1999

Our interest in this paper is in the efficient computation of a good low bound for the traveling salesman problem and is in the application of a network problem in agriculture. We base our approach on a relatively new formulation of the TSP as a two-commodity network flow problem. By assigning Lagrangian multipliers to certain constraints and relaxing them, the problem separates into two single-commodity network flow problems and an assignment problem, for which efficient algorithms are available.