Hybrid particle swarm optimization with mutation for optimizing industrial product lines: An application to a mixed solution space considering both discrete and continuous design variables

This article presents an artificial intelligence-based solution to the problem of product line optimization. More specifically, we apply a new hybrid particle swarm optimization (PSO) approach to design an optimal industrial product line. PSO is a biologically-inspired optimization framework derived from natural intelligence that exploits simple analogues of collective behavior found in nature, such as bird flocking and fish schooling. All existing product line optimization algorithms in the literature have been so far applied to consumer markets and product attributes that range across some discrete values. Our hybrid PSO algorithm searches for an optimal product line in a large design space which consists of both discrete and continuous design variables. The incorporation of a mutation operator to the standard PSO algorithm significantly improves its performance and enables our mechanism to outperform the state of the art Genetic Algorithm in a simulated study with artificial datasets pertaining to industrial cranes. The proposed approach deals with the problem of handling variables that can take any value from a continuous range and utilizes design variables associated with both product attributes and value-added services. The application of the proposed artificial intelligence framework yields important implications for strategic customer relationship and production management in business-to-business markets.     

A Further Discussion of Optimal Comparable Selection and Weighting, and a Response to Green

Using a revised model framework that views expected adjusted prices of corn-parables as random variables, Green (1994) demonstrates that Vandell's (1992) minimum variance estimator is preferred under the classical ordinary least squares (OLS) assumptions. As a result, the minimum coefficient of variation estimator proposed by Gau, et al. (1993) is preferred only when the classical OLS assumptions are relaxed. We demonstrate that, even under Green's revised framework, there is not sufficient evidence in the paper to justify this claim.     

An inventory model with deteriorating items under inflation when a delay in payment is permissible

This study develops an inventory model for initial-stock-dependent consumption rate when a delay in payment is permissible. In the inventory model, shortages are not allowed. The effect of the inflation rate, deterioration rate, initial-stock-dependent consumption rate and delay in payment are discussed. In the study, mathematical models are also derived under two different circumstances, i.e., Case I: The credit period is less than or equal to the cycle time for settling the account; and Case II: The credit period is greater than the cycle time for settling the account. Besides, expressions for an inventory system's total cost are derived for these two cases. Moreover, a computational procedure and GINO (Lasdon et al., ACM Transactions Mathematical Software 4 (1978) 34–50) are proposed to obtain the optimal order size and cycle time. The results can help managers determine the optimal total cost. Finally, a numerical example demonstrates the applicability of the proposed model.     

基于CPSO的基础设施模糊投资组合优化模型

针对基础设施效益模糊、难以度量的特点,结合模糊集理论,建立了模糊投资组合优化模型,改进粒子群算法,加入混沌思想,使用混沌粒子群算法(CPSO)求解基础设施的模糊投资组合优化模型。以4个城市投资公司的数据为样本,验证该方法的科学性与有效性。研究结果表明:模糊投资组合优化模型可较好地表征基础设施的模糊效益,提高基础设施投资决策的科学性;混沌寻优思想改进的粒子群算法可求得模糊投资组合优化模型的全局最优解,增强算法的鲁棒性。     

A binary solution method for the multi-product newsboy problem with budget constraint

Multi-product newsboy problem (MPNP) with budget constraint is a classical inventory control/management problem. However, solution methods for MPNP under general demand distributions are limited in the current literature. In this paper, by analyzing properties of the optimal solution to the MPNP with a budget constraint, we develop a solution algorithm for the constrained MPNP. The proposed algorithm is binary in nature, and is applicable to general types of demand distribution functions, discrete as well as continuous. For continuous demand distribution function, our approach can obtain the optimal or near optimal solution to the constrained MPNP with polynomial computation complexity of the o(n) order. On the other hand, for discrete demand distribution functions, it can effectively provide good approximate solution. Numerical experiments are presented to show the performance of our method.     

A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times,sequence-dependent setup times and learning effect

This paper addresses multi-objective (MO) optimization of a single-model assembly line balancing problem (ALBP) where the operation times of tasks are unknown variables and the only known information is the lower and upper bounds for operation time of each task. Three objectives are simultaneously considered as follows: (1) minimizing the cycle time, (2) minimizing the total equipment cost, and (3) minimizing the smoothness index. In order to reflect the real industrial settings adequately, it is assumed that the task time is dependent on worker(s) (or machine(s)) learning for the same or similar activity and sequence-dependent setup time exists between tasks. Finding an optimal solution for this complicated problem especially for large-sized problems in reasonable computational time is cumbersome. Therefore, we propose a new solution method based on the combination of particle swarm optimization (PSO) algorithm with variable neighborhood search (VNS) to solve the problem. The performance of the proposed hybrid algorithm is examined over several test problems in terms of solution quality and running time. Comparison with an existing multi-objective evolutionary computation method in the literature shows the superior efficiency of our proposed PSO/VNS algorithm.     

A multiple ant colony optimization algorithm for the capacitated location routing problem

The success of a logistics system may depend on the decisions of the depot locations and vehicle routings. The location routing problem (LRP) simultaneously tackles both location and routing decisions to minimize the total system cost. In this paper a multiple ant colony optimization algorithm (MACO) is developed to solve the LRP with capacity constraints (CLRP) on depots and routes. We decompose the CLRP into facility location problem (FLP) and multiple depot vehicle routing problem (MDVRP), where the latter one is treated as a sub problem within the first problem. The MACO algorithm applies a hierarchical ant colony structure that is designed to optimize different subproblems: location selection, customer assignment, and vehicle routing problem, in which the last two are the decisions for the MDVRP. Cooperation between colonies is performed by exchanging information through pheromone updating between the location selection and customer assignment. The proposed algorithm is evaluated on four different sets of benchmark instances and compared with other algorithms from the literature. The computational results indicate that MACO is competitive with other well-known algorithms, being able to obtain numerous new best solutions.     

A framework of ERP systems implementation success in China: An empirical study

Enterprise resource planning (ERP) system is one of the most widely accepted choices to obtain competitive advantage for manufacturing companies. However, the successful implementation rate is low and many firms did not achieve intended goals in China. This study develops an ERP implementation success framework by adapting the Ives et al. information systems (ISs) research model and DeLone and McLean's IS success model to identify both critical success factors and success measures. Qualitative case study research methodology is used to collect data and Atlas/ti program is used to facilitate data analysis. Discussion is made finally and suggested ERP systems implementation methodology is given at the end.     

Fuzzy logic in manufacturing: A review of literature and a specialized application

Manufacturing decisions inherently face uncertainties and imprecision. Fuzzy logic, and tools based on fuzzy logic, allow for the inclusion of uncertainties and imperfect information in decision making models, making them well suited for manufacturing decisions. In this study, we first review the progression in the use of fuzzy tools in tackling different manufacturing issues during the past two decades. We then apply fuzzy linear programming to a less emphasized, but important issue in manufacturing, namely that of product mix prioritization. The proposed algorithm, based on linear programming with fuzzy constraints and integer variables, provides several advantages to existing algorithm as it carries increased ease in understanding, in use, and provides flexibility in its application.     

On the proportionality of EU spatial ex ante coexistence regulations: Reply

Desquilbet and Bullock (2010) criticize some aspects of our analysis of the European Union’s (EU) spatial ex ante coexistence regulations (SEACERs) of genetically modified (GM) and non-GM crops presented in Demont et al. (2009). We argue that, besides misinterpreting some of our original arguments, the authors propose a policy analysis framework which is inconsistent with the main goal of the EU’s SEACERs. Their example incorrectly suggests that SEACERs play an additional role of regulating non-GM crop supply on the market. This would be inefficient from a policy economics perspective, especially in an open economy where global trade is taken into account. Therefore, we argue that analyzing flexibility of SEACERs in a market framework could lead to erroneous conclusions and in that case a simple farm level analysis such as presented in Demont et al. (2009) is preferred.     

基于Isomap-MPA-LSSVM软测量模型的PVC聚合过程转化率预测

针对聚氯乙烯（PVC）聚合过程转化率难以实时获取,提出了一种基于Isomap-MPA-LSSVM软测量模型预测氯乙烯单体（VCM）转化率的方法。首先,为消除数据间共线性,采用等度量映射（Isomap）算法对原始数据特征进行提取,得到模型的输入变量。其次,用海洋捕食者算法（MPA）优化最小二乘支持向量机（LSSVM）的参数,并建立模型。最后,进行仿真实验。结果表明,软测量模型相较于MPA-LSSVM与LSSVM模型,预测的平均绝对误差分别降低了43.03%和59.92%,均方根误差分别降低了30.27%和52.24%,显著提升了VCM转化率的预测精度。所提模型能精确预测VCM转化率,对提高PVC的产品质量具有重要参考意义。     

Strategic Substitutes and Strategic Complements With Interdependent Demands

Strategic substitutes and complements have become standard tools of analysis in industrial organization. Bulow et al. (1985) original model which introduced these concepts focused on multimarket oligopoly. Building upon that model, this paper shows that there becomes not one but two strategic interaction terms if the demands between markets is interdependent and the firms compete in prices. This new model is applied to the telecommunications industry, where the local exchange carriers face competition from competitive access providers. The theoretical model shows the critical variables in the local exchange carriers' strategic pricing decision.     

Firm orientations, innovativeness, and business performance: Advancing a system dynamics view following a comment on Hult, Hurley, and Knight's 2004 study

Hult, Hurley, and Knight's [Ind. Mark. Manage. 33 (2004) 429.] study reports correlations for each of the three subfactors of market orientation (competitor orientation, customer orientation, and interfunctional coordination) and innovativenss. However, their report fails to discuss the nature of these relationships. Such findings are worthy of discussion because they support prior evidence demonstrating the centrality of customer orientation in linking competitor orientation and interfunctional coordination with both innovativeness and business performance. Also, the finding that interfunctional coordination relates strongly with innovativeness supports the paradigm shift toward relationship marketing. The point needs mentioning that several different (more than one) standardized effects, structural equation models explain similar amounts of variance of business performance besides the models that Hult et al. examine. Thus, the implication by Hult et al. (p. 436) that “…learning orientation has no significant direct effect on performance” is accurate only for the model tested (shown in their Fig. 2). Applying the “quick clustering” method helps to inform interpretation when nearly all relationships among variables are statistically significant. The present article includes a proposal for advancing from one-directional structural equation modeling of innovativeness and business performance to system dynamics modeling that includes real-world feedback loops.     

我国区域旅游业的经营效率测度及提升的实证研究

运用Fried et al．（2002）所提出的三阶段DEA分析方法,调整环境变量与随机干扰等因素的影响,对2008年我国31个省区旅游业的经营效率进行了实证分析。结果表明：排除了环境因素的影响以后,我国各地区旅游业的经营效率差距很大,而且普遍偏低;我国大部分地区的旅游业处于规模报酬递增状态,需要适度扩大规模来提升规模效率;各地区旅游业的纯技术效率都比较高,都在0．84以上。     

Metaheuristics for drilling operation scheduling in Taiwan PCB industries

Among all types of production environment, identical parallel machines are frequently used to increase the manufacturing capacity of the drilling operation in Taiwan printed circuit board (PCB) industries. Additionally, multiple but conflicting objectives are usually considered when a manager plans the production scheduling. Compared to the single objective problem, the multiple-objective version no longer looks for an individual optimal solution, but a Pareto front consisting of a set of non-dominated solutions will be needed and established. The manager then can select one of the alternatives from the set. This research aims at employing a variable neighborhood search (VNS) algorithm and a multiple ant colony optimization (MACO) algorithm to solve the identical parallel-machine scheduling problem with two conflicting objectives: makespan and total tardiness. In VNS, two neighborhoods are defined—insert a job to a different position or swap two jobs in the sequence. To save the computational expense, one of the neighborhoods is randomly selected for the target solution which is also arbitrarily chosen from the current Pareto front. In MACO, a two-phase construction procedure where three colonies are employed in each phase is proposed. These two algorithms are tested on a set of real data collected from a leading PCB factory in Taiwan and their performances are compared. The computational results show that VNS outperforms all competing algorithms—SPGA, MOGA, NSGA-II, SPEA-II, and MACO in terms of solution quality and computational time.     

Chord算法分析及其在视频会议系统中的应用

在对等网络结构中,快速准确地确定资源的位置是一个比较突出的问题,在视频会议系统中这种实时性显得尤为突出。基于DHT资源定位及查找算法是目前比较流行的算法之一,介绍了其中具有代表性的Chord算法的2种形式,对其进行了分析比较,并提出了一种简单的适用于P2P视频会议的Chord改进算法Direct-Chord。     

Performance of French intensive care units: A directional distance function approach at the patient level

By using a novel adaptation of the free-disposable hull analysis of productivity, we assess the medical and technical efficiency of patient care in 25 Parisian intensive care units (ICUs) during 2000. The robust free disposable hull (RFDH) as defined by [Cazals et al., 2002. Nonparametric frontier estimation: a robust approach. Journal of Econometrics 106, 1–25] reduces the impact outliers may have on findings by employing Monte-Carlo techniques and repeated sample selection. Among our key findings, there was no overall significant correlation between medical and technical efficiencies for all the ICUs, therefore performing well in one does not guarantee good performance in the other. We also found that over 80% of inefficiency is concentrated in less than 20% of the sampled patients.     

A model for electronic commerce success

This paper attempts to develop a framework for electronic commerce (e-commerce) success. Key factors impacting e-commerce are identified from a detailed literature review. These factors are then differentiated according to their contribution to the success of e-commerce and according to the locus of impact. The final model is then cast in a structural equation modeling framework comprising four exogenous variables (internal driver, internal impediment, external driver and external impediment) and one endogenous variable (e-commerce success) with 24 observed variables. Data are collected via a questionnaire-based survey from large Australian companies. The study results suggest that increased benefits (both internal and external) from the use of e-commerce significantly predict the perceived and/or expected success of e-commerce. However, lowering of impediments (internal and external) does not significantly affect the success of e-commerce.     

Scheduling a flow shop with combined buffer conditions

In this paper, four inter-machine buffer conditions (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) in a flow shop are investigated. These four different buffer conditions are combined to generate a more generalised and more comprehensive scheduling problem, which can cover the classical flow-shop scheduling (FSS) with unlimited buffer, the blocking FSS (BFSS) without buffer, the no-wait FSS (NWFSS) and the limited-buffer FSS (LBFSS) problems. By analysing the structural properties of these four buffer conditions, an innovative constructive algorithm called the Liu–Kozan algorithm is proposed to build the feasible combined-buffer flow-shop scheduling (CBFSS) solution. The proposed Liu–Kozan algorithm mainly comprises a time-determination procedure and a tune-up procedure with eight sets of formulae. Detailed numerical implementations have been analysed to indicate that the proposed Liu–Kozan algorithm is very generic because without modification it enables the construction of the feasible solutions for the FSS, BFSS, NWFSS, LBFSS and CBFSS problems. By employing the similar mechanism of the well-known NEH algorithm, a two-stage hybrid heuristic algorithm called the Liu–Kozan–BIH algorithm is developed to find a good CBFSS schedule in an efficient and economical way.