Abstract: Travelling salesman problem (TSP) is a combinational
optimization problem and solution approaches have been applied
many real world problems. Pure TSP assumes the cities to visit are
fixed in time and thus solutions are created to find shortest path
according to these point. But some of the points are canceled to visit
in time. If the problem is not time crucial it is not important to
determine new routing plan but if the points are changing rapidly and
time is necessary do decide a new route plan a new approach should
be applied in such cases. We developed a route plan transfer method
based on transfer learning and we achieved high performance against
determining a new model from scratch in every change.
Abstract: Understanding the number of people and the flow of
the persons is useful for efficient promotion of the institution
managements and company-s sales improvements. This paper
introduces an automated method for counting passerby using virtualvertical
measurement lines. The process of recognizing a passerby is
carried out using an image sequence obtained from the USB camera.
Space-time image is representing the human regions which are
treated using the segmentation process. To handle the problem of
mismatching, different color space are used to perform the template
matching which chose automatically the best matching to determine
passerby direction and speed. A relation between passerby speed and
the human-pixel area is used to distinguish one or two passersby. In
the experiment, the camera is fixed at the entrance door of the hall in
a side viewing position. Finally, experimental results verify the
effectiveness of the presented method by correctly detecting and
successfully counting them in order to direction with accuracy of
97%.
Abstract: Tourism industries are rapidly increased for the last
few years especially in Malaysia. In order to attract more tourists,
Malaysian Governance encourages any effort to increase Malaysian
tourism industry. One of the efforts in attracting more tourists in
Malacca, Malaysia is a duck tour. Duck tour is an amphibious
sightseeing tour that works in two types of engines, hence, it required
a huge cost to operate and maintain the vehicle. To other country, it is
not so new but in Malaysia, it is just introduced, thus it does not have
any systematic routing yet. Therefore, this paper proposed an
optimization technique to formulate and schedule this tour to
minimize the operating costs by considering it into Travelling
Salesman Problem (TSP). The problem is then can be solved by one
of the optimization technique especially meta-heuristics approach
such as Tabu Search (TS) and Reactive Tabu Search (RTS).
Abstract: Westudy a dual-channel supply chain under
decentralized setting in which manufacturer sells to retailer and to
customers directly usingan online channel. A customer chooses the
purchase-channel based on price and service quality. Also, to buy
product from the retail store, the customer incurs a transportation cost
influenced by the fluctuating gasoline cost. Both companies are under
the revenue sharing contract. In this contract the retailer share a
portion of the revenue to the manufacturer while the manufacturer
will charge the lower wholesales price. The numerical result shows
that the effects of gasoline costs, the revenue sharing ratio and the
wholesale price play an important role in determining optimal prices.
The result shows that when the gasoline price fluctuatesthe optimal
on-line priceis relatively stable while the optimal retail price moves
in the opposite direction of the gasoline prices.
Abstract: In this paper, we address the problem of reducing the
switching activity (SA) in on-chip buses through the use of a bus
binding technique in high-level synthesis. While many binding
techniques to reduce the SA exist, we present yet another technique for
further reducing the switching activity. Our proposed method
combines bus binding and data sequence reordering to explore a wider
solution space. The problem is formulated as a multiple traveling
salesman problem and solved using simulated annealing technique.
The experimental results revealed that a binding solution obtained
with the proposed method reduces 5.6-27.2% (18.0% on average) and
2.6-12.7% (6.8% on average) of the switching activity when compared
with conventional binding-only and hybrid binding-encoding
methods, respectively.
Abstract: Some quality control tools use non metric subjective information coming from experts, who qualify the intensity of relations existing inside processes, but without quantifying them. In this paper we have developed a quality control analytic tool, measuring the impact or strength of the relationship between process operations and product characteristics. The tool includes two models: a qualitative model, allowing relationships description and analysis; and a formal quantitative model, by means of which relationship quantification is achieved. In the first one, concepts from the Graphs Theory were applied to identify those process elements which can be sources of variation, that is, those quality characteristics or operations that have some sort of prelacy over the others and that should become control items. Also the most dependent elements can be identified, that is those elements receiving the effects of elements identified as variation sources. If controls are focused in those dependent elements, efficiency of control is compromised by the fact that we are controlling effects, not causes. The second model applied adapts the multivariate statistical technique of Covariance Structural Analysis. This approach allowed us to quantify the relationships. The computer package LISREL was used to obtain statistics and to validate the model.
Abstract: In the past decade, artificial neural networks (ANNs)
have been regarded as an instrument for problem-solving and
decision-making; indeed, they have already done with a substantial
efficiency and effectiveness improvement in industries and businesses.
In this paper, the Back-Propagation neural Networks (BPNs) will be
modulated to demonstrate the performance of the collaborative
forecasting (CF) function of a Collaborative Planning, Forecasting and
Replenishment (CPFR®) system. CPFR functions the balance between
the sufficient product supply and the necessary customer demand in a
Supply and Demand Chain (SDC). Several classical standard BPN will
be grouped, collaborated and exploited for the easy implementation of
the proposed modular ANN framework based on the topology of a
SDC. Each individual BPN is applied as a modular tool to perform the
task of forecasting SKUs (Stock-Keeping Units) levels that are
managed and supervised at a POS (point of sale), a wholesaler, and a
manufacturer in an SDC. The proposed modular BPN-based CF
system will be exemplified and experimentally verified using lots of
datasets of the simulated SDC. The experimental results showed that a
complex CF problem can be divided into a group of simpler
sub-problems based on the single independent trading partners
distributed over SDC, and its SKU forecasting accuracy was satisfied
when the system forecasted values compared to the original simulated
SDC data. The primary task of implementing an autonomous CF
involves the study of supervised ANN learning methodology which
aims at making “knowledgeable" decision for the best SKU sales plan
and stocks management.
Abstract: This paper proposes a method that discovers time series event patterns from textual data with time information. The patterns are composed of sequences of events and each event is extracted from the textual data, where an event is characteristic content included in the textual data such as a company name, an action, and an impression of a customer. The method introduces 7 types of time constraints based on the analysis of the textual data. The method also evaluates these constraints when the frequency of a time series event pattern is calculated. We can flexibly define the time constraints for interesting combinations of events and can discover valid time series event patterns which satisfy these conditions. The paper applies the method to daily business reports collected by a sales force automation system and verifies its effectiveness through numerical experiments.
Abstract: Marketing is an essential issue to the survival of any
real estate company in Turkey. There are some factors which are
constraining the achievements of the marketing and sales strategies in
the Turkey real estate industry. This study aims to identify and
prioritise the most significant constraints to marketing in real estate
sector and new strategies based on those constraints. This study is
based on survey method, where the respondents such as credit
counsellors, real estate investors, consultants, academicians and
marketing representatives in Turkey were asked to rank forty seven
sub-factors according to their levels of impact. The results of Multiattribute
analytical technique indicated that the main subcomponents
having impact on marketing in real estate sector are interest rates, real
estate credit availability, accessibility, company image and consumer
real income, respectively. The identified constraints are expected to
guide the marketing team in a sales-effective way.
Abstract: The purpose of this study is to understand how
consumers react to a company's promotional offers with mobile
applications (APP) as premiums. This paper presents the results of an
experimental study where five features of APP were involved: the
cost (free/discounted) for earning APP, the relationship between APP
and the promoted product, the perceived usefulness, the perceived
ease of use, and the perceived playfulness of APP in the context of
light foods purchase. The results support that the above features,
except perceived ease of use, have substantial influences on
consumers' intention to adopt the APP. Among the five features, the
cost for earning APP has the most impact on the adopting intention
of APP. The study also found a positive influence of adopting
intention of APP on the consumer's purchase intention of the
promoted product. Thus, APP-based premiums may enhance the
consumer's purchase intention of a company's promoted products.
Abstract: The study was a case study analysis about Thai Asia
Pacific Brewery Company. The purpose was to analyze the
company’s marketing objective, marketing strategy at company level,
and marketing mix before liquor liberalization in 2000. Methods used
in this study were qualitative and descriptive research approach
which demonstrated the following results of the study demonstrated
as follows: (1) Marketing objective was to increase market share of
Heineken and Amtel, (2) the company’s marketing strategies were
brand building strategy and distribution strategy. Additionally, the
company also conducted marketing mix strategy as follows. Product
strategy: The company added more beer brands namely Amstel and
Tiger to provide additional choice to consumers, product and
marketing research, and product development. Price strategy: the
company had taken the following into consideration: cost,
competitor, market, economic situation and tax. Promotion strategy:
the company conducted sales promotion and advertising. Distribution
strategy: the company extended channels its channels of distribution
into food shops, pubs and various entertainment places. This strategy
benefited interested persons and people who were engaged in the beer
business.
Abstract: A key to success of high quality software development
is to define valid and feasible requirements specification. We have
proposed a method of model-driven requirements analysis using
Unified Modeling Language (UML). The main feature of our method
is to automatically generate a Web user interface mock-up from UML
requirements analysis model so that we can confirm validity of
input/output data for each page and page transition on the system by
directly operating the mock-up. This paper proposes a support method
to check the validity of a data life cycle by using a model checking tool
“UPPAAL" focusing on CRUD (Create, Read, Update and Delete).
Exhaustive checking improves the quality of requirements analysis
model which are validated by the customers through automatically
generated mock-up. The effectiveness of our method is discussed by a
case study of requirements modeling of two small projects which are a
library management system and a supportive sales system for text
books in a university.
Abstract: Biodiesel production with used frying by
transesterification reaction with methanol, using a commercial
kaolinite thermally-activated solid acid catalyst was investigated.
The surface area, the average pore diameter and pore volume of the
kaolinite catalyst were 10 m2/g, 13.0 nm and 30 mm3/g, respectively.
The optimal conditions for the transesterification reaction were
determined to be oil/methanol, in a molar ratio 1:31, temperature 160
ºC and catalyst concentration of 3% (w/w). The yield of fatty acids
methyl esters (FAME) was 92.4% after 2 h of reaction. This method
of preparation of biodiesel can be a positive alternative for utilizing
used frying corn oil for feedstock of biodiesel combined with the
inexpensive catalyst.
Abstract: The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.
Abstract: An application framework provides a reusable design
and implementation for a family of software systems. Frameworks
are introduced to reduce the cost of a product line (i.e., a family of
products that shares the common features). Software testing is a timeconsuming
and costly ongoing activity during the application
software development process. Generating reusable test cases for the
framework applications during the framework development stage,
and providing and using the test cases to test part of the framework
application whenever the framework is used reduces the application
development time and cost considerably. This paper introduces the
Framework Interface State Transition Tester (FIST2), a tool for
automated unit testing of Java framework applications. During the
framework development stage, given the formal descriptions of the
framework hooks, the specifications of the methods of the
framework-s extensible classes, and the illegal behavior description
of the Framework Interface Classes (FICs), FIST2 generates unitlevel
test cases for the classes. At the framework application
development stage, given the customized method specifications of
the implemented FICs, FIST2 automates the use, execution, and
evaluation of the already generated test cases to test the implemented
FICs. The paper illustrates the use of the FIST2 tool for testing
several applications that use the SalesPoint framework.
Abstract: Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.
Abstract: By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.
Abstract: The multiple traveling salesman problem (mTSP) can be used to model many practical problems. The mTSP is more complicated than the traveling salesman problem (TSP) because it requires determining which cities to assign to each salesman, as well as the optimal ordering of the cities within each salesman's tour. Previous studies proposed that Genetic Algorithm (GA), Integer Programming (IP) and several neural network (NN) approaches could be used to solve mTSP. This paper compared the results for mTSP, solved with Genetic Algorithm (GA) and Nearest Neighbor Algorithm (NNA). The number of cities is clustered into a few groups using k-means clustering technique. The number of groups depends on the number of salesman. Then, each group is solved with NNA and GA as an independent TSP. It is found that k-means clustering and NNA are superior to GA in terms of performance (evaluated by fitness function) and computing time.
Abstract: Ants are fascinating creatures that demonstrate the
ability to find food and bring it back to their nest. Their ability as a
colony, to find paths to food sources has inspired the development of
algorithms known as Ant Colony Systems (ACS). The principle of
cooperation forms the backbone of such algorithms, commonly used
to find solutions to problems such as the Traveling Salesman
Problem (TSP). Ants communicate to each other through chemical
substances called pheromones. Modeling individual ants- ability to
manipulate this substance can help an ACS find the best solution.
This paper introduces a Dynamic Ant Colony System with threelevel
updates (DACS3) that enhance an existing ACS. Experiments
were conducted to observe single ant behavior in a colony of
Malaysian House Red Ants. Such behavior was incorporated into the
DACS3 algorithm. We benchmark the performance of DACS3 versus
DACS on TSP instances ranging from 14 to 100 cities. The result
shows that the DACS3 algorithm can achieve shorter distance in
most cases and also performs considerably faster than DACS.
Abstract: E-tailing websites are often perceived to be static, impersonal and distant. However, with the movement of the World Wide Web to Web 2.0 in recent years, these online websites have been found to display personalities akin to 'humanistic' qualities and project impressions much like its retailing counterpart i.e. salespeople. This paper examines the personality of e-tailing websites and their impact on consumers- initial trust towards the sites. A total of 239 Internet users participated in this field experiment study which utilized 6 online book retailers- websites that the participants had not previously visited before. Analysis revealed that out of four website personalities (sincerity, competence, excitement and sophistication) only sincerity and competence are able to exert an influence in building consumers- trust upon their first visit to the website. The implications of the findings are further elaborated in this paper.