• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.5 no.2
• /
• pp.105-118
• /
• 2000

Anchored measurements (12.5 hr) of suspended sediment concentration and other hydrodynamic parameters were carried out at two stations located at the entrance to Hampyung Bay in summer (August 1999). Tidal variations in water temperature and salinity were in the range of 26.0-27.9$^{\circ}C$ and 30.9-31.5, respectively, indicating exchange offshore and offshore water mass. Active tidal mixing processes at the entrance appear to destroy the otherwise vertical stratification in temperature and salinity in spite of strong solar heating in summer. On the contrary, suspended sediment concentrations show a marked stratification with increasing concentrations toward bottom layer. Clastic particles in suspended sediments consist mostly of very fine to fine silt (4-16 ${\mu}$m) with a poorly-sorted value of 14.7-25.9 ${\mu}$m. However, at slack time with less turbulent energy, flocs larger than 40 ${\mu}$m are formed by cohesion and inter-collision of particles, resulting in a higher settling velocity. Strong ebb-dominated and weak flood dominated tidal currents, in the southwestern and the northeastern part, respectively, result in a seaward residual flow of -10${\sim}$-20 cm $s^{-1}$ at station H1 and a bayward residual flow less than 5.0 cm $s^{-1}$ at station H2. However, mean concentration of suspended sediments at station H1 is higher at flood (95.0-144.1 mg $1^{-1}$) than in ebb (75.8-120.9 mg $1^{-1}$). On the contrary, at the station H2, the trend is reversed with higher concentration at the ebb (84.7-158.4 mg $1^{-1}$) than that at the flood (53.0-107.9 mg $1^{-1}$). As a result, seaward net suspended sediment fluxes ($f_{s}$) are calculated to be -1.7 ${\sim}$-$15.610^{3}$ kg $m^{-2}$ $s^{-1}$ through the whole water column. However, the stations H1 and H2 show definitely different values of the flux with higher ones in the former than in the latter. Alternatively, depth-integrated net suspended sediment loads ($\c{Q}_{s}$) for one tidal cycle are also toward the offshore with ranges of 0.37${\times}$$10^{3}$ kg $m^{-1}$ and 0.21${\times}$$10^{3}$ kg $m^{-1}$, at station H1 and H2, respectively. This seaward transport of suspended sediment in summer suggests that summer-time erosion in the Hampyung muddy tidal flats is a rather exceptional phenomenon compared to the general deposition reported for many other tidal flats on the west coast of Korea.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.