ICHSA 2015 - Korea

ICHSA 20152nd International Conference on Harmony Search Algorithm

19 (Wed) - 21 (Fri) August, 2015Hana Square, Korea University, Seoul, South Korea

Organized by

Supported by

Contents01|Welcome Remark

01|Overview

01|Organizations

01|Venue

01|ICHSA 2015 Schedule at a glance

01|Keynote Speakers

01|Keynote Speeches

01|Sessions

01|Abstracts

01|Session Guidelines

01|Outstanding Paper Awards

01|Coffees, Meals, and Wi-Fi

01|Accommodations

01|Transportation

01|General Information

01|About Seoul

2nd International Conference on Harmony Search Algorithm(ICHSA 2015)

ICHSA 2015 | 3

Welcome Remark

It is with great pleasure to invite you to the 2nd International Conference on Harmony Search Algorithm (ICHSA 2015), which is held on 19th-21st of August 2015 at Anam campus of Korea University in Seoul, South Korea.

The ICHSA 2015 is intended to be an international forum for researchers in the area of developing, design, variants, and hybrid methods of Harmony Search Algorithm (HSA).

This gathering will be an excellent opportunity to introduce various aspects of HSA to graduate students as well as professors in various disciplines. Further, this will also become a showcase of the research capabilities of teams and can bring ideas for future collaborations among them.

Since the HSA was first introduced in 2001, it has been widely used in various research areas. As many other meta-heuristic optimization algorithms like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), there have been efforts to make the HSA even more efficient for specific types of problem.

I expect many interesting presentations followed by in-depth discussion, so that all the participants can obtain the recent trend of the HSA as well as the advanced aspects of the algorithm. We once again welcome you all to this international conference gathering and hope you will have great time while staying in Seoul.

Joong Hoon Kim LOC Chair and Professor

School of Civil, Environmental and Architectural EngineeringKorea University

4 | ICHSA 2015

Organizations

Korea University South KoreaResearch Center for Disaster Prevention Science and Technology, Korea University Hydrosystem Laboratory, School of Civil, Environmental and Architectural Engineering, Korea University

Supporting Organizations

Korea University South KoreaNational Research Foundation of Korea

Statistics

Forty-three full papers were submitted from 9 countriesNumber of scheduled oral presentation: 43 Keynote speakers speech: 4

Official Language

English

Overview

Title : 2nd International Conference on Harmony Search Algorithm (ICHSA 2015)Date : 19 (Wnd) ~ 21 (Fri), August, 2015Venue : Hana Square, Korea University, Seoul, South KoreaHost : Hydrosystem Laboratory, School of Civil, Environmental and Architectural Engineering, Korea

University

ICHSA 2015 | 5

2nd International Conference on Harmony Search Algorithm

Local Organizing Committee

International Steering Committee

Secretariat

International Scientific Committee

Organization

Chair

Joong Hoon KimKorea University, Korea

Kusum Deep (IIT Roorkee, India)Zong Woo Geem (Gachon Univ., Korea)Ali Kaveh (IUST, Iran)Joong Hoon Kim (Korea Univ., Korea)

Young Hwan Choi (Korea Univ., Korea)

P. N. Suganthan (Nanyang Tech. Univ., Singapore)Ling Wang (Tsinghua Univ., China)Xin-She Yang (Middlesex Univ., UK)Jagdish Chand Bansal (South Asian Univ., India)

Jiho Choi (Korea Univ., Korea)

Mohammed Azmi Al-Betar (Jadara Univ., Jordan)Osama Moh’d Alia (Univ. of Tabuk, Saudi Arabia)Mustafa Ayvaz (Pamukkale Univ., Turkey)Ardeshir Bahreininejad (Inst. Tech. Brunei, Brunei) Jagdish Chand Bansal (South Asian Univ., India)Yung-Ming Cheng ( Hong Kong Polytechnic Univ.,

Hong Kong)Inchan Choi (Korea Univ., Korea)Swagatam Das (Indian Stat. Inst., India)Kusum Deep (IIT Roorkee, India)Javier Del Ser (Tecnalia Research & Innovation, Spain)Iyad Abu Doush (Yarmouk Univ., Jordan)Amir Hossein Gandomi (Univ. of Akron, USA)Xiao-Zhi Gao (Yalto Univ., Finland)Zong Woo Geem (Gachon Univ., Korea)Ali Kaveh (IUST, Iran)Byung-In Kim (POSTECH, Korea)

Joong Hoon Kim (Korea Univ., Korea)Ioannis Kougias (European Commission, Italy)Youngho Lee (Korea Univ., Korea)Dario Londa-Silva (Univ. of Nottingham, UK)Apostolos Malatras (European Commission, Italy)Byung-Ro Moon (Seoul National Univ., Korea)V. Ravikumar Pandi (Masdar Inst., Arab Emirates)Ali Sadollah (Korea Univ., Korea)Reza Sirjani (Cyprus International Univ., Turkey)P. N. Suganthan (Nanyang Tech. Univ., Singapore)Nicholas Theodossiou (Aristotle Univ., Greece)Chung-Li TSENG (Univ. of New South Wales, Australia)Ling Wang (Tsinghua Univ., China)Anupam Yadav (NIT. Uttarakhand, India)Xin-She Yang (Middlesex Univ., UK)Jafar Yazdi (Sharood Univ. of Tech., Iran)Do Guen Yoo (Korea Univ., Korea)

6 | ICHSA 2015

Korea University, founded in 1905, is widely acknowledged as one of the country’s oldest, largest and top-ranked universities in Korea. Its reputation for quality is based on excellence in teaching, research and service to Korean society. Eminent faculty, outstanding students and internationally recognized research programs all contribute to Korea University’s academic fame. As a major comprehensive university, KU offers a rich variety of courses in liberal arts and sciences as well as in all professional fields, including law, medicine and business administration.KU campus covers over 182 acres and its home to more than 35,000 students from all over the nation and the world. With its stately stone architecture sprawling lawns, seasonal trees and natural flora, KU is known to be one of the most beautiful campuses in Korea. The students of KU represent Korea’s dream as they are among the nation’s brightest and most ambitious. KU is nationally recognized for its commitment to teaching and academic excellence. The university’s academic breadth is extensive with its 81 departments in 19 colleges and divisions, and 18 graduate schools and it has over 1,500 full-time faculty members with over 95% of them holding Ph.D. or equivalent qualification in their field. KU has particularly strong Humanities and Asian Studies Departments along with the recently established Graduate School of International Studies (GSIS). KU is also renowned for its professional schools of Law, Medicine and Business Administration. In research, KU is an internationally recognized leader with over 100 research centers, including the East Asiatic Research Centre and the Korean Cultural Research Centre. Furthermore, Korea University Business School (KUBS) is the only and the first business school in the country to have acquired both European Quality Improvement System (EQUIS) accreditation, in combination with the accreditation granted by the Association to Advance Collegiate Schools of Business (AACSB). Unlike many universities in Korea, KU prides itself not only in being a progressive and globally conscious institution but one that plays a role in preserving and developing Korea’s unique culture.

Venue (Korea University)

ICHSA 2015 | 7


Hana Square, gigantic structure of 28,099m2 stretching from east to west in front of the Science Library includes one story above ground and three below. Appearing like a ship floating on the ocean, the structure boasts grand beauty with a charming and practical design. Winner of the Award of Excellence in the 25th Seoul Architectural Work Award, it now stands as a proud landmark of KU.

Hydrosystems laboratory- Address: 336 Engineering Building, Korea Univ. Anam Campus, Anam-dong 5-ga, Seongbuk-gu, Seoul, 136-

713, Korea- Tel.: +82-2-3290-4722 / +82-2-3290-4724

Venue (Hana Square)

Contact

Anam Hospital

EngineeringBuilding

Main Hall &Central Plaza

Anam Station(Subway line 6)

▶

Hana Square

8 | ICHSA 2015

ICHSA 2015 schedule at a glance

19 August, Wednesday

21 August, Friday

Time Hana Square B112 (Auditorium) Hana Square B115 (Multimedia Room)

19 August, Wednesday

Arrival of Participants

Registration (15:00~18:00)

Time Hana Square B112 (Auditorium) Hana Square B115 (Multimedia Room)

21 August, Friday


Keynote Speech III (9:00~10:00)

Coffee Break (10:00~10:30)Session IV (10:30~12:00)

Large scale applications of HSASession V (10:30~12:00)

Other Nature-inspired AlgorithmsLunch (12:00~13:30)

Keynote Speech IV (13:30~14:30)Session VI (14:30~16:00)

Optimization in Civil Engineering ISession VII (14:30~16:00)

Related Areas and Computational IntelligenceCoffee Break (16:00~16:30)

Session VIII (16:30~18:00) Optimization in Civil Engineering II

Session IX (16:30~18:00) Multi-objectives variants of HSA

Closing Ceremony (18:00~18:15)

20 August, ThursdayTime Hana Square B112 (Auditorium)

20 August, Thursday


Opening Ceremony (9:10~9:30)

Keynote Speech I (9:30~10:30)

Coffee Break (10:30~11:00)

Session I (11:00~12:30) - Various Aspects of Optimization Algorithms I

Lunch (12:30~13:30)

Keynote Speech II (13:30~14:30)

Session II (14:30~16:00) - Various Aspects of Optimization Algorithms II

Coffee Break (16:00~16:30)

Session III (16:30~18:00) - Recent Variants of HSA

Banquet (18:00~)

ICHSA 2015 | 9


Hojjat Adeli received his Ph.D. from Stanford University in 1976 at the age of 26. He is Professor of Civil, Environmental, and Geodetic Engineering, Biomedical Engineering, Electrical and Computer Engineering, and Neuroscience The Ohio State University. He has authored 15 books. He is the Founder and Editor-in-Chief of international research journals Computer-Aided Civil and Infra-structure, now in 30th year of publication, and Integrated Computer-Aided Engineering, now in 23rd year of publication, and the Editor-in-Chief of International Journal of Neural Systems. In 1998 he received the Distinguished Scholar Award from OSU, “in recognition of extraordinary accomplishment in research and scholarship”. In 2005, he was elected Distinguished Member, ASCE: “for wide-ranging, exceptional, and pioneering contributions to computing in civil engineering and extraordinary leadership in advancing the use of computing and information technologies in many engineering disciplines throughout the world.” In 2010 he was profiled as an Engineering Legend in the ASCE journal of Leadership and Management in Engineering, and Wiley-established the Hojjat Adeli Award for Innovation in Computing. In 2011 World Scientific established the Hojjat Adeli Award for Outstanding Contributions in Neural Systems. He is a Fellow of IEEE, the American Association for the Advancement of Science, American Neurological Society, and American Institute for Medical and Biomedical Engineering. Among his numerous awards are a special medal from Polish Neural Network Society, the Eduardo Renato Caianiello Award for Excellence in Sci-entific Research from the Italian Society of Neural Networks, the Omar Khayyam Research Excel-lence Award from Scientia Iranica, an Honorary Doctorate from Vilnius Gediminas Technical University, and corresponding member of the Royal Engineering Academy of Spain.

Computational Intelligence in Engineering and Medicine

Hojjat Adeli

The Ohio State University, USA

Abstract. In this keynote lecture the author presents multi-paradigm approaches for solution of intractable problems in two domains of engineering and medicine through adroit integration of nonlinear sci-ence/chaos theory, signal processing techniques such as wavelets, pattern recognition models such as neurocomputing, and nature-inspired computing such as genetic algorithms. Example applications in engineering are health monitoring and vibration control of highrise building structures. Medical applications are automated computer-aided diagnosis of neurological and psychiatric disorders such as epilepsy, the Alzheimer’s disease, Autism Spectrum Disorder, and Attention Deficit Hyperactivity Disorder (ADHD).

Hojjat AdeliThe Ohio State University, USA

Keynote Speakers

10 | ICHSA 2015

Dr. Kusum Deep, is a full Professor, with the Department of Mathematics, Indian Institute of Technology Roorkee, India. Born on August 15, 1958, she pursued B.Sc Hons and M.Sc Hons. School from Centre for Advanced Studies, Panjab University, Chandigarh. An M.Phil Gold Medalist, she earned her PhD from IIT Roorkee in 1988, assisted by UGC Scholarship throughout. She carried out Post Doctoral Research at Loughborough University, UK during 1993-94, under an International Post Doctorate Bursary funded by Commission of European Communities, Brussels. She was awarded the Khosla Research Award in 1991; UGC Career Award in 2002; Starred Performer of IIT – Roorkee Faculty continuously from 2001 to 2005; best paper, Railway Bulletin of Indian Railways,2005; special facilitation in memory of late Prof. M. C. Puri, 2007. She has co-authored a book entitled “Optimization Techniques” by New Age Publishers New Delhi in 2009 with an International edition by New Age Science, UK. Eleven students have been awarded PhD under her supervision and six are in progress. She has 80 research publications in refereed International Journals and 60research papers in International / National Conferences. She is on the editorial board of a number of International and National Journals. She is a Senior Member of Operations Research Society of India, IEEE, Computer Society of India, Indian Mathematical Society and Indian Society of Industrial Mathematics. She is on the Expert Panel of the Department of Science and Technology, Govt. of India. She is the Executive Editor of International Journal of Swarm Intelligence, Inderscience. She is the Founder President of Soft Computing Research Society, India and the secretary of Forum of Interdisciplinary Mathematics. Her areas of specialization are numerical optimization and their applications to engineering, science and industry. Currently her research interests are Nature Inspired Optimization Techniques, particularly, Genetic Algorithms, Memetic Algorithms, Particle Swarm Optimization, Artificial Bee Colony, Biogeographical Based Optimization, Glowworm Optimization, and their applications to solve real life problems.

Kusum DeepIndian Institute of Technology Roorkee, Uttarakhand, India

Keynote Speakers

ICHSA 2015 | 11


Can Nature-Inspired Optimization Techniques solve complicated real-life problems ?

Kusum Deep

Indian Institute of Technology Roorkee, Uttarakhand, India

Abstract. Optimization can be viewed as the art of selecting the best alternative among a given set of options. Optimization problems arise in almost all fields of science, engineering, finance and Industry – in fact in all walks of human activity in which the problem may be mathematically modelled. In most of the Nonlinear Optimization Problems, a global optimal solution rather than a local optimal solution is desired. Determining the global optimal solution of a nonlinear optimization problem is much more difficult than determining the local optimal solution. However, because of the practical necessity the search for the global optima is often necessary. The traditional methods available in literature for solving global optimization problems may be broadly classified as deterministic methods and probabilistic methods. The deterministic methods try to guarantee that a neighborhood of the global optima is attained. Such methods rely on a thorough search of the feasible domain. They are applicable, however, to a restricted class of functions only. On the other hand the probabilistic methods make use of probabilistic or stochastic approach to search for the global solutions. Although probabilistic methods do not give an absolute guarantee, these methods are preferred over the deterministic methods because they are applicable to wider class of functions. During the last two decades nature inspired optimization techniques are being developed which draw their inspiration from nature. Some of the methods in this category are: Ant Colony Optimization, Genetic Algorithms, Memetic Algorithms, Differential Evolution, Particle Swarm Optimization, Artificial Bee Colony, Bacterial Foraging, Bat Algorithm, Firefly algorithm, Cuckoo Search Algorithm, Bio-Geographical Algorithms, Glowworm Optimization, Artificial immune systems, Forest Optimization, Spider Monkey Algorithm, Gravitational Search Algorithms, etc. This talk will focus on the state-of-the-art nature inspired optimization techniques which are gaining popularity and are considered efficient due to their ability to find a reasonably acceptable solutions within a fair amount of time instead of providing a guarantee to hit the global optimal solution. A number of case studies will be demonstrated from various fields of Science, Engineering, Finance and Industries.

12 | ICHSA 2015

Ponnuthurai Nagaratnam Suganthan received the B.A degree, Postgraduate Certificate and M.A degree in Electrical and Information Engineering from the University of Cambridge, UK in 1990, 1992 and 1994, respectively. After completing his PhD research in 1995, he served as a predoctoral Research Assistant in the Dept. of Electrical Engineering, University of Sydney in 1995–96 and a lecturer in the Dept. of Computer Science and Electrical Engineering (ITEE), University of Queensland in 1996–99. He moved to NTU in 1999. He is an Editorial Board Member of the Evolutionary Computation Journal, MIT Press. He is an associate editor of the IEEE Trans on Cybernetics (formerly IEEE T-SMC-B), IEEE Trans on Evolutionary Computation (2005 – 2014), Information Sciences (Elsevier), Pattern Recognition (Elsevier) and Int. J. of Swarm Intelligence Research Journals. He is a founding co-editor-in-chief of Swarm and Evolutionary Computation, an Elsevier Journal. SaDE (April 2009) paper won “IEEE Trans. on Evolutionary Computation outstanding paper award” in 2012. Dr Jane Jing Liang (former PhD student) won the “IEEE CIS Outstanding PhD dissertation award”, in 2014. His research interests include evolutionary computation, pattern recognition, benchmarking evolutionary algorithms, applications of evolutionary computation and machine learning. His publications have been well cited (Googlescholar Citations). His SCI indexed publications attracted over 1000 SCI citations in calendar year 2013 alone. He is a Senior Member of the IEEE and an elected AdCom member of IEEE Computational Intelligence Society (2014-2016).

Numerical Optimization by Nature Inspired Algorithms

Ponnuthurai Nagaratnam Suganthan

Nanyang Technological University, Singapore

Abstract. In recent years, a huge number of nature inspired optimization algorithms have been proposed. This talk will discuss a few of these methods such as HSA, DE and PSO. The talk will also discuss the necessity for developing additional nature inspired heuristics. The talk will also attempt to answer whether strongly nature inspired algorithms or mildly natured inspired algorithms will perform better in general.

Ponnuthurai Nagaratnam SuganthanNanyang Technological University, Singapore

Keynote Speakers

ICHSA 2015 | 13


Ling Wang received the B.Sc. and Ph.D. degrees from Tsinghua University, Beijing, China, in 1995 and 1999, respectively. Since 1999, he has been with the Department of Automation, Tsinghua University and became a Full Professor in 2008. Prof. Wang now is the Co-Editor-in-Chief for Open Operational Research Journal, and the Editorial Board Member for Memetic Computing (Springer), Swarm and Evolutionary Computation (Elsevier), International J of Automation and Control and International J of Artificial Intelligence and Soft Computing (InderScience). He also served as the Guest Editor for Neurocomputing (Elsevier), and J of Intelligent Manufacturing (Springer), and the Editorial Board Member for European J of Industrial Engineering (InderScience). His research interests include computational intelligence based optimization, scheduling and applications. He has authored 5 academic books and more than 200 refereed papers. His publications have attracted over 15000 Google Scholar Citations and over 3000 Web-of-Science citations. Prof. Wang won the Top Cited Article Award by Engineering Applications of Artificial Intelligence (Elsevier), and the Outstanding Paper Award at the International Conference on Machine Learning and Cybernetics (ICMLC’2002), and the Best Paper Award at the International Conference on Intelligent Computing (ICIC’2011), and the Best Paper Award at the International Workshop on Advanced Computational Intelligence and Intelligent Informatics (IWACIII’13). He received the National Natural Science Award of China (in 2014), and the Natural Science Award of the Ministry of Education (MOE) of China (in both 2003 and 2007), and the Science and Technology Award of Beijing City (in 2008), and the Electronics and Informatics Science and Technology Award by Chinese Institute of Electronics (in 2011). He also was the recipient of the Rising Star of Science and Technology of Beijing City in 2004, and the Academic Young Talent of Tsinghua University in 2009, and the New Century Excellent Talent in University by the MOE of China in 2009, and the Young Researcher New Star Scientist Award in the field of Information Sciences by SCOPUS in 2010.

Ling WangTsinghua University, Beijing, China

Keynote Speakers

14 | ICHSA 2015

Computational Intelligence Based Scheduling

Ling Wang

Tsinghua University, Beijing, China

Abstract. As the theme of Industry 4.0, Smart Factory and Smart Manufacturing have attracted increasing attention recently. Production scheduling is one of the most common and significant problems faced by the manufacturing industry. Production scheduling is to allocate limited resources to tasks over time and to determine the sequence of operations so that the constraints of the manufacturing system are met and the performance criteria are optimized. From the problem-solving perspective, usually scheduling can be viewed as a complex combinatorial optimization problem with strong precedence constraints and huge search space. Due to the NP-hardness, computational intelligence (CI) based methods have become powerful solution techniques for solving the large-scale scheduling problems.Over the past few decades, an impressive number of CI-based optimization algorithms were reported. From a systematic perspective, this talk will first introduce a unified framework for the population-base meta-heuristics. Then, some powerful memetic algorithms based on particle swarm optimization, harmony search, artificial bee colony, quantum-inspired computing and shuffled frog leaping will be presented for solving some specific scheduling problems with different features and complexities. Some generalized work and applications in different manufacturing industrial fields will be shown. The primary aim of this talk is to show that CI-based algorithms are powerful and general solution tools for solving scheduling problems while it is more important to incorporate the problem-specific knowledge into the CI-based algorithms in solving specific complex problems. It also illustrates the opportunities and challenges to generalize the CI-based algorithms to different areas other than that the inventors originally focused on.

ICHSA 2015 | 15


Keynote Speeches

20 August, Thursday | 09:30 - 10:30, Hana Square B112 (Auditorium)

Chairs: Jagdish Chand Bansal (South Asian University New Delhi)

9:30-10:30Computational Intelligence in Engineering and Medicine

Hojjat Adeli (The Ohio State University)

Session : Keynote Speech I


Chairs: Joong Hoon Kim (Korea University)

13:30-14:30Can Nature-Inspired Optimization Techniques solve complicated real-life problems?

Kusum Deep (Indian Institute of Technology Roorkee, Uttarakhand, India)

Session : Keynote Speech II

21 August, Friday | 09:30 - 10:30, Hana Square B112 (Auditorium)

Chairs: Ling Wang (Tsinghua University)

09:00-10:00Numerical Optimization by Nature Inspired Algorithms

Ponnuthurai Nagaratnam Suganthan (Nanyang Technological University)

Session : Keynote Speech III


Chairs: Ponnuthurai Nagaratnam Suganthan (Nanyang Technological University)

13:30-14:30Computational Intelligence Based Scheduling

Ling Wang (Tsinghua University)

Session : Keynote Speech IV

16 | ICHSA 2015


Sessions Schedule

Chairs: Joong Hoon Kim (Korea University) and Ali Sadollah (Korea University)

11:00-11:18

Investigating the Convergence Characteristics of Harmony Search

Joong Hoon Kim (Korea University)

Homin Lee (Korea University)

Do Guen Yoo (Korea University)

11:18-11:36

Performance Measures of Metaheuristic Algorithms


Homin Lee (Korea University)

Donghwi Jung (Korea University)

Ali Sadollah (Korea University)

11:36-11:54

Harmony Search Algorithm with Ensemble of Surrogate Models

Krithikaa Mohanarangam (Kyungpook National University)

Mallipeddi Rammohan (Kyungpook National University)

11:54-12:12

Precision Motion Control Method Based on Artificial Bee Colony Algorithm

Jinxiang Pian (Shenyang Jianzhu University)

Dan Wang (Shenyang Jianzhu University)

Yue Zhou (Shanghai Ocean University)

Jinxin Liu (Chinese Academy of Sciences)

Yuanwei Qi (Shenyang Jianzhu University)

12:12-12:30

A Scatter Search Hybrid Algorithm for Resource Availability Cost Problem

Hexia Meng (Shanghai University)

Bing Wang (Shanghai University)

Yabing Nie (Shanghai University)

Xuedong Xia (Shanghai University)

Xianxia Zhang (Shanghai University)

Various Aspects of Optimization Algorithms ISession I

ICHSA 2015 | 17



Sessions Schedule

Chairs: Anupam Yadav (National Institute of Technology Uttarakhand) and Neha Yadav (Korea University)

14:30-14:48

A Study of Harmony Search Algorithms: Exploration and Convergence ability

Anupam Yadav (National Institute of Technology Uttarakhand)

Neha Yadav (Korea University)


14:48-15:06

Design of the motorized spindle temperature control system with PID algorithm

Lixiu Zhang (Shenyang Jianzhu University)

Teng Liu (Shenyang Jianzhu University)

Yuhou Wu (Shenyang Jianzhu University)

15:06-15:24

The Design of Kalman Filter for Nano-Positioning Stage

Jing Dai (Shenyang Jianzhu University)

Peng Qu (Shenyang Jianzhu University)

Meng Shao (Shenyang Jianzhu University)

Hui Zhang (Shenyang Jianzhu University)

Yongming Mao (Shenyang Jianzhu University)

15:24-15:42

Research on Adaptive Control Algorithm of Nano Positioning Stage

Jing Dai (Shenyang Jianzhu University)

Tianqi Wang (Shenyang Jianzhu University)

Meng Shao (Shenyang Jianzhu University)

Peng Qu (Shenyang Jianzhu University)

15:42-16:00

Two Frameworks for Cross-domain Heuristic and Parameter Selection Using Harmony Search

Paul Dempster (University of Nottingham)

John H. Drake (University of Nottingham)

Various Aspects of Optimization Algorithms IISession II

18 | ICHSA 2015


Sessions Schedule

Chairs: Donghwi Jung (Korea University) and Ali Sadollah (Korea University)

16:30-16:48Modified Harmony Search applied to Reliability Optimization of Complex SystemsGutha Jaya Krishna (Institute for Development and Research in Banking Technology)Vadlamani Ravi (Institute for Development and Research in Banking Technology)

16:48-17:06

Mine Blast Harmony Search and Its ApplicationsAli Sadollah (Korea University)Ho Min Lee (Korea University)Do Guen Yoo (Korea University)Joong Hoon Kim (Korea University)

17:06-17:24

The Effects on Adjustment Strategy of HMCR in Harmony Search AlgorithmNur Farraliza Mansor (Universiti Sultan Zainal Abidin)Zuraida Abal Abas (Universiti Teknikal Malaysia Melaka)Abdul Samad Shibghatullah (Universiti Teknikal Malaysia Melaka)Ahmad Fadzli Nizam Abdul Rahman (Universiti Teknikal Malaysia Melaka)

17:24-17:42

KU Battle of Metaheuristic Optimization Algorithms 1: Development of Six New AlgorithmsJoong Hoon Kim (Korea University)Young Hwan Choi (Korea University)Jiho Choi (Korea University)Ho Min Lee (Korea University)Yean Moon Choo (Korea University)Thi Thuy Ngo (Korea University)Eui Hoon Lee (Korea University)Do Guen Yoo (Korea University)Ali Sadollah (Korea University)Donghwi Jung (Korea University)

17:42-18:00

KU Battle of Metaheuristic Optimization Algorithms 2: Performance TestJoong Hoon Kim (Korea University)Young Hwan Choi (Korea University)Jiho Choi (Korea University)Ho Min Lee (Korea University)Yean Moon Choo (Korea University)Thi Thuy Ngo (Korea University)Eui Hoon Lee (Korea University)Do Guen Yoo (Korea University)Ali Sadollah (Korea University)Donghwi Jung (Korea University)

Recent Variants of HSASession III

ICHSA 2015 | 19


Large scale applications of HSASession IV


Sessions Schedule

Chairs: Ling Wang (Tsinghua university) and Cristina Perfecto (University of the Basque Country EHU/UPV)

10:30-10:48

An Improved Harmony Search Algorithm for the Distributed Two Machine Flow-shop Scheduling Problem

Jin Deng (Tsinghua university)

Ling Wang (Tsinghua university)

Jingnan Shen (Tsinghua university)

Xiaolong Zheng (Tsinghua university)

10:48-11:06

Hybrid Harmony Search Algorithm for Nurse Rostering Problem

Yabing Nie (Shanghai University)



11:06-11:24

A Harmony Search Approach for the Selective Pick-up and Delivery Problem with Delayed Drop-off

Javier Del Ser (Tecnalia Research & Innovation)

Miren Nekane Bilbao (University of the Basque Country EHU/UPV)

Cristina Perfecto (University of the Basque Country EHU/UPV)

Sancho Salcedo-Sanz (Universidad de Alcalá)

11:24-11:42

Dandelion-Encoded Harmony Search Heuristics for Opportunistic Traffic Offloading in Synthetically Modeled Mobile Networks

Cristina Perfecto (University of the Basque Country EHU/UPV)

Miren Nekane Bilbao (University of the Basque Country EHU/UPV)

Javier Del Ser (Tecnalia Research & Innovation)

Armando Ferro (University of the Basque Country EHU/UPV)

Sancho Salcedo-Sanz (Universidad de Alcalá)

11:42-12:00

A New Parallelization Scheme for Harmony Search Algorithm


Jiho Choi (Korea University)

Young Hwan Choi (Korea University)


20 | ICHSA 2015

ther Nature-inspired AlgorithmsSession V

21 August, Friday | 10:30 - 12:00, Hana Square B115 (Multimedia Room)

Sessions Schedule

Chairs: Kusum Deep (Indian Institute of Technology Roorkee) and Jagdish Chand Bansal (South Asian University New Delhi)

10:30-10:48

Modified Blended Migration and Polynomial Mutation in Biogeography-based Optimization

Jagdish Chand Bansal (South Asian University New Delhi)

10:48-11:06

A Modified Biogeography Based Optimization

Pushpa Farswan (South Asian University New Delhi)

Jagdish Chand Bansal (South Asian University New Delhi)

Kusum Deep (Indian Institute of Technology Roorkee)

11:06-11:24

Tournament Selection based Probability scheme in Spider Monkey Optimization Algorithm

Kavita Gupta (Indian Institute of Technology Roorkee)


11:24-11:42

Optimal Extraction of Bioactive Compounds from Gardenia using Laplacian Biogoegraphical Based Optimization

Vanita Garg (Indian Institute of Technology Roorkee)


11:42-12:00

Physical Interpretation of River Stage Forecasting using Soft Computing and Optimization Algorithms

Youngmin Seo (Kyungpook National University)

Sungwon Kim (Dongyang University)

Vijay P. Singh (Taxas A & M University)

ICHSA 2015 | 21



Sessions Schedule

Chairs: S. Jamshid Mousavi (Amirkabir University of Technology) and Seungmo Kang (Korea University)

14:30-14:48

Harmony Search Algorithm for High-Demand Facility Locations Considering Traffic Congestion and Greenhouse Gas EmissionYoonseok Oh (Korea University)Umji Park (Korea University)Seungmo Kang (Korea University)

14:48-15:06

Optimum configuration of helical piles with construction cost minimized by harmony search algorithmKyunguk Na (Korea University)Dongseop Lee (Korea University)Hyungi Lee (Korea University)Kyoungsik Jung (Korea University)Hangseok Choi (Korea University)

15:06-15:24

A Preliminary Study for Dynamic Construction Site Layout Planning Using Harmony Search AlgorithmDongmin Lee (Korea University)Hyunsu Lim (Korea University)Myungdo Lee (Korea University)Hunhee Cho (Korea University)Kyung-In Kang (Korea University)

15:24-15:42

Economic Optimization of Hydropower Storage Projects Using Alternative Thermal Powerplant ApproachSina Raeisi (Amirkabir University of Technology)S. Jamshid Mousavi (Amirkabir University of Technology)Mahmoud Taleb Beidokhti (Amirkabir University of Technology)Bentolhoda A. Rousta (Amirkabir University of Technology)Joong Hoon Kim (Korea University)

15:42-16:00

Simulation Optimization for Optimal Sizing of Water Transfer SystemsNasrin Rafiee Anzab (Amirkabir University of Technology)S. Jamshid Mousavi (Amirkabir University of Technology)Bentolhoda A. Rousta (Amirkabir University of Technology)Joong Hoon Kim (Korea University)

Optimization in Civil Engineering ISession VI

22 | ICHSA 2015


Sessions Schedule

Chairs: Sungwon Kim (Dongyang University) and Neha Yadav (Korea University)

14:30-14:48

Online Support Vector Machine: A Survey

Xujun Zhou (Shanghai University)



14:48-15:06

Computation of daily solar radiation using wavelet and support vector machines; A case study

Sungwon Kim (Dongyang University)

Youngmin Seo (Kyungpook National University)

Vijay P. Singh (Texas A & M University)

15:06-15:24

The Discovery of Financial Market Behavior integrated Data Mining on ETF in Taiwan

Bo-Wen Yang (National Chiao Tung University)

Mei-Chen Wu (National Chiao Tung University)

Chiou-Hung Lin (Minghsin University of Science and Technology)

Chiung-Fen Huang (National Chiao Tung University)

An-Pin Chen (National Chiao Tung University)

15:24-15:42

Data Mining Application to Financial Market to Discover the Behavior of Entry Point - A Case Study of Taiwan Index Future Market

Mei-Chen Wu (National Chiao Tung University)

Bo-Wen Yang (National Chiao Tung University)

Chiou-Hung Lin (Minghsin University of Science and Technology)

Ya-Hui Huang (National Chiao Tung University)

An-Pin Chen (National Chiao Tung University)

15:42-16:00

Sensitivity of sensors built in smartphones

Zoltan Horvath (University of Pecs)

Ildiko Jenak (University of Pecs)

Tianhang Wu (Northwestern Polytechnical University)

Cui Xuan (Northwestern Polytechnical University)

Related Areas and Computational IntelligenceSession VII

ICHSA 2015 | 23



Sessions Schedule

Chairs: Kyungrock Paik (Korea University) and S. Jamshid Mousavi (Amirkabir University of Technology)

16:30-16:48

Performance evaluation of the Genetic Landscape Evolution (GLE) model with respect to crossover schemes

JongChun Kim (Korea University)

Kyungrock Paik (Korea University)

16:48-17:06

Optimal Design of Permeable Pavements using Harmony Search Algorithm with SWMM

Young-Wook Jung (Seoyong Engineering Co., Ltd.)

Shin-In Han (Seoyong Engineering Co., Ltd.)

Deokjun Jo (Dongseo University)

17:06-17:24

Development of Mathematical Model Using Group Contribution Method to Predict Exposure Limit Values in Air for Safeguarding Health

Mohanad El-Harbawi (King Saud University)

Phung Thi Kieu Trang (Universiti Teknologi Petronas)

17:24-17:42

Optimization of Water Distibution Networks with Differential Evolution (DE)

Ramin Mansouri (Lorestan University)

Hasan Torabi (Lorestan University)

Hosein Morshedzadeh (Tehran University)

Optimization in Civil Engineering IISession VIII

24 | ICHSA 2015


Sessions Schedule

Chairs: Zong Woo Geem (Gachon University) and Do Guen Yoo (Korea University)

16:30-16:48Artificial Satellite Heat Pipe Design Using Harmony Search

Zong Woo Geem (Gachon University)

16:48-17:06

A Pareto-based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem

Jingnan Shen (Tsinghua University)

Ling Wang (Tsinghua University)

Jin Deng (Tsinghua University)

Xiaolong Zheng (Tsinghua University)

17:06-17:24

A Multi-objective Optimization Approach to Optimizing Water Allocation in Urban Water Systems

S. Jamshid Mousavi (Amirkabir University of Technology)

Korush Behzadian (University of Exeter)


Zoran Kaplan (University of Exeter)

17:24-17:42

Seismic Reliability-based Design of Water Distribution Networks using Multi-objective Harmony Search Algorithm

Do Guen Yoo (Korea University)


Ho Min Lee (Korea University)

Young Hwan Choi (Korea University)


Multi-objectives variants of HSASession IX

ICHSA 2015 | 25


1-1

Investigating the Convergence Characteristics of Harmony Search

Joong Hoon Kim1, Ho Min Lee1, Do Guen Yoo2

1 School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, South Korea 136-713

{jaykim, dlgh86}@korea.ac.kr2 Research Center for Disaster Prevention Science and Technology,

Korea University, Seoul, South Korea [email protected]

Abstract. Harmony Search optimization algorithm has become popular in many fields of engineering research and practice during the last decade. This paper introduces three major rules of the algorithm: harmony memory considering (HMC) rule, random selecting (RS) rule, and pitch adjusting (PA) rule, and shows the effect of each rule on the algorithm performance. Application of example benchmark function proves that each rule has its own role in the exploration and exploitation processes of the search. Good balance between the two processes is very important, and the PA rule can be a key factor for the balance if used intelligently.

Keywords. Harmony Search, Convergence, Exploration and Exploitation, Harmony Memory Considering, Pitch Adjustment

1-2

Performance Measures of Metaheuristic AlgorithmsJoong Hoon Kim1, Ho Min Lee1, Donghwi Jung2, Ali Sadollah2


{jaykim, dlgh86}@korea.ac.kr2 Research Center for Disaster Prevention Science and Technology,

Korea University, Seoul, South Korea [email protected], [email protected]

Abstract. Generally speaking, it is not fully understood why and how metaheuristic algorithms work very well under what conditions. It is the intention of this paper to clarify the performance characteristics of some of popular algorithms depending on the fitness landscape of specific problems. This study shows the performance of each considered algorithm on the fitness landscapes with different problem characteristics. The conclusions made in this study can be served as guidance on selecting algorithms to the problem of interest.

Keywords. Fitness Landscape, Metaheuristic Algorithms, Nature-Inspired Algorithms, Optimization, Performance Measures

Various Aspects of Optimization AlgorithmsSession1

26 | ICHSA 2015

1-3

Harmony Search Algorithm with Ensemble of Surrogate Models

Krithikaa Mohanarangam1 and Rammohan Mallipeddi1

1 College of IT Engineering, Kyungpook National University, 1370 Sanyuk-dong, Daegu, South Korea 702-701

{krithikaamohan, mallipeddi.ram}@gmail.com

Abstract. Recently, Harmony Search Algorithm (HSA) is gaining prominence in solving real-world optimization problems. Like most of the evolutionary algorithms, finding optimal solution to a given numerical problem using HSA involves several evaluations of the original function and is prohibitively expensive. This problem can be resolved by amalgamating HSA with surrogate models that approximate the output behavior of complex systems based on a limited set of computational expensive simulations. Though, the use of surrogate models can reduce the original functional evaluations, the optimization based on the surrogate model can lead to erroneous results. In addition, the computational effort needed to build a surrogate model to better approximate the actual function can be an overhead. In this paper, we present a novel method in which HSA is integrated with an ensemble of low quality surrogate models. The proposed algorithm is referred to as HSAES and is tested on a set of 10 bound-constrained problems and is compared with conventional HSA.

Keywords. Harmony Search Algorithm, Surrogate Modeling, Ensemble, Global Optimization, Polynomial regression model

1-4

Precision Motion Control Method Based on Artificial Bee Colony Algorithm

Jinxiang Pian1, Dan Wang1, Yue Zhou1,2, Jinxin Liu3, Yuanwei Qi1

1 Faculty of Information and Control engineering, Shenyang Jianzhu University, Shenyang, P. R. China

[email protected], [email protected], [email protected], 2SOU College of Engineering Science and Technology,

Shanghai Ocean University, Shanghai, P. R. [email protected]

3 Key Laboratory of Networked Control System, Chinese Academy of Sciences, CAS, Shenyang, P. R. China

[email protected]

Abstract. The parameters of traditional PID controller cannot varies with load and environment for the precision motion control system. In this paper, an efficient scheme for proportional-integral-derivation (PID) controller using bee colony algorithm is applied to precision motion control system. The simulation results show that the feasibility of bee colony PID control algorithm in precision motion field. Furthermore, the bee colony PID control algorithm make the precision motion control system has faster response speed, high positioning accuracy, and its parameters can optimize automatically.

Keywords. Precision motion control, PID controller, bee colony algorithm

Session 1 Session 2 Session 3 Session 4 Session 5 Session 6 Session 7 Session 8 Session 9

ICHSA 2015 | 27


Sess

ion

1Se

ssio

n 2

Sess

ion

3Se

ssio

n 4

Sess

ion

5Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

1-5

A Scatter Search Hybrid Algorithm for Resource Availability Cost Problem

Hexia Meng1, Bing Wang1, Yabing Nie1, Xuedong Xia1, Xianxia Zhang1

1 School of Mechatronic Engineering and Automation, Shanghai University,200072 Shanghai, China

[email protected]

Abstract. This paper discusses the resource availability cost problem (RACP) with the objective of minimizing the total cost of the unlimited renewable resources by a prespecified project deadline. A tabued scatter search (TSS) algorithm is developed to solve the RACP. The deadline constraint is handled in coding. A tabu search module is embedded in the framework of scatter search. A computational experiment was conducted and the computational results show that the proposed TSS hybrid algorithm is effective and advantageous for the RACP.

Keywords. RACP, Scatter search, Tabu search

28 | ICHSA 2015

2-1

A Study of Harmony Search Algorithms: Exploration and Convergence ability

Anupam Yadav1, Neha Yadav2, Joong Hoon Kim2

1 Department of Sciences and HumanitiesNational Institute of Technology Uttarakhand

Srinagar 246-174, Uttarakhand, [email protected],[email protected]

2 School of Civil, Environmental and Architectural Engineering Korea University, Seoul 136-713, South [email protected],[email protected]

Abstract. Harmony Search Algorithm (HSA) has shown to be simple, efficient and strong optimization algorithm. The exploration ability of any optimization algorithm is one of the key points. In this article a new methodology is proposed to measure the exploration ability of the HS algorithm. To understand the searching ability potential exploration range for HS algorithm is designed. Four HS variants are selected and their searching ability is tested based on the choice of improvised harmony. An empirical analysis of the proposed method is tested along with the justification of theoretical findings and experimental results.

Keywords. Harmony Search, Exploration, Convergence

2-2

Design of the motorized spindle temperature control system with PID algorithm

Lixiu Zhang1, Teng Liu1, Yuhou Wu1

1Shenyang Jianzhu University, Shenyang 110168, [email protected]

Abstract. The thermal error of the motorized spindle has great influence on the accuracy of the NC machine tools. In order to reduce the thermal error, the increase type PID control algorithm is adopted for the control system which can make the temperature controlled in reasonable range. In accordance with the control object features, the Application of the control algorithm is realized in MCU System. Finally, the experiments are carried out which verified the validity and effectiveness of the design of temperature control system by analysis of the experimental data.

Keywords. PID control, Temperature measurement, Control algorithm, Motorized spindle

Various Aspects of Optimization AlgorithmsSession 2


ICHSA 2015 | 29


Sess

ion

2Se

ssio

n 1

Sess

ion

3Se

ssio

n 4

Sess

ion

5Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

2-3

The Design of Kalman Filter for Nano-Positioning StageJing Dai1, Peng Qu1, Meng Shao2, Hui Zhang1 and Yongming Mao1

1Information and Control Engineering College, Shenyang Jianzhu University, Shenyang, China 110168

[email protected], [email protected], {1693022786, 42019303}@qq.com 2Micro-nano Detection and Motion Control Laboratory, Shenyang Jianzhu University,

Shenyang, [email protected]

Abstract. The noise signal influences the stage positioning accuracy in the process of the nano stage motion, for which designs a Kalman filter to filter out noise effectively. The model of nano-positioning stage is established. Then the motion of stage is estimated by using Kalman filtering model, and the filtering effect of Kalman filter can be observed in the Matlab. Experimental results show that Kalman filtering can effectively reduce the positioning deviation, which is less than 4nm, and positioning accuracy has been improved significantly. Kalman filter has a good effect on filtering and can meet the requirement of positioning precision for nano-positioning stage.

Keywords. nano-positioning stage, Kalman filter, Matlab

2-4

Research on Adaptive Control Algorithm of Nano Positioning Stage

Jing Dai1, Tianqi Wang1, Meng Shao2, Peng Qu1

1 Faculty of Information & Control Engineering, Shenyang Jianzhu University, Shenyang, Liaoning Province, CHINA

[email protected], [email protected] Micro-nano Detection and Motion Control Laboratory,

Shenyang Jianzhu University, Shenyang, Liaoning Province, [email protected]

Abstract. The mechanical structure and load changes of nano positioning stage cause a poor accuracy of the control system. For solving the problem, Adaptive PID control algorithm was applied to control the nano positioning stage. The model of nano positioning stage was established on the basis of Controlled Autoregressive Moving Average model (CARMA). The parameters of controller were identified based on Recursive Extended Least Squares algorithm (RELS). The control system of nano positioning stage was steady through 4ms after parameters identification, which static error was less than 5nm. The experimental results demonstrated that adaptive PID control algorithm was able to identify the parameters of controlled object and calculate the parameters of controller. The accuracy of control system can be at nanometer resolution.

Keywords. Nano positioning stage, adaptive control algorithm, parameters identification, PID control

30 | ICHSA 2015

2-5

Two Frameworks for Cross-domain Heuristic and Parameter Selection Using Harmony Search

Paul Dempster1and John H. Drake1,2

1 School of Computer Science, University of Nottingham NingboNingbo, 315100, China

{paul.dempster, john.drake}@nottingham.edu.cn2 ASAP Research Group, School of Computer Science, University of Nottingham

Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB, [email protected]

Abstract. Harmony Search is a metaheuristic technique for optimizing problems involving sets of continuous or discrete variables, inspired by musicians searching for harmony between instruments in a performance. Here we investigate two frameworks, using Harmony Search to select a mixture of continuous and discrete variables forming the components of a Memetic Algorithm for cross-domain heuristic search. The first is a single-point based framework which maintains a single solution, updating the harmony memory based on performance from a fixed starting position. The second is a population-based method which co-evolves a set of solutions to a problem alongside a set of harmony vectors. This work examines the behaviour of each framework over thirty problem instances taken from six different, real-world problem domains. The results suggest that population co-evolution performs better in a time-constrained scenario, however both approaches are ultimately constrained by the underlying metaphors.

Keywords. Harmony Search, Hyper-heuristics, Combinatorial Optimisation, Metaheuristics, Memetic Algorithms


ICHSA 2015 | 31


3-1

Modified Harmony Search applied to Reliability Optimization of Complex Systems

Gutha Jaya Krishna1,2 and Vadlamani Ravi1

1Institute for Development and Research in Banking Technology, Castle Hills Road #1, Masab Tank, Hyderabad – 500 057 (A P) INDIA.

2 School of Computer & Information Sciences, University of Hyderabad, Hyderabad – 500 046 (A P) INDIA{krishna.gutha, padmarav}@gmail.com

Abstract. This paper proposes an Improved Modified Harmony Search Algorithm with constraint handling with application to redundancy allocation problems in reliability engineering. The performance of Improved Modified Harmony Search is being compared with that of the original Harmony Search, Modified Great Deluge Algorithm, Ant Colony Optimization, Improved Non-Equilibrium Simulated Annealing and Simulated Annealing. It is observed that Improved Modified Harmony Search requires less number of function evaluations compared to others.

Keywords. Constrained Optimization, Meta-heuristic, Modified Harmony Search Algorithm, Reliability Redundancy Allocation Problem.

3-2

Mine Blast Harmony Search and Its ApplicationsAli Sadollah1, Ho Min Lee2, Do Guen Yoo1, Joong Hoon Kim2

1Research Center for Disaster Prevention Science and Technology, Korea University, Seoul, South Korea [email protected], [email protected]

2School of Civil, Environmental, and Architectural Engineering, Korea University, 136-713, Seoul, South Korea {dlgh86, jaykim}@korea.ac.kr

Abstract. A hybrid optimization method that combines the power of the harmony search (HS) algorithm with the mine blast algorithm (MBA) is presented in this study. The resulting mine blast harmony search (MBHS) utilizes the MBA for exploration and the HS for exploitation. The HS is inspired by the improvisation process of musicians, while the MBA is derived based on explosion of landmines. The HS used in the proposed hybrid method is an improved version, introducing a new concept for the harmony memory (HM) (i.e., dynamic HM), while the MBA is modified in terms of its mathematical formulation. Several benchmarks with many design variables are used to validate the MBHS, and the optimization results are compared with other algorithms. The obtained optimization results show that the proposed hybrid algorithm provides better exploitation ability (particularly in final iterations) and enjoys fast convergence to the optimum solution.

Keywords. Harmony search, Mine blast algorithm, Hybrid metaheuristic methods, Global optimization, Large-scale problems.

Recent Variants of HSASession 3

Sess

ion

3Se

ssio

n 1

Sess

ion

2Se

ssio

n 4

Sess

ion

5Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

32 | ICHSA 2015

3-3

The Effects on Adjustment Strategy of HMCR in Harmony Search Algorithm

Nur Farraliza Mansor1, Zuraida Abal Abas2, Ahmad Fadzli Nizam Abdul Rahman2, Abdul Samad Shibghatullah2, Safiah Sidek3

1Faculty of Informatics and Computing, Universiti Sultan Zainal Abidin (Tembila Campus) 22200 Besut, Terengganu, Malaysia.

[email protected], Modelling, Analysis, Simulation and Scheduling (OptiMASS) Research Group,

Faculty of Information and Communication Technology, {zuraidaa, fadzli}@utem.edu.my

3Center for Languages and Human Development, Universiti Teknikal Malaysia Melaka (UTeM), Hang Tuah Jaya, 76100 Durian Tunggal, Melaka, Malaysia.

{samad, safiahsidek}@utem.edu.my

Abstract. As a meta-heuristic algorithm, Harmony Search (HS) algorithm is a population-based meta-heuristics approach that is superior in solving diversified large scale optimization problems. Several studies have pointed that Harmony Search (HS) is an efficient and flexible tool to resolve optimization problems in diversed areas of construction, engineering, robotics, telecommunication, health and energy. In this respect, the three main operators in HS, namely the Harmony Memory Consideration Rate (HMCR), Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing the local exploitation and the global exploration. These parameters influence the overall performance of HS algorithm, and therefore it is very crucial to fine turn them. However, when performing a local search, the harmony search algorithm can be easily trapped in the local optima. Therefore, there is a need to improve the fine tuning of the parameters. This research focuses on the HMCR parameter adjustment strategy using step function with combined Gaussian distribution function to enhance the global optimality of HS. The result of the study showed a better global optimum in comparison to the standard HS.

Keywords. meta-heuristic, HMCR, PAR, BW and Gaussian distribution

3-4

KU Battle of Metaheuristic Optimization Algorithms 1: Development of Six New/Improved Algorithms

Joong Hoon Kim1, Young Hwan Choi1, Thi Thuy Ngo1, Jiho Choi1, Ho Min Lee1, Yeon Moon Choo1, Eui Hoon Lee1, Do Guen Yoo2, Ali Sadollah2, Donghwi Jung2

1 School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, South Korea 136-713{jaykim, younghwan87}@korea.ac.kr, [email protected], {y999k, dlgh86}@korea.ac.kr,

[email protected], [email protected] Research Center for Disaster Prevention Science and Technology, Korea University, Seoul, South Korea 136-713

[email protected], [email protected], [email protected]


ICHSA 2015 | 33


Sess

ion

3Se

ssio

n 1

Sess

ion

2Se

ssio

n 4

Sess

ion

5Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

Abstract. Each of six members of hydrosystem laboratory in Korea University (KU) invented either a new metaheuristic optimization algorithm or an improved version of some optimization methods as a class project for the fall semester 2014. The objective of the project was to help students understand the characteristics of metaheuristic optimization algorithms and invent an algorithm themselves focusing those regarding convergence, diversification, and intensification. Six newly developed/improved metaheuristic algorithms are Cancer Treatment Algorithm (CTA), Extraordinary Particle Swarm Optimization (EPSO), Improved Cluster HS (ICHS), Multi-Layered HS (MLHS), Sheep Shepherding Algorithm (SSA), and Vision Correction Algorithm (VCA). This paper describes the details of the six developed/improved algorithms. In a follow-up companion paper, the six algorithms are demonstrated and compared through well-known benchmark functions and a real-life engineering problem.

Keywords. Cancer Treatment Algorithm, Extraordinary Particle Swarm Optimization, Improved Cluster HS, Multi-Layered HS, Sheep Shepherding Algorithm, Vision Correction Algorithm

3-5

KU Battle of Metaheuristic Optimization Algorithms 2: Performance Test

Joong Hoon Kim1, Young Hwan Choi1, Thi Thuy Ngo1, Jiho Choi1, Ho Min Lee1, Yeon Moon Choo1, Eui Hoon Lee1, Do Guen Yoo2, Ali Sadollah2, Donghwi Jung2

1 School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, South Korea 136-713{jaykim, younghwan87}@korea.ac.kr, [email protected], {y999k, dlgh86}@korea.ac.kr,

[email protected], [email protected] Research Center for Disaster Prevention Science and Technology, Korea University, Seoul, South Korea 136-713

[email protected], [email protected], [email protected]

Abstract. In the previous companion paper, six new/improved metaheuristic optimization algorithms developed by members of Hydrosystem laboratory in Korea University (KU) are introduced. The six algorithms are Cancer Treatment Algorithm (CTA), Extraordinary Particle Swarm Optimization (EPSO), Improved Cluster HS (ICHS), Multi-Layered HS (MLHS), Sheep Shepherding Algorithm (SSA), and Vision Correction Algorithm (VCA). The six algorithms are tested and compared through six well-known unconstrained benchmark functions and a pipe sizing problem of water distribution network. Performance measures such as mean, best, and worst solutions (under given maximum number of function evaluations) are used for the comparison. Optimization results are obtained from thirty independent optimization trials. Obtained Results show that some of the newly developed/improved algorithms show superior performance with respect to mean, best, and worst solutions when compared to other existing algorithms.

Keywords. Cancer Treatment Algorithm, Extraordinary Particle Swarm Optimization, Improved Cluster HS, Multi-Layered HS, Sheep Shepherding Algorithm, Vision Correction Algorithm

34 | ICHSA 2015

4-1

An Improved Harmony Search Algorithm for the Distributed Two Machine Flow-shop Scheduling Problem

Jin Deng1, Ling Wang1, Jingnan Shen1, Xiaolong Zheng1

1Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing, 100084, P.R. China

[email protected], [email protected]{chenjn12, zhengxl11}@mails.tsinghua.edu.cn

Abstract. In this paper, an improved harmony search (IHS) algorithm is proposed to solve the distributed two machine flow-shop scheduling problem (DTMFSP) with makespan criterion. First, a two-stage decoding rule is developed for the decimal vector based representation. At the first stage, a job-to-factory assignment method is designed to transform a continuous harmony vector to a factory assignment. At the second stage, the Johnson’s method is applied to provide a job sequence in each factory. Second, a new pitch adjustment rule is developed to adjust factory assignment effectively. The influence of parameter setting on the IHS is investigated based on the Taguchi method of design of experiments, and numerical experiments are carried out. The comparisons with the global-best harmony search and the original harmony search demonstrate the effectiveness of the IHS in solving the DTMFSP

Keywords. Harmony search, Distributed flow-shop scheduling, Decoding rule, Pitch adjustment

4-2

Hybrid Harmony Search Algorithm for Nurse Rostering Problem

Yabing Nie1, Bing Wang1, Xianxia Zhang1

1 School of Mechatronic Engineering and Automation, Shanghai University,200072 Shanghai, [email protected]

Abstract. This paper addresses the nurse rostering problem (NRP), whose objective is to minimize a total penalty caused by the roster. A large number of constraints required to be considered could cause a great difficulty of handling the NRP. A hybrid harmony search algorithm (HHSA) with a greedy local search is proposed to solve the NRP. A personal schedule is divided into several blocks, in which a subset of constraints is considered in advance. Based on these blocks, the pitch adjustment and randomization are carried out. Every time a roster is improvised, a coverage repairing procedure is applied to make the shift constraints satisfied, and the greedy local search is used to improve the roster’s quality. The proposed HHAS was tested on many well known real-world problem instances and competitive solutions were obtained.

Keywords. Harmony search algorithm, Greedy local search, Nurse rostering problem

Large scale applications of HSASession 4


ICHSA 2015 | 35


Sess

ion

4Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

5Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

4-3

A Harmony Search Approach for the Selective Pick-up and Delivery Problem with Delayed Drop-off

Javier Del Ser1, 3, Miren Nekane Bilbao2, Cristina Perfecto2 and Sancho Salcedo-Sanz3

1 OPTIMA (Optimization, Modeling and Analytics) Research Area, TECNALIA, 48160 Derio, Bizkaia, [email protected]

2 Dept. of Communications Engineering, University of the Basque Country UPV/EHU, 48013 Bilbao, Bizkaia, Spain{nekane.bilbao,cristina.perfecto}@ehu.eus

3 Department of Signal Theory and Communications, Universidad de Alcalá de Henares, 28871 Alcalá de Henares, Madrid, Spain

[email protected]

Abstract. In the last years freight transportation has undergone a sharp increase in the scales of its underlying processes and protocols mainly due to the ever-growing community of users and the increasing number of on-line shopping stores. Furthermore, when dealing with the last stage of the shipping chain an additional component of complexity enters the picture as a result of the fixed availability of the destination of the good to be delivered. As such, business opening hours and daily working schedules often clash with the delivery times programmed by couriers along their routes. In case of conflict, the courier must come to an arrangement with the destination of the package to be delivered or, alternatively, drop it off at a local depot to let the destination pick it up at his/her time convenience. In this context this paper will formulate a variant of the so-called courier problem under economic profitability criteria including the cost penalty derived from the delayed drop-off. If the courier delivers the package to its intended destination before its associated deadline, he is paid a reward. However, if he misses to deliver in time, the courier may still deliver it at the destination depending on its availability or, alternatively, drop it off at the local depot assuming a certain cost. The manuscript will formulate the mathematical optimization problem that models this logistics process and solve it efficiently by means of the Harmony Search algorithm. A simulation benchmark will be discussed to validate the solutions provided by this meta-heuristic solver and to compare its performance to other algorithmic counterparts.

Keywords. Courier Problem; Delayed Drop-off; Harmony Search; Genetic Algorithm

4-4

Dandelion-Encoded Harmony Search Heuristics for Opportunistic Traffic Offloading in Synthetically Modeled

Mobile NetworksCristina Perfecto1, Miren Nekane Bilbao1, Javier Del Ser2, 3, Armando Ferro1 and Sancho Salcedo-Sanz3

1 Dept. of Communications Engineering, University of the Basque Country UPV/EHU, 48013 Bilbao, Bizkaia, Spain{cristina.perfecto,nekane.bilbao,armando.ferro}@ehu.eus, http://www.ehu.eus

2 OPTIMA (Optimization, Modeling and Analytics) Research Area, TECNALIA, 48160 Derio, Bizkaia, [email protected]

3 Department of Signal Theory and Communications, Universidad de Alcalá de Henares, 28871 Alcalá de Henares, Madrid, Spain

[email protected]

36 | ICHSA 2015

Abstract. The high data volumes being managed by and transferred through mobile networks in the last few years are the main rationale for the upsurge of research aimed at finding efficient technical means to offload exceeding traffic to alternative communication infrastructures with higher transmission bandwidths. This idea is solidly buttressed by the proliferation of short-range wireless communication technologies (e.g. mobile devices with multiple radio interfaces), which can be conceived as available opportunistic hotspots to which the operator can reroute exceeding network traffic depending on the contractual clauses of the owner at hand. Furthermore, by offloading to such hotspots a higher effective coverage can be attained by those operators providing both mobile and fixed telecommunication services. In this context, the operator must decide if data generated by its users will be sent over conventional 4G+/4G/3G communication links, or if they will instead be offloaded to nearby opportunistic networks assuming a contractual cost penalty. Mathematically speaking, this problem can be formulated as a spanning tree optimization subject to cost-performance criteria and coverage constraints. This paper will elaborate on the efficient solving of this optimization paradigm by means of the Harmony Search meta-heuristic algorithm and the so-called Dandelion solution encoding, the latter allowing for the use of conventional meta-heuristic operators maximally preserving the locality of tree representations. The manuscript will discuss the obtained simulation results over different synthetically modeled setups of the underlying communication scenario and contractual clauses of the users.

Keywords. Traffic offloading, Coverage extension, Dandelion code, Harmony Search

4-5

A New Parallelization Scheme for Harmony Search AlgorithmDonghwi Jung1, Ji-Ho Choi2, Younghwan Choi2, Joon Hoon Kim2

1Research Center for Disaster Prevention Science and Technology, Korea University, Seoul, South Korea [email protected]

2School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, South Korea 136-713

[email protected], {younghwan87, jaykim}@korea.ac.kr

Abstract. During the last two decades, parallel computing has drawn attention as an alternative to lessen computational burden in the engineering domain. Parallel computing has also been adopted for meta-heuristic optimization algorithms which generally require large number of functional evaluations because of their random nature of search. However, traditional parallel approaches, which distribute and perform fitness calculations concurrently on the processing units, are not intended to improve the quality of solution but to shorten CPU computation time. In this study, we propose a new parallelization scheme to improve the effectiveness and efficiency of harmony search. Four harmony searches are simultaneously run on the processors in a work station, sharing search information (e.g., a good solution) at the predefined iteration intervals. The proposed parallel HS is demonstrated through the optimization of an engineering planning problem.

Keywords. Parallel Computing, Processing Unit, Solution Quality, Harmony Search, Engineering Planning Problem


ICHSA 2015 | 37


5-1

Modified Blended Migration and Polynomial Mutation in Biogeography-based Optimization

Jagdish Chand Bansal1

1South Asian University New Delhi, [email protected]

Abstract. Biogeography-based optimization is a recent addition in the class of population based gradient free search algorithms. Due to its simplicity in implementation and presence of very few tuning parameters, it has become very popular in very short span of time. From its inception in 2008, it has seen many changes in different steps of the algorithms. This paper incorporates the modified blended migration and polynomial mutation in the basic version of BBO. The proposed BBO is named as BBO-MBLX-PM. The performance of proposed BBO is explored over 20 test problems and compared with basic BBO as well as blended BBO. Results show that BBO-MBLX-PM outperforms over BBO and other considered variants of BBO.

Keywords. Biogeography based optimization, Meta-heuristics, Evolutionary Algorithms

5-2

A Modified Biogeography Based OptimizationPushpa Farswan1, Jagdish Chand Bansal1, Kusum Deep2

1 South Asian University New Delhi, [email protected], [email protected]

2 Indian Institute of Technology Roorkee, India [email protected]

Abstract. Biogeography based optimization (BBO) has recently gain interest of researchers due to its efficiency and existence of very few parameters. The BBO is inspired by geographical distribution of species within islands. However, BBO has shown its wide applicability to various engineering optimization problems, the original version of BBO sometimes does nt perform up to the mark. Poor balance of exploration and exploitation is the reason behind it. Migration, mutation and elitism are three operators in BBO. Migration operator is responsible for the information sharing among candidate solutions (islands). In this way, the migration operator plays an important role for the design of an efficient BBO. This paper proposes a new migration operator in BBO. The so obtained BBO shows better diversified search process and hence finds solutions more accurately with high convergence rate. The BBO with new migration operator is tested over 20 test problems. Results are compared with that of original BBO and Blended BBO. The comparison which is based on efficiency, reliability and accuracy shows that proposed migration operator is competitive to the present one.Keywords. Biogeography based optimization, Blended BBO, Migration operator

Other Nature-inspired AlgorithmsSession 5

Sess

ion

5Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

38 | ICHSA 2015

5-3

Tournament Selection based Probability Scheme in Spider Monkey Optimization Algorithm

Kavita Gupta1, Kusum Deep1

1Department of Mathematics Indian Institute of Technology RoorkeeRoorkee – 247667, Uttarakhand, India

[email protected], [email protected]

Abstract. In this paper, a modified version of Spider Monkey Optimization (SMO) algorithm is proposed. This modified version is named as Tournament selection based Spider Monkey Optimization (TS-SMO). TS-SMO replaces the fitness proportionate probability scheme of SMO with tournament selection based probability scheme with an objective to improve the exploration ability of SMO by avoiding premature convergence. The performance of the proposed variant is tested over a large benchmark set of 46 unconstrained benchmark problems of varying complexities broadly classified into two categories: scalable and non-scalable problems. The performance of TS-SO is compared with that of SMO. Results for scalable and non-scalable problems have been analysed separately. A statistical test is employed to access the significance of improvement in results. Numerical and statistical results show that the proposed modification has a positive impact on the performance of original SMO in terms of reliability, efficiency and accuracy.

Keywords. Spider Monkey Optimization; Tournament Selection; unconstrained optimization; Swarm Intelligent techniques

5-4

Optimal Extraction of Bioactive Compounds from Gardenia using Laplacian Biogoegraphy Based Optimization

Vanita Garg1, Kusum Deep1

1 Department of Mathematics, Indian Institute of Technology, Roorkee, Roorkee, India 247-667

{vanitagarg16, kusumdeep}@gmail.com

Abstract. Bioactive compounds form different plant materials are used in a number of important pharmaceutical, food and chemical industries. Many conventional and unconventional methods are available to extract optimum yields of these bioactive compounds from various plant materials. This paper focuses on the extraction of bioactive compounds (crocin, geniposide and total phenolic compounds) from Gardenia (Gardenia jasminoides Ellis) by modeling the problem as a nonlinear optimization problem with multiple objectives. There are three objective functions each representing the maximizing of three bioactive compounds i.e. crocin, geniposide and total phenolic compounds. Each of the bioactive compounds are dependent on three factors namely: concentration of ethanol, extraction temperature and extraction time. The solution methodology is a recently proposed Laplacian Biofeographical Based Optimization. The results obtained are compared with previously reported results and show a significant improvement, thus exhibiting not only the superior performance of Laplacian Biogeographical Based Optimization, but also the complexity of the problem at hand.

Keywords. Biogeography-Based Optimization, Response Surface Methodology, RCGA, Extraction of compounds, Laplacian BBO


ICHSA 2015 | 39


Sess

ion

5Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 6

Sess

ion

7Se

ssio

n 8

Sess

ion

9

5-5

Physical Interpretation of River Stage Forecasting Using Soft Computing and Optimization Algorithms

Youngmin Seo1, Sungwon Kim2, Vijay P. Singh3

1 Adjunct Professor, Department of Constructional Disaster Prevention Engineering, Kyungpook National University, Sangju, South Korea, 742-711

[email protected] Associate Professor, Department of Railroad and Civil Engineering,

Dongyang University, Yeongju, South Korea, [email protected]

3 Caroline & William N. Lehrer Distinguished Chair and Distinguished Professor, Department of Biological and Agricultural Engineering & Zachry Department of Civil Engineering, Texas A & M University, College Station, Texas, 77843-2117

[email protected]

Abstract. This study develops river stage forecasting models combining Support Vector Regression (SVR) and optimization algorithms. The SVR is applied for forecasting river stage, and the optimization algorithms, including Grid Search (GS), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Artificial Bee Colony (ABC), are applied for searching the optimal parameters of the SVR. For assessing the applicability of models combining SVR and optimization algorithms, the model performance is compared with ANN and ANFIS models. In terms of model efficiency, SVR-GS, SVR-GA, SVR-PSO and SVR-ABC models yield better results than ANN and ANFIS models. SVR-PSO and SVR-ABC models produce relatively better efficiency than SVR-GS and SVR-GA models. SVR-PSO and SVR-ABC yield the best performance in terms of model efficiency. Results indicate that river stage forecasting models combining SVR and optimization algorithms can be used as an effective tool for forecasting river stage accurately.

Keywords. Support vector regression, grid search, genetic algorithm, particle swarm optimization, artificial bee colony

40 | ICHSA 2015

6-1

Harmony Search Algorithm for High-Demand Facility Locations Considering Traffic Congestion and

Greenhouse Gas EmissionYoonseok Oh1, Umji Park1,Seungmo Kang1

1School of Civil, Environmental and Architectural Engineering,Korea University, Seoul, South Korea 136-713

{ysoh0223, puj2860, s_kang}@korea.ac.kr

Abstract. Large facilities in urban areas generate lots of traffic and cause congestion that waste social time and become a major source of greenhouse gas (GHG). To overcome a shortcoming of the fixed transportation cost in conventional facility models, the congestion effect by facility users as well as general drivers in networks, with increased GHG emission is considered. In this paper, several Harmony Search algorithms with local search are developed and compared to the existing Tabu Search algorithm in a variety of networks. The results demonstrate that the proposed approach and local search method can find better or comparable solution than other methods within a given time.

Keywords. Facility Location Problem, Harmony Search Algorithm, Traffic Congestion, Greenhouse Gas Emission

6-2

Optimum configuration of helical piles with material cost minimized by harmony search algorithm

Kyunguk Na1, Dongseop Lee1, Hyungi Lee1, Kyoungsik Jung2, Hangseok Choi1

1School of Civil, Environmental and Architectural Engineering, Korea University, Mail address Korea Univ. Anam Campus, Anam-dong 5-ga, Seongbuk-gu, Seoul, Korea

{magicnapal, steallady, unin219,hchoi2}@korea.ac.kr2S-TECH Consulting group, Mail address371-19, Sinsu-dong, Mapo-gu, Seoul, Korea

[email protected]

Abstract. Helical piles are a manufactured steel foundation composed of one or multiple helix plates affixed to a central shaft. A helical pile is installed by rotating the central shaft with hydraulic torque motors. There are three representative theoretical predictions for the bearing capacity of helical piles: individual bearing method, cylindrical shear method, and torque correlation method. The bearing capacity of helical piles is governed by the helical pile’s configuration, geologic conditions and penetration depth. The high variability of influence factors makes an optimum design for helical pile configuration difficult in practice. In this paper, the harmony search algorithm is adopted to minimize the material cost of helical piles by optimizing the components composing a helical pile based on the proposed bearing capacity prediction.

Optimization in Civil Engineering ISession 6


ICHSA 2015 | 41


Sess

ion

6Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 5

Sess

ion

7Se

ssio

n 8

Sess

ion

9

The optimization process based on the combined prediction method with the aid of the harmony search algorithm leads to an economical design by saving about 27percent of the helical pile material cost.

Keywords. Helical pile, Individual bearing method, Cylindrical shear method, Combined prediction method, Harmony search algorithm

6-3

A Preliminary Study for Dynamic Construction Site Layout Planning Using Harmony Search Algorithm

Dongmin Lee1, Hyunsu Lim2, Myungdo Lee1, Hunhee Cho1, Kyung-In Kang1

1School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, South Korea 136-713

{ldm1230, iroze00, hhcho, kikang}@korea.ac.kr2Research and Development Center,

Yunwoo Technology Co. Ltd., Seoul, South Korea [email protected]

Abstract. Construction site layout planning is a dynamic multi-objective optimization problem since there are various temporary facilities(TFs) employed in the different construction phase. This paper proposes the use of harmony search algorithm(HSA) to solve the problem that assigning TFs to inside of the building. The suggested algorithm shows a rapid convergence to an optimal solution in a short time. In addition, comparative analysis with Genetic Algorithm(GA) is conducted to prove the efficiency of the proposed algorithm quantitatively.

Keywords. Site layout planning, optimization, harmony search

6-4

Economic Optimization of Hydropower Storage Projects Using Alternative Thermal Powerplant Approach

Sina Raeisi1, S.Jamshid Mousavi1, Mahmoud Taleb Beidokhti2, Bentolhoda A. Rousta1, Joong Hoon Kim3

1 School of Civil and Environmental Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, [email protected], [email protected], [email protected]

2 Iran Water and Power Resources Development Company (IWPC), Tehran, [email protected]

3 School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, South Korea [email protected]

42 | ICHSA 2015

Abstract. This paper presents a simulation-optimization model integrating particle swarm optimization (PSO) algorithm and sequential streamflow routing (SSR) method to maximize the net present value (NPV) of a hydropower storage development project. In the PSO-SSR model, the SSR method simulates the operation of reservoir and its powerplant on a monthly basis over long term for each set of controllable design and operational variables, which includes dam reservoir and powerplant capacities as well as reservoir rule curve parameters, being searched for by the PSO algorithm. To evaluate the project NPV for each set of the controllable variables, the “alternative thermal powerplant (ATP)” approach is employed to determine the benefit term of the project NPV. The PSO-SSR model has been used in the problem of optimal design and operation of Garsha hydropower development project in Iran. Results show that the model with a simple, hydropower standard operating policy results in an NPV comparable to another model optimizing operating policies.

Keywords. Hydropower, particle swarm optimization, alternative thermal powerplant and operating policy

6-3

Simulation Optimization for Optimal Sizing of Water Transfer Systems

Nasrin Rafiee Anzab1, S. Jamshid Mousavi1, Bentolhoda A. Rousta1, Joong Hoon Kim2

1 School of Civil and Environmental Engineering, Amirkabir University of Technology, Tehran, [email protected], {jmosavi, roosta.hoda}@aut.ac.ir2 School of Civil, Environmental and Architectural Engineering

Korea University, Seoul, South [email protected]

Abstract. Water transfer development projects (WTDPs) could be considered in arid and semi-arid areas in response to uneven distribution of available water resources over space. This paper presents a simulation-optimization model by linking Water Evaluation and Planning System (WEAP) to particle swarm optimization (PSO) algorithm for optimal design and operation of the Karoon-to- Zohreh Basin WTDP in Iran. PSO searches for optimal values of design and operation variables including capacities of water storage and transfer components as well as priority numbers of reservoirs target storage levels, respectively; And WAEP evaluates the system operation for any combinations of the design and operation variables. The results indicate that the water transfer project under consideration can supply water for the development of Dehdash and Choram Cropland (DCCL) in an undeveloped area located in Kohkiloyeh Province.

Keywords. Water transfer systems, simulation-optimization, WEAP, PSO


ICHSA 2015 | 43


7-1

Online Support Vector Machine: A SurveyXujun Zhou1, Xianxia Zhang1, Bing Wang1

1 Shanghai Key Laboratory of Power Station Automation Technology, College of Mechatronics Engineering and Automation, Shanghai University, Shanghai [email protected], [email protected],

[email protected]

Abstract. Support Vector Machine (SVM) is one of the fastest growing methods of machine learning due to its good generalization ability and good convergence performance; it has been successfully applied in various fields, such as text classification, statistics, pattern recognition, and image processing. However, for real-time data collection systems, the traditional SVM methods could not perform well. In particular, they cannot well cope with the increasing new samples. In this paper, we give a survey on online SVM. Firstly, the description of SVM is introduced, then the brief summary of online SVM is given, and finally the research and development of online SVM are presented.

Keywords. Support Vector Machine, Machine learning, generalization ability, convergence

7-2

Computation of daily solar radiation using wavelet and support vector machines: A case studySungwon Kim1, Youngmin Seo2, Vijay P. Singh3

1Associate Professor, Department of Railroad and Civil Engineering, Dongyang University, Yeongju, Republic of Korea, 750-711,

[email protected] 2Adjunct Professor, Department of Constructional Disaster Prevention Engineering,

Kyungpook National University, Sangju, Republic of Korea, 742-711, [email protected]

3Caroline & William N. Lehrer Distinguished Chair and Distinguished Professor, Department of Biological and Agricultural Engineering & Zachry Department of Civil Engineering,

Texas A & M University, College Station, Texas, 77843-2117, [email protected]

Abstract. The objective of this study is to apply a hybrid model for estimating solar radiation and investigate its accuracy. A hybrid model is wavelet-based support vector machines (WSVMs). Wavelet decomposition is employed to decompose the solar radiation time series components into approximation and detail components. These decomposed time series are then used as input of support vector machines (SVMs) modules in the WSVMs model. Based on statistical indexes, results indicate that WSVMs can successfully be used for the estimation of daily global solar radiation at Champaign and Springfield stations in Illinois.

Keywords. Support vector machines, wavelet decomposition, solar radiation

Related Areas and Computational IntelligenceSession 7

Sess

ion

7Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 5

Sess

ion

6Se

ssio

n 8

Sess

ion

9

44 | ICHSA 2015

7-3

The Discovery of Financial Market Behavior integrated Data Mining on ETF in Taiwan

Bo-Wen Yang1, Mei-Chen Wu1, Chiou-Hung Lin2, Chiung-Fen Huang1, An-Pin Chen1

1 Institute of Information Management, National Chiao Tung University, HsinChu 30010, Taiwan, R.O.C{nike4859, mcwu0715, amanda.huangcf, apc888888}@gmail.com

2 Department of Information Management, Minghsin University of Science and Technology, HsinChu 30401, Taiwan, R.O.C

Institute of Information Management,National Chiao Tung University, HsinChu 30010, Taiwan, R.O.C

[email protected]

Abstract. In practice, many physics principles have been employed to derive various models of financial engineering. However, few studies have been done on the feature selection of finance on time series data. The purpose of this paper is to determine if the behavior of market participant can be detected from historical price. For this purpose, the proposed algorithm utilizes back propagation neural network (BPNN) and works with new feature selection approach in data mining, which is used to generate more information of market behavior. This study is design for exchange-traded fund (ETF) to develop the day-trade strategy with high profit. The results show that BPNN hybridized with financial physical feature, as compared with the traditional approaches such as random walk, typically result in better performance.

Keywords. Data mining, back-propagation neural network (BPNN), exchange-traded fund (ETF), financial physics, behavior discovery

7-4

Data Mining Application to Financial Market to Discover the Behavior of Entry Point - A Case Study of Taiwan Index

Futures MarketMei-Chen Wu1, Bo-Wen Yang1, Chiou-Hung Lin2, Ya-Hui Huang1, An-Pin Chen1

1 Institute of Information Management,National Chiao Tung University, HsinChu 30010, Taiwan, R.O.C

{mcwu0715, nike4859, sh9107272000, apc888888}@gmail.com2 Department of Information Management,

Minghsin University of Science and Technology, HsinChu 30401, Taiwan, R.O.CInstitute of Information Management,

National Chiao Tung University, HsinChu 30010, Taiwan, [email protected]

Abstract. The value of the investment method is that investors who are anxious to pursue, there are many value investing


ICHSA 2015 | 45


Sess

ion

7Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 5

Sess

ion

6Se

ssio

n 8

Sess

ion

9

methods have been proposed, but only a minority of the value investing method were proved to be effective. The study is based on messages generated defined value of the investment by Steidlmayer in 1984 proposed market profile theory. In order to extract trading behavior of dealer and product value by the huge financial trading information, the model used the trading data to capture feature patterns, and find the double distribution trend day generated by market profile. The experimental results show the single print as an entry point, and the reference to historical support and pressure line as an exit point. The results show the returns are 24.09 points and the accuracy achieved 57.45%.The results had shown the analysis model can find the investment goods real value from the huge trading information, and help investors obtain excess returns.

Keywords. Data mining, market profile theory, double distribution trend day, TAIEX futures, pressure support line

7-5

Sensitivity of sensors built in smartphonesZoltan Horvath1, Ildiko Jenak1, Tianhang Wu 2, Cui Xuan 2

1 Department of Information Technology, Faculty of Sciences, University of Pecs, Pecs, Hungary 7624

{hz}@gamma.ttk.pte.hu2 Northwestern Polytechnical University,

Xi’an Shaanxi, P.R. China [email protected], [email protected]

Abstract. In our earlier researches we examined the reliability and accuracy of sensors used in outdoor positioning. Results have shown that they are not as reliable as many think. So the question rightly arises: what sensor could be the solution for indoor navigation. The sensitivity and resilience of smartphone sensors are currently unknown, and their reliability is also questionable because of the many distracting factors. However, studies also show that it is possible to decrease distraction-caused errors with the help of appropriate algorithms. Hence first we must define sensitivity of sensors and understand their operational principles to find the appropriate algorithms.

Keywords. Indoor positioning, accelerometer, gyroscope, sensors sensitivity, smart phones

46 | ICHSA 2015

8-1

Performance evaluation of the Genetic Landscape Evolution (GLE) model with respect to crossover schemes

JongChun Kim1 and Kyungrock Paik1

1 School of Civil, Environmental, and Architectural Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul, 136-713 South Korea

[email protected]; [email protected]

Abstract. We investigate performance of the Genetic Landscape Evolution (GLE) model by changing number of crossover points, which controls spatial cohesiveness of topological information in generated offspring. Simulation results show that 1) GLE performance is insensitive to the number of crossover points, implying that the spatial cohesiveness does not significantly affect efficiency to find better solution sets; and 2) the method to generate randomness in GLE is a significant element for its performance.

Keywords. Optimal channel network, Genetic landscape evolution, Genetic algorithm, 2-D crossover

8-2

Optimal Design of Permeable Pavement using Harmony Search Algorithm with SWMM

Young-wook Jung1, Shin-in Han1, Deokjun Jo2

1R&D Team, Seoyeong Engineering Co., Ltd,Seongnamsi, Gyeonggi-do, Seoul, South Korea 463-825

{ywjung815, sihan}@seoyeong.co.kr2Corresponding author, Civil Engineering Department, Dongseo University, Busan, South Korea 617-716

[email protected]

Abstract. The permeable pavement is one of representative Low Impact Development (LID) facilities which were used to reduce flooding and recover the water cycle in urban environments. Since the unit cost of porous pavement is greater than that of non-porous pavement, the designs of permeable pavement need to consider reduction effect of rainwater runoff and cost of facilities. These are determined by the size and location of facilities. In this study, the optimal design of permeable pavement, considering the size and location of that, was simulated in a developed optimization model using the Harmony Search (HS)algorithm connected to the Storm Water Management Model (SWMM) to calculate urban Rainfall-Runoff.

Keywords. Harmony Search Algorithm, LID, permeable pavement, SWMM

Optimization in Civil Engineering IISession 8


ICHSA 2015 | 47


Sess

ion

8Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 5

Sess

ion

6Se

ssio

n 7

Sess

ion

9

8-3

Development of Mathematical Model Using Group Contribution Method to Predict Exposure Limit Values in Air

for Safeguarding HealthMohanad El-Harbawi1, Phung Thi Kieu Trang2

1Department of Chemical Engineering, College of Engineering, King Saud University, Riyadh 11421, Kingdom of Saudi Arabia

[email protected] Engineering Department, Universiti Teknologi PETRONAS, Bandar Seri Iskandar, 31750 Tronoh, Perak, Malaysia

[email protected]

Abstract. Occupational Exposure Limits (OELs) are representing the amount of a workplace health hazard that most workers can be exposed to without harming their health. In this work, a new Quantitative Structure Property Relationships (QSPR) model to estimate occupational exposure limits values has been developed. The model was developed based on a set of 100 exposure limit values, which were published by the American Conference of Governmental Industrial Hygienists (ACGIH). MATLAB software was employed to develop the model based on a combination between Multiple Linear Regression (MLR) and polynomial models. The results showed that the model is able to predict the exposure limits with high accuracy, R2 = 0.9998. The model can be considered scientifically useful and convenient alternative to experimental assessments.Keywords. OELs, group contribution method, QSPR, MATLAB

8-3

Optimization of Water Distibution Networks with Differential Evolution (DE)

Ramin Mansouri1, Hasan Torabi2, Hosein Morshedzadeh3

1 Ph. D. Student; Water Eng. Dep. Lorestan University, KhoramAbad, Iran

[email protected] Assist. Prof., Water Eng. Dep.

Lorestan University, KhoramAbad, Iran3 Ph. D. Student; Economics and Management Dep.

Tehran University, Tehran, Iran.

Abstract: Nowadays, due to increasing population and water shortage and competition for its consumption, especially in the agricultural that is the largest consumer of water, proper and suitable utilization and optimal use of water resources is essential. One of the important parameters in agriculture field is water distribution network. In this research, differential evolution algorithm (DE) was used to optimize Ismail Abad water supply network. This network that is pressurized network and includes 19 pipes and nodes 18. Optimization of the network has been evaluated by developing an optimization model based on DE algorithm in MATLAB and the dynamic connection with EPANET software for network hydraulic calculation. The developing model was run for the scale factor (F), the crossover constant (Cr), initial population (N) and the number of generations (G) and was identified best adeptness for DE algorithm is 0.6, 0.5, 100 and 200 for F and Cr, N and G, respectively. The optimal solution was compared with the classical empirical method and results showed that Implementation cost of the network by DE algorithm 10.66% lower than the classical empirical method. Keywords: Differential Evolution algorithm, optimization, distribution systems, crossover constant, scale factor

48 | ICHSA 2015

9-1

Artificial Satellite Heat Pipe Design Using Harmony SearchZong Woo Geem1

1 Department of Energy IT, Gachon University, Seongnam-si, Gyeonggi-do, South Korea [email protected]

Abstract. The design of an artificial satellite requires an optimization of multiple objectives with respect to performance, reliability, and weight. In order to consider these objectives simultaneously, multi-objective optimization technique can be considered. In this chapter, a multi-objective method considering both thermal conductance and heat pipe mass is explained for the design of a satellite heat pipe. This method has two steps: at first, each single objective function is optimized; then multi-objective function, which is the sum of individual error between current function value and optimal value in terms of single objective, is minimized. Here, the multi-objective function, representing thermal conductance and heat pipe mass, has five design parameters such as 1) length of conduction fin, 2) cutting length of adhesive attached area, 3) thickness of fin, 4) adhesive thickness, and 5) operation temperature of the heat pipe. Study results showed that the approach using harmony search found better solution than traditional calculus-based algorithm, BFGS.

Keywords. Artificial satellite heat pipe, Harmony Search, Optimization

9-2

A Pareto-based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem

Jingnan Shen1, Ling Wang1, Jin Deng1, Xiaolong Zheng1

1Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing, 100084, P.R. China

[email protected], [email protected], {dengj13, zhengxl11}@mails.tsinghua.edu.cn

Abstract. In this paper, a Pareto-based discrete harmony search (P-DHS) algorithm is proposed to solve the reentrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. For each job, the operation set of each pass is regarded as a sub-job. To adopt the harmony search algorithm to solve the RHFSP, each harmony vector is represented by a discrete sub-job sequence, which determines the priority to allocate all the operations. To handle the discrete representation, a novel improvisation scheme is designed. During the search process, the explored non-dominated solutions are stored in the harmony memory with a dynamic size. The influence of the parameter setting is investigated, and numerical tests are carried out based on some benchmarking instances. The comparisons to some existing algorithms in terms of several performance metrics demonstrate the effectiveness of the P-DHS algorithm.

Keywords. Harmony search, Improvisation scheme, Reentrant hybrid flowshop scheduling, Bi-objective, Pareto dominance

Multi-objectives variants of HSASession 9


ICHSA 2015 | 49


Sess

ion

8Se

ssio

n 1

Sess

ion

2Se

ssio

n 3

Sess

ion

4Se

ssio

n 5

Sess

ion

6Se

ssio

n 7

Sess

ion

9

9-3

A Multi-objective Optimisation Approach to Optimising Water Allocation in Urban Water Systems

S. Jamshid Mousavi1, Kourosh Behzadian2, Joong Hoon Kim3, Zoran Kapelan2

1 School of Civil and Environmental Engineering, Amirkabir University of Technology, Tehran, [email protected]

2 Centre for Water Systems, College of Engineering, Mathematics and Physical Sciences, University of Exeter, UK{k.behzadian-moghadam, z.kapelan}@exeter.ac.uk


[email protected]

Abstract. Lack of available surface water resources and increasing depletion of groundwater are the major challenges of urban water systems (UWSs) in semi-arid regions. This paper presents a long term multi-objective optimisation model to identify optimal water allocation in UWS. The objectives are to maximize reliability of water supply and minimize total operational costs while restricting the annual groundwater withdrawal. Pumping water from a dam reservoir and water recycling schemes are two alternatives for supplying water to increasing water demands over the planning horizon. The developed approach is demonstrated through its application to the UWS of Kerman City in Iran. The Pareto-optimal solutions are obtained as a trade-off between reliability of water supply and operational costs in the Kerman UWS. The results show that addition of recycled water to the water resources can provide the least cost-effective and most efficient way for meeting future water demands in different states of groundwater abstractions.

Keywords. Urban water systems, water allocation and multi-objective optimisation

9-4

Seismic Reliability-based Design of Water Distribution Networks using Multi-objective Harmony Search Algorithm

Do Guen Yoo1, Donghwi Jung1, Ho Min Lee2, Young Hwan Choi2, Joong Hoon Kim2

1 Research Center for Disaster Prevention Science and Technology, Korea University, Seoul, South Korea 136-713

[email protected], [email protected] School of Civil, Environmental and Architectural Engineering,

Korea University, Seoul, South Korea 136-713{dlgh86, younghwan87, jaykim}@korea.ac.kr

Abstract. In the last four decades, many studies have been conducted for least-cost and maximum-reliability design of water supply systems. Most models employed multi-objective genetic algorithm (e.g., non-dominated sorting genetic algorithm-II, NSGA-II) in order to explore trade-off relationship between the two objectives. This study proposes a reliability-based design model that minimizes total cost and maximizes seismic reliability. Here, seismic reliability is defined as the ratio of available demand to required water demand under earthquakes. Multi-objective Harmony Search Algorithm (MoHSA) is developed to efficiently search for the Pareto optimal solutions in the two objectives solution space and incorporated in the proposed reliability-based design model. The developed model is applied to a well-known benchmark network and the results are analyzed.

Keywords. Optimal Design, Multi-objective, Harmony Search Algorithm, Earthquake Hazard

50 | ICHSA 2015

Please arrive your session at least 15 minutes before the session begins.The time allocated for each oral presentation is 18 minutes: 15 minutes presentation and 3 minutes questions and answers.Each room is equipped with one Windows-based PC, beam projector(s) and screen(s), and one laser pointer. Please bring your presentation files in USB thumb drives only.Please upload the presentations before the session begins so that the support technicians can help the presenters.The basic software for oral presentation is Microsoft PowerPoint. If you need to use other software, please contact us by e-mail in advance.We recommend that you bring at least 2 copies of your presentation to the meeting for backup purposes.At the end of the meeting, all presentation files will be deleted.

Session chairs:

Please arrive at the Session Room at least 15 minutes before session and briefly meet the speakers.Please remind them that each speaker will have 18 minutes to present their research including questions and answers.Introduce each speaker giving their name, their affiliation, title of their presentation, and other brief information appropriately. Politely inform the speakers when their time limit is approaching by ringing a bell.When the announced presentations have been completed, elicit questions and comments from the participants.

Reminders

If your paper will not be presented, you must contact to ICHSA Secretariat immediately ([email protected])Technical assistance is available throughout the session.

Outstanding Paper Awards Awards will be presented for outstanding papers and presentations during the closing ceremony of the conference. Each session chair has carefully reviewed these abstracts before the conference. During the conference, each presentation will be thoroughly evaluated. Outstanding presentations will be chosen and awarded during the closing ceremony.

Presenters:

Presentation Guidelines

ICHSA 2015 | 51


Complimentary Coffees

Upon your registration, you will find coffee vouchers included in your registration package. These are complimentary coffee vouchers which can be used at any cafes conveniently located inside Hana Square. You will get a cup of either hot/ice Americano and cafelatte at these conveniently located places in a relaxing environment.

Lunch

Upon your registration, you will find two lunch vouchers included in your registration package. You can use them at the restaurant located on the 1st floor of Techno-Complex Resarch Center Lunch is available between 12:30~13:30

Banquet

Date: 20th Aug. (Thu)Time: 18:30 ~ 20:00Venue: Makinochaya (near Gwanghwamum Square)Address: Le Meilleur Jongno Town, 24, Jongno 1-ga, Jongno-gu, SeoulTel: +82-2-2075-6500Banquet at this modern sea food buffet restrant is included in your registration. Please make sure whether you will join for

the banquet at the registration desk to help us organize transportation etc. Buses will leave Hana Square at 6:15, 20th Aug. please be around registration desk after final session and get on the buses following Staff Guidance.

Free Wi-Fi inside Hana Square

Free Wi-Fi service will be provided inside Hana Square during ICHSA 2015 (19 – 21, August, 2015). All participants can freely access internet form your smartphone, tablet, or laptop using the following ID and Password:ID: ICHSA 2015 Password: ICHSA 2015@If you cannot access Wi-Fi using above information, please visit our registration desk.

Coffees, Meals, and Wi-Fi

Techno-Complex Resarch Center

Hana Square

Makinochaya

Subway Line#5GwanghwamumSquare

CheonggyecheonSteam

Jonggak station Line #1

52 | ICHSA 2015

Accommodations

Once you find your accommodation for ICHSA, it would be better to book (reserve) your accommodation via the following site: www.hotels.com. Subway (Metro) is the most convenient transportation in Seoul. Therefore, it would be better to locate your accommodation close to subway station for your convenience. If you may not find your suitable accommodation, Please find one from the below listed accommodations:

Holiday Inn Seongbuk Seoul

3-1343, Jongam-dong, Seongbuk-gu, Seoul, [email protected]: //www.holiday.co.kr/eng/index.htmTransportation: 10 mins from Hana Square (Using No. 1111 bus or Taxi)

Ramada Encore Seoul Dongdaemun

98-24, Sinseol-dong, Dongdaemun-gu, Seoul, [email protected]://www.ramadaencoreseouldongdaemun.com/US/MAIN/Transportation: 15 mins from Hana Square

( Using Subway Line No. 1 Sineol station ⇨ Dongmyo station change Line No. 6 ⇨ Line No. 6 Ananm station)

(Using Bus No. 101, 144, 111 bus or Taxi)

Best Western New Seoul Hotel

29-1, Taepyeongno 1-ga, Jung-gu, Seoul, Korea+82-2-735-9071http://www.bestwesternnewseoul.co.kr/eng/?lang=engTransportation: 20 mins from Hana Square

( Using Subway Line No. 1 City Hall station ⇨ Dongmyo station ⇨

change Line No. 6 ⇨ Line No. 6 Ananm station)

ICHSA 2015 | 53


Ibis Budget Ambassador Seoul Dongdaemun

238-1, Gwanghui-dong 2-ga, Jung-gu, Seoul, Korea+82-2-2079-8888https://ibisbudget.ambatelen.com/dongdaemun/main.ambTransportation: 20mins from Hana Square

(Using Subway Line No. 2 Dongdaemum History & Culture Park station ⇨ Sindang station change Line No. 6 ⇨ Line No. 6 Anam station)

Center Mark Hotel

198-42, Gwanhun-dong, Jongno-gu, Seoul, Korea+82-2-731-1000http://www.centermarkhotel.com/eng/main/Accommodation fee is available here.Transportation: 20mins from Hana Square

( Using, Subway Line No. 1 Jongno 3(sam)-ga ⇨ Dongmyo station change Line No. 6 ⇨ Line No. 6 Ananm station)

Sunbee Hotel

26, Insadong 7-gil, Jongno-gu Seoul, Korea+82-2-730-3451http://hotelsunbee.com/language/en/Transportation: 20mins from Hana Square

(Using Subway Line No. 1 Jongno 3(sam)-ga ⇨ Dongmyo station change Line No. 6 ⇨ Line No. 6 Ananm station)

Accommodations

54 | ICHSA 2015

Accommodations

Holiday Inn Seongbuk Seoul : Bus No. 1111 or Taxi Ramada Encore Seoul Dongdaemun : Subway Line ① Sinseol Station ⇨ Line ⑥ Dongmyo Station ⇨ Line ⑥ Anam Station

Best Western New Seoul Hotel : Subway Line ① City hall Station ⇨ Line ⑥ Dongmyo Station ⇨ Line ⑥ Anam Station

Ibis Budget Ambassador Seoul : Subway Line ② Dongdaemum History & Culture Park Station ⇨ Line ⑥ Sindang Station ⇨ Line ⑥ Anam Station

Center Mark Hotel, Sunbee Hotel : Subway Line ① Jongno 3(sam)-ga ⇨ Line ⑥ Dongmyo Station ⇨ Line ⑥ Anam Station

Sightseeings : Dongdaemum, Seoul N Tower, Gyeongbokgung Palace, Bukchon Hanok Vilage

Hana Square(Conference location)

Ramada Encore Seoul Dongdaemun

Bukchon HanokVillage

Gyeongbokgung Palace Dondaemun

Seoul N Tower

Holiday Inn Seongbuk Seoul

▼

▼

▼▼

▼

Ibis Budget Ambassador SeoulBest Western New

Seoul Hotel

Sunbee Hotel

Center Mark Hotel

ICHSA 2015 | 55


Airport Train [Incheon / Gimpo Int. Airport ↔ Korea University]On your arrival at either ICN (Incheon) or GMP (Gimpo) airport, we recommend you take an airport train. An airport train station is directly located at ICN or GMP. You take the train from ICN or GMP and off at Gongdeok Station (Lines 5, 6, and Airport Train line).At Gongdeok, you should take Seoul subway Line #6. You will find two platforms of line 6, one is toward ‘Eungam’ and the other is toward ‘Bonghwasan’ direction. Take a train toward ‘Bonghwasan’ direction. The line 6 takes you directly to the center of Korea University. Take off subway at Anam station. Do not get off at ‘Korea University’ station. ‘Anam’ station is closer to Hana Square. Once you arrive at Anam Station, walk out through exit number 4.

Airport Limousine Bus (number 6101)[Incheon Int. Airport ↔ Gimpo Int. Airport ↔ Korea University ↔Holiday Inn Seongbuk]- At the Incheon International airport, you can take limousine bus at bus stops 3B, or 10A on the first floor of

airport. Fare (KWR): about 15,000; Distance 65 km; Duration around 90 minutes.- At the Gimpo International airport, you can find limousine bus stops number 6 located in the first floor of

airport. Fare (KWR): about 10,000; Distance 32 km; Duration around 60 minutes.The limousine bus stops by the Sinseol station and in front of the Holiday Inn Seongbuk in order. It takes 10 mins from Hana Square by Taxi.

SubwaySubway systems offer a convenient way of exploring metropolitan cities in Korea. With just a little guidance, anyone can use the metropolitan subway systems with ease. All fares are exchanged for transportation cards, which are required for passing through the security gates.- Seoul Subway Fares

- Children 6 and younger: Free- Total distances exceeding 10 km (within Seoul): 100 won for each additional 5 km- Total distances exceeding 30 km (outside Seoul): 100 won for each additional 5 km- Total distances exceeding 40 km (within Seoul): 100 won for each additional 10 km

Transportation

Basic Fare for 10 km Age 19 and Older Age 13–18 Age 6–12

Multiple Journey Transportation Cards (T-Money)

1,250 won 720 won 450 won

Single Journey Transportation Cards

1,350 won 1,350 won 450 won

56 | ICHSA 2015

Transportation

ICHSA 2015 | 57


Cash machine/ATM

Users of overseas credit cards should use an ATM with a ‘Global’ sign or the logo of your card company. The operating hour of an ATM is usually between 08:00 to 23:00. ATMs are located in major stations and airports, as well as convenience stores

Credit cards

Most hotels, restaurants, shops and taxies accept major credit cards (VISA, MasterCard and American Express). A piece of identification (passport, ID card or driver’s license) is sometimes required upon payment. Though credit cards are widely accepted in Korea, it is useful to have a small amount of cash with you.

Currency

The currency in Korea is the WON (₩). Denominations for coins are 10, 50, 100, and 500. For banknotes, 1,000, 5,000, 10,000, and 50,000. For higher denominations, cashier’s checks are used. As of April 1, KRW 10,000 equals approximately USD 9.05, CHF 8.47 and EUR 7.97.

Electricity

The standard voltage in Korea is 220 volts. The outlet has two round holes and is the same type used in France, Germany, Austria, Greece, Turkey, and many other countries. Visitors from countries using 110/125 volts might need a multi-voltage adaptor.

Language

Korean is the official language of Korea. If you need interpretation service outside the conference venues, please contact ‘BBB Korea’, a free interpretation service provider. BBB Korea provides interpretation service from and into 19 languages. - Phone Number: 1588-5644

General Information

58 | ICHSA 2015

About Seoul

Gyeongbokgung Palace

Built in 1395, Gyeongbokgung Palace is also commonly referred to as the “Northern Palace” because it is located more toward the north, compared to the neighboring palaces of Changdeok (Eastern Palace) and Gyeonghee (Western Palace). Gyeongbokgung Palace is arguably the most beautiful and remains the grandest of all the five palaces. The premises were destroyed by fire during the Imjinwaeran War (Japanese Invasion, 1592-1598). However, all of the palace’s 7,700 rooms were later restored under the leadership of Heungseondaewongun during the reign of King Gojong (1852-1919) . Remarkably, the most representative edifices of the Joseon Dynasty, Gyeonghoe-ru Pavilion and Hyangwonjeong Pond are still relatively in tact. The National Palace Museum of Korea is located south

of Heungnyemun Gate, and the National Folk Museum is located east within Hyangwonjeong..

Gwanghwamun Plaza

On August 1st, 2009, the redesigned Gwanghwamun Square opened to the public. With the inauguration of the square, Sejong-ro, located at the center of the 600-year-old historic city of Seoul, was transformed into a human-centered space that harmonizes with the beautiful scenery of Gyeongbokgung Palace and Bukaksan Mountain.

Cheonggyecheon Stream

Cheonggyecheon Stream used to exist merely as an overpass neglected in 1970 until it was restored in 2005, becoming a haven of natural beauty amidst the bustle of city life. Narae Bridge, expressing a butterfly in flight, and Gwanggyo Bridge, symbolizing the harmony of the past and future, are just two of the more than twenty beautiful

bridges featured along the path of the stream. The ‘Rhythmic Wall Stream’, lined with fine marble, various sculptures, and Korea’s 8th stone building, Palseokdam, adorn the Cheonggyecheon Stream..

ICHSA 2015 | 59


N Seoul Tower

Opened to the public on October 15, 1980, Seoul Tower has been designated as a major tourist attraction where the beautiful panoramic view of Seoul can been seen. The 236.7 meter high Seoul Tower built on the 243m Mt. Namsan has been known as the best tower in Asia. After 30 years of devoted support from tourists, it was remodeled on December 9, 2005 with a magnificent new look. The letter N signifies a ‘new’ look, and a total construction cost of 15 billion won was invested in to giving Seoul Tower its new look. With the construction of the new lighting system, the appearance, color and pattern of the tower brings change to each season or event. In addition, with the theme of ‘Flower of Seoul,’ lighting with the use of 6 different searchlights from different angles will take place from 7p.m. to midnight..

Bukchon Hanok Village

Bukchon Hanok Village is home to hundreds of traditional houses called ‘hanok’ that date back to the Joseon Dynasty and the name, ‘Bukchon,’ which literally translates to ‘northern village’. Today, many of these hanoks operate as cultural centers, guesthouses, restaurants and tea houses, providing an opportunity to experience, learn and immerse in Korean traditional culture.

Namsan Hanok Village

Namsan Hanok village was well known traditionally for having lots of Yangban’s residence. The Namsan Hanok Village is a place that has real hanok resided by Yangbans. The hanoks were moved from its original place. You can see the real houses of the old days and also lives of Joseon dynasty’s people. Inside the village, there is a garden named namsangol traditional garden, which has traditional Korean plants, a small stream with a pond, and a gazebo. Inside the village, there is a time capsule under 15m of the ground, that has 600 relics representing lives of contemporary people and Seoul city in it..

About Seoul

60 | ICHSA 2015

Han River Cruise

Hangang River Ferry Cruise is one of the best ways to enjoy the scenery around Hangang River that flows through Seoul. On the cruise, you can see Hangang River’s beautiful scenery, the surrounding islands, Jeoldusan Park, the 63 Building, Namsan Tower, and other famous tourist spots. The cruise is often used for weddings, birthday parties, music performances and other events.

63 City

The 63 Building in Yoido stands 264 meters above sea level and is considered one of Seoul’s most well known landmarks. The 60th floor ‘Sky Deck’ of the 63 City Building has been newly remodeled into the ‘Sky Art Museum’, offering a place for art exhibitions, magic shows, and various cultural experiences. Visitors will also be able to enjoy the beautiful scenery of the Hangang River through the observatory’s large windows.

Insadong

Insadong is a place of traditional culture near Gyeongbok palace. Insadong was famous since the Joseon dynasty for having lots of antique shops. Today Insadong is popular among tourists for having lots of traditional teahouses, antique shops, traditional handcraft shops, and lots of other shops. Insa-dong is especially popular with foreign tourists. This is where they can experience and see traditional Korean culture firsthand, and

also purchase pieces of fine art. On the street you can see many foreigners lost in all the joyous festivities of the street.Insadong is a place of traditional culture.

Useful sites

Korea Information Service : www.korea.net Korea Tourism Organization : www.visitkorea.or.kr Korea Customs Service : english.customs.go.kr Ministry of Foreign Affairs : www.mofa.go.kr/ENGMinistry of Culture and Tourism : www.mct.go.kr/english Incheon International Airport : www.airport.kr/eng

About Seoul

Documents

ICHSA 2015 - Korea