International Journal of Computational Intelligence Systems

Volume 9, Issue 6, December 2016

1. An Effective Hybrid Differential Evolution Algorithm Incorporating Simulated Annealing for Joint Replenishment and Delivery Problem with Trade Credit

Yu-rong Zeng, Lu Peng, Jinlong Zhang, Lin Wang
Pages: 1001 - 1015
In practice, suppliers often provide retailers with forward financing to increase demand or decrease inventory. This paper proposes a new and practical joint replenishment and delivery (JRD) model by considering trade credit. However, because of the complex mathematical properties of JRD, high-quality...

2. Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem

J.d. Quintana, J. Sánchez-oro, A. Duarte
Pages: 1016 - 1027
Over the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every simple action that we can think about involves the connection among two or more devices. It is desirable to have a high quality connection among devices, by using electronic or optical...

3. Revenue Sharing Contract in a Multi-Echelon Supply Chain with Fuzzy Demand and Asymmetric Information

Shengju Sang
Pages: 1028 - 1040
In this paper, we consider the revenue sharing contract between supply chain actors in a multi-echelon supply chain, where the demand of the customers and retail price are fuzzy variables. The centralized decision making system and a coordinating contract, namely, the revenue sharing contract with fuzzy...

4. Manifold Regularized Proximal Support Vector Machine via Generalized Eigenvalue

Jun Liang, Fei-yun Zhang, Xiao-xia Xiong, Xiao-bo Chen, Long Chen, Guo-hui Lan
Pages: 1041 - 1054
Proximal support vector machine via generalized eigenvalue (GEPSVM) is a recently proposed binary classification technique which aims to seek two nonparallel planes so that each one is closest to one of the two datasets while furthest away from the other. In this paper, we proposed a novel method called...

5. Proactive Control for Oversaturation Mitigation on Evacuation Network: a Multi-Agent Simulation Approach

Zhengfeng Huang, Pengjun Zheng, Yanqiang Ma, Guiyan Jiang, Gang Ren
Pages: 1055 - 1067
Using a multi-agent simulation approach composing of evacuee, cell, and signal, this study aims to proactively curb the oversaturation spread in evacuation and improve the evacuation efficiency. The specific innovation lies in the en-route path choice model and oversaturation control model. A logit model...

6. Layout of Urban Distribution Center Using Possibilistic Programming

Nurgul Demirtas, Umut R. Tuzkaya, Mehmet Tanyaåÿ
Pages: 1068 - 1081
Distribution centers, link supply chain to the customers. Layout of the distribution centers is very important in terms of product conservation at the required service level and delivering of products with minimum cost to the customer from distribution centers. Therefore, the layout design of distribution...

7. Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration

Jianyou Xu, Win-chin Lin, Junjie Wu, Shuenn-ren Cheng, Zi-ling Wang, Chin-chia Wu
Pages: 1082 - 1100
Recently, both the learning effect scheduling and re-entrant scheduling have received more attention separately in research community. However, the learning effect concept has not been introduced into re-entrant scheduling in the environment setting. To fill this research gap, we investigate re-entrant...

8. Recommending degree studies according to students’ attitudes in high school by means of subgroup discovery

Amin Y. Noaman, José María Luna, Abdul H. M. Ragab, Sebastián Ventura
Pages: 1101 - 1117
The transition from high school to university is a critical step and many students head toward failure just because their final degree option was not the right choice. Both students’ preferences and skills play an important role in choosing the degree that best fits them, so an analysis of...

9. Novel Approach to Tourism Analysis with Multiple Outcome Capability Using Rough Set Theory

Chun-che Huang, Tzu-liang (Bill) Tseng, Kun-cheng Chen
Pages: 1118 - 1132
To explore the relationship between characteristics and decision-making outcomes of the tourist is critical to keep competitive tourism business. In investigation of tourism development, most of the existing studies lack of a systematic approach to analyze qualitative data. Although the traditional Rough...

10. Modularity, Lead time and Return Policy for Supply Chain in Mass Customization System

Jizi Li, Chunling Liu, Weichun Xiao
Pages: 1133 - 1153
Mass Customization (MC) is a flexible manufacturing system with features of Mass Production (MP) and Customization Production (CP). However, there is few researches about competition & cooperation between the upstream MP firm (module manufacturer) and downstream CP firm (assembler) under MC supply...

11. An efficient computational approach for solving type-2 intuitionistic fuzzy numbers based Transportation Problems

Ali Ebrahimnejad, Jose Luis Verdegay
Pages: 1154 - 1173
This paper is concerned with the solution procedure of a Transportation Problem in which costs are triangular intuitionistic fuzzy numbers (TIFN) and availabilities and demands are taken as exact numerical values. According to the existing solution approach, TIFN are first ordered by using an accuracy...

12. A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems

Yanhong Feng, Gai-ge Wang, Xiao-zhi Gao
Pages: 1174 - 1190
Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0–1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis...

13. An Evaluation of the Dynamics of Diluted Neural Network

Lijuan Wang, Jun Shen, Qingguo Zhou, Zhihao Shang, Huaming Chen, Hong Zhao
Pages: 1191 - 1199
The Monte Carlo adaptation rule has been proposed to design asymmetric neural network. By adjusting the degree of the symmetry of the networks designed by this rule, the spurious memories or unwanted attractors of the networks can be suppressed completely. We have extended this rule to design full-connected...