A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment

One of the most important problem in supply chain management is the design of distribution systems which can reduce the transportation costs and meet the customer's demand at the minimum time. In recent years, cross-docking (CD) centers have been considered as the place that reduces the transportation and inventory costs. Meanwhile, neglecting the optimum location of the centers and the optimum routing and scheduling of the vehicles mislead the optimization process to local optima. Accordingly, in this research, the integrated vehicle routing and scheduling problem in cross-docking systems is modeled. In this new model, the direct shipment from the manufacturers to the customers is also included. Besides, the vehicles are assigned to the cross-dock doors with lower cost. Next, to solve the model, a novel machine-learning-based heuristic method (MLBM) is developed, in which the customers, manufacturers and locations of the cross-docking centers are grouped through a bi-clustering approach. In fact, the MLBM is a filter based learning method that has three stages including customer clustering through a modified bi-clustering method, sub-problems’ modeling and solving the whole model. In addition, for solving the scheduling problem of vehicles in cross-docking system, this paper proposes exact solution as well as genetic algorithm (GA). GA is also adapted for large-scale problems in which exact methods are not efficient. Furthermore, the parameters of the proposed GA are tuned via the Taguchi method. Finally, for validating the proposed model, several benchmark problems from literature are selected and modified according to new introduced assumptions in the base models. Different statistical analysis methods are implemented to assess the performance of the proposed algorithms.     

Shop-floor scheduling at shipbuilding yards using the multiple intelligent agent system

The intelligent agent system has become a typical approach to research distributed artificial intelligence and distributed problem solving. However, despite its various technical advantages, the distribution and expansion of the intelligent agent system approach has been limited because existing methodologies rely on specialized applications and therefore require intensive investment to develop new systems. In an attempt to conquer these difficulties, a standardized methodology to construct intelligent agent systems is proposed. This approach deviates from current agent system approaches of repeatedly constructing new and customized expert systems. Specifically, it provides an economical method for developing intelligent agent systems by investigating the possibility of standardizing message communication protocols in linguistics speech-act theory and by supplementing traditional algorithmic systems with intelligent segments using, among others, expert system tools. To verify effectiveness, the shop-floor scheduling system of a large-scale shipbuilding yard has been redesigned, developed, and tested using this approach. This shop-floor scheduling system requires the scheduling of when and where to process block construction under various constraints. It is a difficult four-dimensional time and space allocation problem involving traditional NP-complete search spaces. The tested intelligent agent system proposes an innovative method for reducing the search space into three levels: the algorithm level, the agent intelligence level, and the level of cooperation among agents. It also provides methods for solving deadlock occurrence and non-uniformity problems resulting from parallel processing. Test results demonstrate applicability and economy, among other technical advantages.     

Knowledge-based expert systems in offshore structural design

With the world growing more complex, computers must help not only by doing ordinary computing but also by doing computing that exhibits intelligence. Efforts in the application of Artificial Intelligence (AI) to intelligent problem solving led to the development of expert systems. An expert system is a useful tool for solving ill defined problems that require a great deal of specialized knowledge that experts in a particular field acquire from long experiences with such tasks. The expert knowledge is contained in what is aptly called a knowledge base.

Offshore structural design is significantly influenced by expert human knowledge. Much of the knowledge is heuristic and attained through experience over the years. The objective of this paper is to highlight the possible use of expert systems in the area of offshore structures. A brief overview of knowledge systems followed by an application example is presented.     

A framework and computer system for knowledge-level acquisition,representation, and reasoning with process knowledge

The development of knowledge-based systems is usually approached through the combined skills of software and knowledge engineers (SEs and KEs, respectively) and of subject matter experts (SMEs). One of the most critical steps in this task aims at transferring knowledge from SMEs’ expertise to formal, machine-readable representations, which allow systems to reason with such knowledge. However, this process is costly and error prone. Alleviating such knowledge acquisition bottleneck requires enabling SMEs with the means to produce the target knowledge representations, minimizing the intervention of KEs. This is especially difficult in the case of complex knowledge types like processes. The analysis of scientific domains like Biology, Chemistry, and Physics uncovers: (i) that process knowledge is the single most frequent type of knowledge occurring in such domains and (ii) specific solutions need to be devised in order to allow SMEs to represent it in a computational form. We present a framework and computer system for the acquisition and representation of process knowledge in scientific domains by SMEs. We propose methods and techniques to enable SMEs to acquire process knowledge from the domains, to formally represent it, and to reason about it. We have developed an abstract process metamodel and a library of problem solving methods (PSMs), which support these tasks, respectively providing the terminology for SME-tailored process diagrams and an abstract formalization of the strategies needed for reasoning about processes. We have implemented this approach as part of the DarkMatter system and formally evaluated it in the context of the intermediate evaluation of Project Halo, an initiative aiming at the creation of question answering systems by SMEs.     

基于移动边缘计算的GI/GI/1排队建模与调度算法EI北大核心CSCD

针对车联网环境下路侧边缘计算节点部署不均衡、服务密度小、实时调度计算压力大等问题,提出一种基于智能车移动边缘计算(Mobile edge computing,MEC)的任务排队建模与调度算法,提供弹性计算服务,将具备感知、计算、控制功能的智能车作为移动边缘计算服务器,设计了车联网环境下的MEC体系架构.首先基于虚拟化技术对智能车进行虚拟化抽象,利用排队论对虚拟车任务构建了GI/GI/1排队模型.然后基于云平台Voronoi分配算法对虚拟车任务进行分配绑定,进而实现了智能车的优化调度与分布式弹性服务,解决了边缘计算任务分配不均衡等问题.最后通过城市交通路网中的车辆污染排放的实时计算实验,验证了该方法的有效性.     

Agent scheduling model for adaptive dynamic load balancing in agent-based distributed simulations

Agent-based distributed simulations are confronted with load imbalance problem, which significantly affects simulation performance. Dynamic load balancing can be effective in decreasing simulation execution time and improving simulation performance. The characteristics of multi-agent systems and time synchronization mechanisms make the traditional dynamic load balancing approaches not suitable for dynamic load balancing in agent-based distributed simulations. In this paper, an adaptive dynamic load balancing model in agent-based distributed simulations is proposed. Due to the complexity and huge time consuming for solving the model, a distributed approximate optimized scheduling algorithm with partial information (DAOSAPI) is proposed. It integrates the distributed mode, approximate optimization and agent set scheduling approach. Finally, experiments are conducted to verify the efficiency of the proposed algorithm and the simulation performance under dynamic agent scheduling. The experiments indicate that DAOSPI has the advantage of short execution time in large-scale agent scheduling, and the distributed simulation performance under this dynamic agent scheduling outperforms that under static random agent distribution.     

带约束的清洁排班问题模型及其求解

保洁服务公司的清洁任务往往具有不同级别、不同时长和不同周期等特点,缺乏通用清洁排班问题模型,现阶段主要依赖人工排班方案,存在耗时费力且排班质量不稳定等问题.因此提出了属于NP难问题的带约束的清洁排班问题的数学模型,并使用模拟退火算法(SA)、蜂群算法(BCO)、蚁群算法(ACO)和粒子群优化算法(PSO)对该模型进行求...     

能耗优化的流媒体传输任务调度研究

随着信息技术和网络技术的迅速发展,三网融合使得智能电视系统迅速发展,随着云计算技术的出现,基于云计算构架的流媒体平台成为智能电视主流发展方向。智能电视系统提供的视频点播业务迅猛增长,其相应的流媒体传输任务无论在性能上,还是能耗上都成为需要解决的问题。针对智能电视系统中视频点播业务的流媒体传输任务调度问题,提出了一种能耗优化的流媒体传输任务调度算法。该算法根据预测任务时间长度区分不同类型的任务并分别分配到各自类型的节点执行,将碎片化的任务集中调度,让尽可能少的服务器以较高负载状态执行任务从而达到整体能耗减少的目的。相关实验结果表明,该算法可以在不影响服务质量的前提下对能耗实现一定程度的优化。     

基于资源预测的网格任务调度模型

跨越虚拟组织中多个域(或集群)的网格任务调度由于资源的不确定性（如动态性和异构性）而成为网格应用中亟待解决的问题。提出了一种有效的基于资源预测的网格任务调度模型——RPTS,该模型利用加权最小二乘方法进行参数估计的自回归滑动平均(ARMA)预测方法对网格环境下的主机负载进行预测。利用上述资源预测结果和一类数据并行性网格任务的建模结果,对它们进行预处理、匹配并调度执行。RPTS充分考虑了网格环境下资源的动态性和异构性,为解决网格环境下任务调度问题提供了一种较好的方法。与其他一些网格任务调度方法进行了一系列的仿真实验,结果表明RPTS模型具有任务执行时间最短和稳定性较好的特点。     

Integrated knowledge-based system design and validation for solving problems in uncertain environments

Symbolic problem solving, specifically which knowledge-based systems (KBSs), in new and uncertain problem domains is a difficult task. An essential part of developing systems for these environments is determining whether the system is adequately and reliably solving the problem. KBSs that utilize heuristics have a development cycle not conducive to formal control and have high potential for error or incorrect characterizations of the problem they are meant to solve. A method of validating and testing such systems to increase and quantify their reliability is needed. Software engineering strategies for accessing and projecting the reliability of traditional software have been developed after years of experience with the cause and effect of errors. Since KBSs are new, methods for accessing and projecting their reliability are not as well understood. However, validation techniques from traditional software development can be applied to KBSs. Validation and testing techniques unique to KBSs can also be used to determine system reliability. In essence, tools and techniques can be used to meet the need for a legitimate, integrated approach to validation and testing of KBSs as they are developed.     

光网络环境中计算任务与光路的联合调度算法

针对光网络环境下分布式计算系统的资源调度问题,提出了一种光网络计算任务和光路联合调度方案。该方案将光网络的特性加入到传统调度模型中,提出了计算任务与光路通信的联合调度模型,设计求解联合调度模型的扩展型列表算法。仿真实验验证了联合调度的有效性。     

实时多处理器系统的动态分批优化调度算法

提出了一种实时多处理器系统的新的高效动态调度算法--动态分批优化调度算法,该算法突破了以往算法中一次只安排一项任务的做法,采用在每次扩充当前局部调度时,按一定规则在待调度的任务集中选取一批任务,对该批任务中的每项任务在每个处理器上运行构造目标函数,将问题转化为非平衡分配问题,一次性为这些任务都安排一个处理器或为每个处理器安排一项任务,使得这种安排具有最好的"合适性",以增大未安排任务的可行性.这种方法极大地提高了算法的调度成功率.同时,为了研究该算法的有效性,对其进行了大量的模拟,分析了一些任务参数的变化对算法调度成功率的影响,并与节约算法的调度成功率进行了比较.模拟结果显示,在节约算法的调度成功率小于10%的约束条件下,该算法的调度成功率大于90%,说明新算法的优势是非常明显的.     

智能交通信息物理融合云控制系统

针对现代智能交通信息物理融合路网建设中的对象种类复杂、采集数据量大、传输及计算需求高以及实时调度控制能力弱等问题，基于云控制系统理论，以现代智能交通控制网络为研究对象，设计了智能交通信息物理融合云控制系统方案，包括智能交通边缘控制技术和智能交通网络虚拟化技术.基于智能交通流大数据，在云控制管理中心服务器上利用深度学习和超限学习机等智能学习方法对采集的交通流数据进行训练预测计算，能够预测城市道路的短时交通流和拥堵状况.进一步在云端利用智能优化调度算法得到实时的交通流调控策略，用于解决拥堵路段交通流分配难题，提高智能交通控制系统动态运行性能.仿真结果表明了本文方法的有效性.     

基于蚁群算法的智能运输调度问题的研究

在智能运输调度问题的整体法求解思路的基础上,给出了整体法求解智能运输调度问题的数学模型。针对车辆调度问题是个多项式复杂程度的非确定性(Non-determ inisti cPolynomial,NP)难题,在整体法的基础上引入了蚁群算法,给出了整体法求解智能运输调度问题的蚁群算法,并对模型进行了实验分析。     

提高卫星服务寿命的任务规划方法研究

基于组网卫星协同工作规划可提高复杂任务处理的基础上,本文探索降低规划风险,提高卫星服务寿命的卫星任务规划方法.从提高卫星服务寿命角度,建立用于描述资源使用期望的目标规划模型;建立卫星任务规划模型,在任务方案与资源使用中考虑了规划风险要素,并将资源使用目标模型引入到任务规划模型中,以期在规划中同时优化卫星服务寿命要素;基于邻域贪心扩展改善遗传禁忌求解算法,并运用分布并行技术提高工程实用性;利用STK提供基础仿真数据,对模型与算法进行了验证.     

A bi-objective genetic algorithm for intelligent rehabilitation scheduling considering therapy precedence constraints

The rehabilitation inpatients in hospitals often complain about the service quality due to the long waiting time between the therapeutic processes. To enhance service quality, this study aims to propose an intelligent solution to reduce the waiting time through solving the rehabilitation scheduling problem. In particular, a bi-objective genetic algorithm is developed for rehabilitation scheduling via minimizing the total waiting time and the makespan. The conjunctive therapy concept is employed to preserve the partial precedence constraints between the therapies and thus the present rehabilitation scheduling problem can be formulated as an open shop scheduling problem, in which a special decoding algorithm is designed. We conducted an empirical study based on real data collected in a general hospital for validation. The proposed approach considered both the hospital operational efficiency and the patient centralized service needs. The results have shown that the waiting time of each inpatient can be reduced significantly and thus demonstrated the practical viability of the proposed bi-objective heuristic genetic algorithm.     

基于负载基尼系数的服务网络公平均衡调度

针对组织结构较为稳定的区域内服务网络,提出了一种有监督的公平均衡负载调度算法。该算法受到经济学领域的收入分配基尼系数的启发,通过对网络负载分配基尼系数的监控,最终完成区域内服务任务的公平调度。给出了实现公平任务调度所需的系统结构和算法步骤,并通过仿真结果验证了该方法能有效完成服务网络任务均衡调度,具有较好的全局公平性。     

A parallel interval method implementation for global optimization using dynamic load balancing

During the past few years the interest paid to global optimization has rapidly increased. One of the main reasons is the new technology of parallel computers which offer computational power capable of solving global optimization problems in reasonable time. The method studied in this work is based on interval analysis which provides a reliable way for solving the problem. Despite the fact that the method contains a high degree of potential parallelism, it is not straight forward to parallelize due to its irregular and unpredictable computational behaviour. This paper deals with the problem of balancing the load dynamically, both with respect to the quantity and to the quality of the tasks. Efficient strategies are proposed and implemented on an Intel iPSC/2 hypercube. Since the sequential algorithm is used as a base it will be modified to suit the parallel algorithm.     

云计算平台中非定期任务并行调度仿真

由于云计算平台的动态不确定性和非定期任务调度本身的复杂性,使得非定期任务调度过程中的耗时长和负载不均等问题很难得到有效解决.针对上述问题,提出一种非定期任务并行调度方法,并应用到云计算中.通过多方面考虑云平台客户非定期任务的截止时间底线、调度估算等并行调度约束条件和各种可用资源的性能参数,对非定期任务调度的多目标约束条...