基于“员工技能库”的多技能员工动态指派

针对在复杂市场需求环境的新订单到达情况,具有不同技能数量和技能水平的多技能员工为完成新订单的指派问题,提出基于"员工技能库"的、满足交货期的多技能员工动态指派方案,给出了与实际情况相吻合的约束条件,建立相应的0-1整数规划模型.并设计了采用优先规则的启发式算法,在每次迭代中优先选择与订单最低需求基本匹配的员工加以指派任务,直至所有任务都完成指派,通过算例测试表明,基于"员工技能库"的动态指派方案能快速准确地进行员工指派.     

多车型车辆调度问题的优化模型

基于第十一届"华为杯"全国研究生数学建模竞赛E题第五问,针对一类多车型多目的地的整车物流运输调度问题,先直接计算完成总任务所需的车辆数来阐明该题的最优解的下界限为113辆,再对原始数据进行预处理,基于对乘用车的分类与排样算法,筛选出每种轿运车的M种装载方案代表,再对目的地位置及结合各目的地的任务需求,确定出3条不绕行路线,根据启发式调整优化算法,并以轿运车使用量最少及总行驶里程最短为优化目标,建立了多目标整数规划模型进行求解,最优可行解为114辆,其中1-1型91辆,1-2型18辆,2-2型5辆.     

Three steps multiobjective decision process for software release planning

This paper deals with how to determine which features should be included in the software to be developed. Metaheuristic techniques have been applied to this problem and can help software developers when they face contradictory goals. We show how the knowledge and experience of human experts can be enriched by these techniques, with the idea of obtaining a better requirements selection than that produced by expert judgment alone. This objective is achieved by embedding metaheuristics techniques into a requirements management tool that takes advantage of them during the execution of the development stages of any software development project. © 2015 Wiley Periodicals, Inc. Complexity 21: 250–262, 2016     

相对差商算法性能的统计研究

本文通过服从一致分布随机算例的均匀抽样方式，对离散变量优化问题的相对差商算法进行了数值实验，按启发式算法的性能评价指标对数值实验结果进行了统计分析，为评价相对差商算法的实际性能提供了统计依据     

A sweep-based algorithm for the fleet size and mix vehicle routing problem

This paper presents a new sweep-based heuristic for the fleet size and mix vehicle routing problem. This problem involves two kinds of decisions: the selection of a mix of vehicles among the available vehicle types and the routing of the selected fleet. The proposed algorithm first generates a large number of routes that are serviced by one or two vehicles. The selection of routes and vehicles to be used is then made by solving to optimality, in polynomial time, a set-partitioning problem having a special structure. Results on a set of benchmark test problems show that the proposed heuristic produces excellent solutions in short computing times. Having a fast but good solution method is needed for transportation companies that rent a significant part of their fleet and consequently can take advantage of frequent changes in fleet composition. Finally, the proposed heuristic produced new best-known solutions for three of the test problems; these solutions are reported.     

Heuristic chemistry--addition reactions

Organic chemistry is often considered a difficult subject requiring great effort to achieve expert status. Only once this level has been reached, judging, deciding, and recalling chemical information will be fast and guided by heuristic strategies. These principles, used intuitively, improve the efficiency and speed of problem-solving and decision-making procedures. Establishing these strategies in teaching and learning chemistry should significantly help students acquire well-structured procedural knowledge early in their education. In an attempt to improve conceptual thinking in teaching organic chemistry, in this contribution we develop a heuristic view of addition reactions and propose a new way of perceiving this class of organic reactions.     

An exact algorithm for the Capacitated Total Quantity Discount Problem

In this paper we analyze the procurement problem of a company that needs to purchase a number of products from a set of suppliers to satisfy demand. The suppliers offer total quantity discounts and the company aims at selecting a set of suppliers so to satisfy product demand at minimum purchasing cost. The problem, known as Total Quantity Discount Problem (TQDP), is strongly NP-hard. We study different families of valid inequalities and provide a branch-and-cut approach to solve the capacitated variant of the problem (Capacitated TQDP) where the quantity available for a product from a supplier is limited. A hybrid algorithm, called HELP (Heuristic Enhancement from LP), is used to provide an initial feasible solution to the exact approach. HELP exploits information provided by the continuous relaxation problem to construct neighborhoods optimally searched through the solution of mixed integer subproblems. A streamlined version of the proposed exact method can optimally solve in a reasonable amount of time instances with up to 100 suppliers and 500 products, and largely outperforms an existing approach available in the literature and CPLEX 12.2 that frequently runs out of memory before completing the search.     

一种高压开关产品的装配过程优化问题研究

本文针对高压开关产品的装配线提出一个实际的装配过程优化问题:高压开关产品的装配过程优化问题。该问题是在传统的空间布局问题中,加入了装配线工艺流程约束,是一类新的优化问题。本文为该问题建立了整数规划模型,并为该模型开发了启发式算法。然后以ZF11-252产品的装配过程为例,采用启发式算法求解模型。     

如何成为一个合格的助课教师

每个学校的青年教师在登上三尺讲台前大都要经过助课阶段,经过了这个阶段,他们将知道如何完成教学任务．本文对助课工作的目标做些探讨,实现了助课目标也就成为了一个合格的助课教师．     

B2C电子商务仓库拣货路径优化策略应用研究

当前国内B2C电子商务仓库多为人至物的拣货模式,拣货作业成为其核心作业之一,占据仓库大量时间成本和资金成本,拣货路径优化成为企业亟需解决的问题。本文基于TSP对拣货路径进行建模,利用蚁群算法、模拟退火算法和禁忌搜索对该NP-hard问题进行求解,并同当前企业普遍采用的S型启发式策略进行对比,拣货时间节约13.35%。进一步得出当拣货品数量较少时应采用模拟退火算法求解,而当拣货品数量较大时采用蚁群算法仅进行一次迭代,则可以实现短时间得到相对较优的解。所得结果已应用于某大型电子商务企业,效果明显。