基于双层模糊聚类的多车场车辆路径遗传算法

对大规模多车场车辆路径问题,设计了基于双层模糊聚类的改进遗传算法求解框架,上层静态区域划分利用k-means技术将多车场到多客户的问题转化为一对多的子问题,下层模糊聚类从保证客户满意度和整合物流资源的角度出发,利用模糊聚类算法根据客户需求属性形成基于客户订单配送的动态客户群。进一步,通过改进选择算子和交叉算子来设计车辆路径优化的遗传算法。通过随机算例仿真实验,证明了提出方法和求解策略的有效性。     

Wheel hub customization with an interactive artificial immune algorithm

With the transformation from traditional manufacturing to intelligent manufacturing, customer-oriented personalized customization has gradually become the main mode of production. Interactive algorithms determine the pros and cons of the solution via customers which can make customers better participants in the customization process. However, if the population size is expanded and the number of evolutionary iterations is too high, frequent interactions are likely to cause customer fatigue. This paper proposes an adaptive interactive artificial immune algorithm based on improved hierarchical clustering. This algorithm uses the improved hierarchical clustering algorithm to optimize generation of the initial antibodies and applies the affinity calculation method based on customer intention, adaptive crossover and mutation operators, and a multisolution reservation method based on hybrid selection strategy to the artificial immune algorithm. Via empirical research on the customized operational data of wheel hubs, the proposed method effectively solves the problem of customer fatigue, significantly improves the convergence speed of the algorithm and reduces the time cost.

     

考虑客户聚类与产品回收的两级闭环物流网络选址-路径优化

针对目前不合理的废旧产品回收以及物流活动产生的碳排放污染，提出了一种考虑客户聚类与产品回收的两级闭环物流网络选址-路径优化模型。首先，结合实际物流网络的动态性假设客户需求量和回收率的不确定性特征，以最小运营成本和最小环境影响为目标建立选址-路径优化模型；其次，对多目标进化算法进行改进，提出了考虑客户聚类结果的两级物流设施选址-路径问题求解算法；最后，对该优化算法进行算法性能分析，并以重庆市某企业为例进行了模型和算法验证。结果表明，所建立的模型和算法能有效降低决策难度并提高物流系统的运作效率，所求出的优化方案能减少物流运作成本和降低物流运输过程对环境的影响。     

基于混合数据聚类算法的异质顾客群体识别

顾客作为产品满意度测度过程中评价决策的主体,对其进行分类研究,识别不同顾客群体异质评价特征具有重要意义。顾客评价特征存在多元性和冲突性,根本原因是顾客作为决策者的异质性,而顾客的异质性来源于顾客本身属性,包含分类型属性和数值型属性。提出了一种基于惩罚竞争机制的混合属性顾客分类方法,根据数值型和分类型属性值的分布规律,给出了混合数据初始聚类中心的确定方法;建立了统一相似性度量模型,并引入惩罚竞争机制,实现了聚类过程中的基本迭代和自动优化聚类数。以某产品异质顾客分类问题为例验证了所提方法的可行性,继而通过“Heart Disease”标准数据集将所提算法与K-means和K-prototypes两种经典聚类算法进行对比,验证了该方法的有效性。     

A genetic-fuzzy mining approach for items with multiple minimum supports

Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Mining association rules from transaction data is most commonly seen among the mining techniques. Most of the previous mining approaches set a single minimum support threshold for all the items and identify the relationships among transactions using binary values. In the past, we proposed a genetic-fuzzy data-mining algorithm for extracting both association rules and membership functions from quantitative transactions under a single minimum support. In real applications, different items may have different criteria to judge their importance. In this paper, we thus propose an algorithm which combines clustering, fuzzy and genetic concepts for extracting reasonable multiple minimum support values, membership functions and fuzzy association rules from quantitative transactions. It first uses the k-means clustering approach to gather similar items into groups. All items in the same cluster are considered to have similar characteristics and are assigned similar values for initializing a better population. Each chromosome is then evaluated by the criteria of requirement satisfaction and suitability of membership functions to estimate its fitness value. Experimental results also show the effectiveness and the efficiency of the proposed approach.     

基于时空聚类求解带容积约束的选址-路径问题

选址-路径问题是供应链管理和物流系统规划中的一个重要问题,对总成本具有十分重要的影响.对考虑配送中心容积约束的带时间窗的选址-路径问题进行研究,建立以总成本最小和客户满意度最大为目标的多目标规划模型,提出两阶段算法对其进行求解.首先,利用k-means聚类算法确定配送中心选址;然后,提出一种基于时间-空间双因素的客户划分方法以确定配送中心所服务客户;最后,利用粒子群算法对各配送中心的配送路径进行规划.数值算例表明,所提出的算法较其他已有算法,均能有效地降低物流运作总成本及总配送路径长度,为解决带容积约束及时间窗的选址-路径问题提供了一种新的解决思路.     

改进MOPSO在物流节点选址模型中的应用

为了降低物流系统的运营成本,提高物流系统的运作效率,构建了物流系统运营成本最小以及顾客时间满意度最大的多目标物流节点选址模型,并在模型求解过程中针对多目标粒子群算法的不足,从外部存档的更新、粒子学习样本的选择以及粒子的变异三个方面进行改进,将改进的多目标粒子群算法用于物流节点选址模型的求解。仿真结果表明,改进的算法相较于其他优化算法,具有较好的分布性和收敛性。     

A methodology to map customer complaints and measure customer satisfaction and loyalty

In this study, an analysis was conducted for the relationships between the main components of customer relationship management (CRM) and customer complaints in the domain of logistics and transport. Today, complaints and the handling of complaints play a pivotal role in customer relationships. Moreover, companies are reluctant to admit that they have difficulties with customers’ complaints, but as yet there appears to be no complete solution to this issue. To remedy this situation, customer complaints must be comprehensively collected and analysed. Issues must be classified, and timely solutions must be developed. In this paper, a conceptual framework is proposed including mathematical models, hypothesised relationships, perceived value and interactivity between customer, business and the system, as well as customer satisfaction analytics. The framework will address the relationship between customer satisfaction issues, loyalty and customer acquisition and estimate customer satisfaction and loyalty. For the purpose of analysis, this study uses both qualitative and quantitative approaches. For data collection, a survey questionnaire was distributed to 60 Fremantle Port logistics and transport customers. For the quantitative approach, linear and nonlinear modelling is adopted. Using the model, we are able to address the shortcomings of CRM technology, and tackle the issues of loyalty improvement and customer acquisition. Finally, based on nonlinear modelling and using a fuzzy inference system, namely the Takagi–Sugeno-type approach, we defined fuzzy rules, by means of which we ascertain the relationship between customer satisfaction and the main relevant variables.     

Modeling customer satisfaction for new product development using a PSO-based ANFIS approach

When developing new products, it is important to understand customer perception towards consumer products. It is because the success of new products is heavily dependent on the associated customer satisfaction level. If customers are satisfied with a new product, the chance of the product being successful in marketplaces would be higher. Various approaches have been attempted to model the relationship between customer satisfaction and design attributes of products. In this paper, a particle swarm optimization (PSO) based ANFIS approach to modeling customer satisfaction is proposed for improving the modeling accuracy. In the approach, PSO is employed to determine the parameters of an ANFIS from which better customer satisfaction models in terms of modeling accuracy can be generated. A notebook computer design is used as an example to illustrate the approach. To evaluate the effectiveness of the proposed approach, modeling results based on the proposed approach are compared with those based on the fuzzy regression (FR), ANFIS and genetic algorithm (GA)-based ANFIS approaches. The comparisons indicate that the proposed approach can effectively generate customer satisfaction models and that their modeling results outperform those based on the other three methods in terms of mean absolute errors and variance of errors.     

Determining optimal levels of engineering characteristics in quality function deployment under multi-segment market

Customers often have various requirements and preferences on a product. A product market can be partitioned into several market segments, each of which contains a number of customers with homogeneous preferences. In this paper, a methodology which mainly involves a market survey, fuzzy clustering, quality function deployment (QFD) and fuzzy optimization, is proposed to achieve the optimal target settings of engineering characteristics (ECs) of a new product under a multi-segment market. An integrated optimization model for partitioned market segments based on QFD technology is established to maximize the overall customer satisfaction (OCS) for the market considering the weights of importance of different segments. The weights of importance of market segments and development costs in the model are expressed as triangular fuzzy numbers in order to describe the imprecision caused by human subjective judgement. The solving approach for the fuzzy optimization model is provided. Finally, a case study is provided for illustrating the proposed methodology.     

基于配送收益均衡的多目标绿色车辆路径优化算法

针对电商平台物流中的碳排放成本较大以及配送过程中配送员收益不均衡的情况,为满足平台减少物流成本和人力成本的需求,提高车辆配送效率,降低碳排放量,实现低碳绿色出行,研究带有时间窗、配送收益均衡的多目标绿色车辆路径规划问题,并设计混合智能求解算法.首先,建立基于行驶速度的燃油消耗、基于模糊客户满意度的惩罚成本和配送收益均衡函数,构建以最小化燃油消耗量、惩罚成本和配送收益方差为目标的多目标绿色车辆路径模型;然后,将变邻域搜索算子融入NSGA-II算法,设计求解上述模型的多目标进化优化算法,以提高算法的寻优性能;最后,选择Solomon中的18个测试数据集进行实验,通过与2个模型和3种算法的超体积值和knee点值进行对比,验证所提出模型的可行性和算法的有效性,为降低碳排放量、实现低碳绿色出行提供新方案.     

Fuzzy cost-profit tradeoff model for locating a vehicle inspection station considering regional constraints

Facility location allocation （FLA） is one of the important issues in the logistics and transportation fields. In practice, since customer demands, allocations, and even locations of customers and facilities are usually changing, the FLA problem features uncertainty. To account for this uncertainty, some researchers have addressed the fuzzy profit and cost issues of FLA. However, a decision-maker needs to reach a specific profit, minimizing the cost to target customers. To handle this issue it is essential to propose an effective fuzzy cost-profit tradeoff approach of FLA. Moreover, some regional constraints can greatly influence FLA. By taking a vehicle inspection station as a typical automotive service enterprise example, and combined with the credibility measure of fuzzy set theory, this work presents new fuzzy cost-profit tradeoff FLA models with regional constraints. A hybrid algorithm integrating fuzzy simulation and genetic algorithms （GA） is proposed to solve the proposed models. Some numerical examples are given to illustrate the proposed models and the effectiveness of the proposed algorithm.     

预售策略下的快速时尚品物流分销网络双层规划模型

为解决预售策略下的快速时尚品物流分销网络的选址与分配问题,将最小化网络运作成本作为决策目标,构建了反映网络销售商与顾客决策行为的双层规划模型。模型充分考虑了决策双方的共同利益,并利用交互式模糊算法来确定中央仓库和第三方物流企业的选择、分配及服务方案。通过实例分析,既验证了算法的可行性,同时也表明了中央仓库的选址应尽量靠近需求点密集的区域,网络销售商应提供少量第三方物流服务企业供顾客选择。     

Web页面和客户群体的模糊聚类算法

web日志挖掘在电子商务和个性化web等方面有着广泛的应用.文章介绍了一种web页面和客户群体的模糊聚类算法.在该算法中,首先根据客户对Web站点的浏览情况分别建立Web页面和客户的模糊集,在此基础上根据Max—Min模糊相似性度量规则构造相应的模糊相似矩阵,然后根据模糊相似矩阵直接进行聚类.实验结果表明该算法是有效的.     

基于密度峰值的加权犹豫模糊聚类算法

由于人们对事物认知的局限性和信息的不确定性,在对决策问题进行聚类分析时,传统的模糊聚类不能有效解决实际场景中的决策问题,因此有学者提出了有关犹豫模糊集的聚类算法.现有的层次犹豫模糊K均值聚类算法没有利用数据集本身的信息来确定距离函数的权值,且簇中心的计算复杂度和空间复杂度都是指数级的,不适用于大数据环境.针对上述问题,...     

A new fuzzy relational clustering algorithm based on the fuzzy C-means algorithm

In this paper, we show how one can take advantage of the stability and effectiveness of object data clustering algorithms when the data to be clustered are available in the form of mutual numerical relationships between pairs of objects. More precisely, we propose a new fuzzy relational algorithm, based on the popular fuzzy C-means (FCM) algorithm, which does not require any particular restriction on the relation matrix. We describe the application of the algorithm to four real and four synthetic data sets, and show that our algorithm performs better than well-known fuzzy relational clustering algorithms on all these sets.     

基于偏好的客户模糊聚类方法

在电子商务环境下,如何按照顾客的购买兴趣进行聚类分析并为其提供个性化服务,是电子商务应用中研究的热点课题之一时.顾客的浏览行为及兴趣进行了研究,提出了利用偏好度的方法来度量顾客的兴趣度,在此基础上给出了基于偏好的客户群聚类算法.在该算法中,依据Web日志数据计算顾客偏好度,建立偏好度矩阵,再利用模糊聚类方法对顾客进行聚类.并用实例说明了具体的聚类过程.     

一种协同的FCPM模糊聚类算法

比重隶属度模糊聚类(FCPM)算法可从不同角度解决聚类问题,取得较好效果。协同聚类算法利用不同特征子集之间的协同关系,并与其它聚类算法相结合,可提高原有的聚类性能。文中在FCPM聚类算法的基础上进行改进,将其与协同聚类算法相结合,提出一种协同的FCPM聚类算法。该算法在原有FCPM聚类算法的基础上,提高对数据集的聚类效果。在对数据集Wine和Iris进行测试的结果表明,该方法优于FCPM算法,说明该方法的有效性。     

物流服务供应商选择的双层规划模型及云遗传算法*

在物流服务供应链体系下,针对功能型物流服务供应商的选择问题,提出了使用双层规划模型分析方法。上层规划以集成物流服务供应商的外包业务成本最低为目标,下层规划以客户服务满意度最大为目标。其中,在下层规划中提出客户服务满意度指数模型,并借助熵权法对模型中的各外显指标进行赋权,进而得出客户服务满意度指数。最后,结合模型特点设计了云自适应遗传算法,并借助算例验证了模型和算法的有效性。     

模糊时间窗VRP的动态规划和禁忌搜索混合算法

为优化具有模糊时间窗的车辆路径问题,以物流配送成本和顾客平均满意度为目标,建立了多目标数学规划模型。基于Pareto占优的理论给出了求解多目标优化问题的并行多目标禁忌搜索算法,算法中嵌入同时优化顾客满意度的动态规划方法,运用阶段划分,把原问题分解为关于紧路径的优化子问题。对模糊时间窗为线性分段函数形式和非线性凹函数形式的隶属度函数,分别提出了次梯度有限迭代算法和次梯度中值迭代算法来优化顾客的最优开始服务时间。通过Solomon的标准算例,与次梯度投影算法的比较验证了动态规划方法优化服务水平的有效性,与主流的NSGA-II算法的对比实验表明了该研究提出的多目标禁忌搜索算法的优越性。