• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.6D
• /
• pp.859-869
• /
• 2008

These days, almost every industry's production line has become automatic and this phenomenon brought a lot of benefits such as increase in productivity and economical effect, assurance in industrial safety, better quality and compatibility. However, unlike industrial production line, in construction industry, automation has number of barriers like uncertainty incidents and intellectual judgment to make ability to make solution out of it. Therefore construction industry is still demanding use of construction machine through labor. Due to this matter operational labor in construction industry is aging and fading. To solve these problem, in developed nations like Europe, US or Japan are keep researching for the automation in construction and road pavement, strengthening and some other simple operations have been worked through automation but in civil engineering site, automation research is still low despite of its importance in constructional site. For automating civil engineering operation, effective operational plan have to be set by analyzing ground information acquainted. If skillful worker apply heuristics, trial & error can be reduced with increased safety and the effective work plan can be established. Hence, this research will introduce Intellectual Task Planning System for Intelligent Excavating System's effective work plan and heuristics applied in each steps.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.51-62
• /
• 2013

This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

• Advances in Computational Design
• /
• v.1 no.4
• /
• pp.315-327
• /
• 2016

Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.116-121
• /
• 2014

This paper discusses computer-generated heuristics for motion planning. Planning with many degrees of freedom is a challenging task, because the complexity of most planning algorithms grows exponentially with the number of dimensions of the problem. A well-designed heuristic may greatly improve the performance of a planning algorithm in terms of the computation time. However, in recent years, with increasingly challenging high-dimensional planning problems, the design of good heuristics has itself become a complicated task. In this paper, we present an approach to algorithmically develop a heuristic for motion planning, which increases the efficiency of a planner in similar environments. To implement the idea, we generalize modern motion planning algorithms to an extent, where a heuristic is represented as a set of random variables. Distributions of the variables are then analyzed with computer learning methods. The analysis results are then utilized to generate a heuristic. During the experiments, the proposed approach is applied to several planning tasks with different algorithms and is shown to improve performance.

• Journal of the Korean Society for information Management
• /
• v.28 no.3
• /
• pp.355-376
• /
• 2011

The aim of the study is to identify the design principles for user interface required to increase the usability of research information systems and to develop the heuristics for the research information systems. For this purpose, a series of literature review was conducted to examine the user interface design principles for the research information systems, and the in-depth interview and participant observation were performed on the users of the systems and experts in the field of user interface to investigate the design principles and the interface factors for applying such principles in the systems. Based on the results, the heuristics of 86 items in 7 different dimensions were proposed.

• Journal of the Korean Society for information Management
• /
• v.39 no.2
• /
• pp.1-33
• /
• 2022

Voice shopping is gaining attention following the trend of non-contact E-commerce by enabling people to shop via voice command. Therefore, in this study, voice shopping service heuristics using a display-mounted voice interface were developed in preparation for the future where voice shopping becomes a part of daily life in the world. First, as a theoretical approach, a literature survey of 50 papers on the design principles of 'visual interface,' 'voice interface,' and 'shopping service' was conducted to produce a total of 29 draft design principles. Second, as an empirical approach, a focus group interview was conducted on consumer decision-making processes in shopping experiences and information-seeking behavior within the context of shopping to draft the heuristics. This was to supplement the user experience, a weak part of the literature research. Finally, a Delphi survey asked 20 experts in UX, service planning, artificial intelligence development, and shopping to evaluate the heuristics draft developed through the above two stages. After three rounds of Delphi surveys, the final heuristics were proposed.

• Industrial Engineering and Management Systems
• /
• v.11 no.2
• /
• pp.202-214
• /
• 2012

This paper discusses the problem of determining locations for public health-care facilities and allocating patients to the public facilities with the objective of minimizing the total construction cost. The public health-care facilities have two types of facilities: public hospitals and health centers. The public hospital provides both hospital services and homecare services, while the health center provides only homecare service. We present an integer programming formulation for the problem, and develop two types of heuristics, based on priority rules and approximate mathematical formulation. Results of a series of computational experiments on a number of problem instances show that the algorithms give good solutions in a reasonable computation time.

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.22-31
• /
• 2015

In this paper, a two-stage hybrid flow shop problem is considered. Specifically, there exist identical parallel machines at stage 1 and two dedicated machines at stage 2, and the objective of the problem is to minimize makespan. After being processed by any machine at stage 1, a job must be processed by a specific machine at stage 2 depending on the job type, and one type of jobs can have different processing times on each machine. First, we introduce the problem and establish complexity of several variations of the problem. For some special cases, we develop optimal polynomial time solution procedures. Then, we establish some simple lower bounds for the problem. In order to solve this NP-hard problem, three heuristics based on simple rules such as the Johnson's rule and the LPT (Longest Processing Time first) rule are developed. For each of the heuristics, we provide some theoretical analysis and find some worst case bound on relative error. Finally, we empirically evaluate the heuristics.

• Proceedings of the Korean DIstribution Association Conference
• /
• 2003.05a
• /
• pp.55-70
• /
• 2003

The most transport companies are placing increasing emphasis on powerful new techniques for planning their vehicle operations. They have tried to improve their vehicle control and customer service capability by adopting tile advanced information technology, such as GPS(Global Position System) and Using Digital Map. But researches on the VRSP(vehicle routing St schedule problem) in this situation were very few. The purpose of this research is to develop vehicle scheduling heuristics for making a real-time dynamic VRSP under the situation that GPS and using Digital Map are equipped to the transport company. Modified savings techniques are suggested for the heuristic method and an insertion technique is suggested for the dynamic VRSP. The urgent vehicle schedule is based on the regular vehicle schedule. This study suggest on VRSP system using GPS and Digital Map and the performance of the suggested heuristics is illustrated through an real case example.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1124-1132
• /
• 2006

This paper considers a flow shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. The objective is to minimize the sum of the weighted WIP. For the two machine flow shop case, the recognition version is unary NP-Complete. The three simple and intuitive heuristics H0, H1, and H2 are presented for the problem. For each heuristic, we find an upper bound on relative error which is tight in limit. For heuristic H2, we show that H2 dominates the other two heuristics.