• Korean Management Science Review
• /
• v.21 no.3
• /
• pp.23-38
• /
• 2004

Recently the usage of mobile devices which enable the accessibility to Internet has been dramatically increased. Most of the mobile services, however, so far tend to be simple such as infotainment service. In order to fully taking advantage of wireless network and corresponding technology, personalized web service based on user's context could be needed. Meanwhile, optimization techniques have been vitally incorporated for optimizing the development and administration of electronic commerce. However, applying context-aware optimization mechanism to personalized mobile services is still very few. Hence, the purpose of this paper is to propose a methodology to incorporate optimization techniques into personalization services. Multi agent-based web service approach is considered to realize the methodology. To show the feasibility of the methodology proposed in this paper, a prototype system, CAMA-myOPt(Context-Aware Multi-Agent system for my Optimization), was implemented and adopted in mobile comparative shopping.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3030-3049
• /
• 2023

With the development and wide application of hybrid network computing modes like cloud computing, edge computing and fog computing, the customer service requests and the collaborative optimization of various computing resources face huge challenges. Considering the characteristics of network environment resources, the optimized deployment of service resources is a feasible solution. So, in this paper, the optimal goals for deploying service resources are customer experience and service cost. The focus is on the system impact of deploying services on load, fault tolerance, service cost, and quality of service (QoS). Therefore, the alternate node filtering algorithm (ANF) and the adjustment factor of cost matrix are proposed in this paper to enhance the system service performance without changing the minimum total service cost, and corresponding theoretical proof has been provided. In addition, for improving the fault tolerance of system, the alternate node preference factor and algorithm (ANP) are presented, which can effectively reduce the probability of data copy loss, based on which an improved cost-efficient replica deployment strategy named ICERD is given. Finally, by simulating the random occurrence of cloud node failures in the experiments and comparing the ICERD strategy with representative strategies, it has been validated that the ICERD strategy proposed in this paper not only effectively reduces customer access latency, meets customers' QoS requests, and improves system service quality, but also maintains the load balancing of the entire system, reduces service cost, enhances system fault tolerance, which further confirm the effectiveness and reliability of the ICERD strategy.

• Journal of Distribution Science
• /
• v.15 no.2
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• Journal of Information Technology Services
• /
• v.6 no.3
• /
• pp.87-110
• /
• 2007

Recently, researches on IT Service Management (ITSM) for improving information system operation service and information system outsourcing cost estimation model are proliferating. This study suggests a new cost model of IT operation service and optimizing method based upon the characteristics of operation service as a long-term and continuous business service for both user's and service provider's point of view. This study explains the cost optimization model of IT operation service by improving service request management process, such as adequate reception and control, proper valuation, process management using project management methodology, effective organization and time management of service personnel. Especially in this study, service ability improvement effect and fixed operation cost reduction effect are defined to prove the proposed new cost model.

• Journal of Information Technology Services
• /
• v.4 no.2
• /
• pp.125-133
• /
• 2005

Because of paradigm change to web service, numerous institutes have been suggested supporting solution about web service, and actively developed system using web service but it is hard to find out a systematic study for web service performance enhancement. Generally, there are SOAP message processing improvement and configuration optimization of server viewpoint for web service performance enhancement. Web service performance enhancement through SOAP message processing improvement have been studied related research but configuration optimization of server is hard to find out a systematic tuning model and performance criteria. In this paper, I suggested performance testing based tuning model and criteria of configuration optimization of server viewpoint. We executed practical analysis using tuning model about web service in internet. This paper show that the proposed tuning model and performance criteria is applicable to web service performance enhancement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1238-1259
• /
• 2024

Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.

• Korean Management Science Review
• /
• v.21 no.3
• /
• pp.115-127
• /
• 2004

In this paper, we describe an intelligent monitoring and control system for pick-up/delivery service. This system applies geographical information system(GIS), global positioning system(GPS) and wireless communication technologies for managing pick-up/delivery operations more effectively. It consists of three subsystems, pick-up/delivery sequence planning system, pick-up/delivery monitoring system, and PDA execution system. Pick-up/delivery sequence planning system generates routes and schedules for pick-up/delivery using GIS and optimization techniques. Pick-up/delivery monitoring system monitors current positions of vehicles and actual pick-up/delivery results as compared with planned routes and visit times, while PDA execution system transmits information for vehicles positions and actual pick-up/delivery results using GPS and wireless communication technologies. The intelligent monitoring and control system is currently being used for the pick-up parcel service in a local post office of Korea Post.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5780-5802
• /
• 2017

Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.28-36
• /
• 2016

Recently, owing to the development of ICT industry and wide spread of smart phone, the number of people who use car sharing service are increased rapidly. Currently two-way car sharing system with same rental and return locations are mainly operated since this system can be easily implemented and maintained. Currently the demand of one-way car sharing service has increase explosively. But this system have several obstacle in operation, especially, vehicle stock imbalance issues which invoke vehicle relocation. Hence in this study, we present an optimization approach to depot location and relocation policy in one-way car sharing systems. At first, we modelled as mixed-integer programming models whose objective is to maximize the profits of a car sharing organization considering all the revenues and costs involved and several constraints of relocation policy. And to solve this problem efficiently, we proposed a new method based on particle swarm optimization, which is one of powerful meta-heuristic method. The practical usefulness of the approach is illustrated with a case study involving satellite cities in Seoul Metrolitan Area including several candidate area where this kind systems have not been installed yet and already operating area. Our proposed approach produced plausible solutions with rapid computational time and a little deviation from optimal solution obtained by CPLEX Optimizer. Also we can find that particle swarm optimization method can be used as efficient method with various constraints. Hence based on this results, we can grasp a clear insight into the impact of depot location and relocation policy schemes on the profitability of such systems.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.5
• /
• pp.217-224
• /
• 2002

This paper presents an algorithm to obtain an approximate optimal solution for the service restoration and load balancing of large scale radial distribution system in a real-time operation environment. Since the problem is formulated as a combinatorial optimization problem, it is difficult to solve a large-scale combinatorial optimization problem accurately within the reasonable computation time. Therefore, in order to find an approximate optimal solution quickly, the authors proposed an algorithm which combines optimization technique called cyclic best-first search with heuristic based feeder loadings balance index for computational efficiency and robust performance. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the KEPCO's 108 bus distribution system.