共查询到20条相似文献,搜索用时 15 毫秒
1.
Susan E. Carlson 《Research in Engineering Design》1996,8(1):33-51
This paper uses a genetic algorithm for component selection given a user-defined system layout, a database of components, and a defined set of design specifications. A genetic algorithm is a search method based on the principles of natural selection. An introduction to genetic algorithms is presented, and genetic algorithm attributes that are useful for component selection are explored. A comparison of these attributes is performed using two industrial design problems. A set of genetic algorithm attributes including integer coding, uniform crossover, anti-incest mating, variable mating and mutation rates, retention of population members from generation to generation, and an attention shifted penalty function are suggested for a more efficient search in component selection problems. 相似文献
2.
The beam-type placement machine is capable of picking up multiple components simultaneously from the feeders in printed circuit board (PCB) assembly. Simultaneous pickup occurs only if the heads in the beam are aligned with the feeders and the nozzle-types on these heads match with the component-types on the feeders. In order to minimise the assembly cycle time, the optimisation problem is decomposed into two sub-problems, the pickup combination and sequencing problem, and the placement cluster and sequencing problem. These two sub-problems are simultaneously solved by the proposed hybrid genetic algorithm (HGA). The pickup combination and sequencing problem is similar to the popular multi-compartment vehicle routing problem (MCVRP); a genetic algorithm (GA) for the MCVRP is therefore modified and applied to solving the pickup combination and sequencing problem. A greedy heuristic algorithm is used to solve the placement cluster and sequencing problem. The numerical experiments reveal that the HGA outperforms the algorithms proposed by previous papers. 相似文献
3.
This paper presents an algorithm portfolio methodology based on evolutionary algorithms to solve complex dynamic optimisation problems. These problems are known to have computationally complex objective functions, which make their solutions computationally hard to find, when problem instances of large dimensions are considered. This is due to the inability of the algorithms to provide an optimal or near-optimal solution within an allocated time interval. Therefore, this paper employs a bundle of evolutionary algorithms (EAs) tied together with several processors, known as an algorithm portfolio, to solve a complex optimisation problem such as the inventory routing problem (IRP) with stochastic demands. EAs considered for algorithm portfolios are the genetic algorithm and its four variants such as the memetic algorithm, genetic algorithm with chromosome differentiation, age-genetic algorithm, and gender-specific genetic algorithm. In order to illustrate the applicability of the proposed methodology, a generic method for algorithm portfolios design, evaluation, and analysis is discussed in detail. Experiments were performed on varying dimensions of IRP instances to validate different properties of algorithm portfolio. A case study was conducted to illustrate that the set of EAs allocated to a certain number of processors performed better than their individual counterparts. 相似文献
4.
The capacitated arc routing problem (CARP) is a difficult vehicle routing problem, where given an undirected graph, the objective is to minimize the total cost of all vehicle tours that serve all required edges under vehicle capacity constraints. In this paper, a memetic algorithm with iterated local search (MAILS) is proposed to solve this problem. The proposed MAILS incorporates a new crossover operator, i.e., the longest common substring crossover (LCSX), an iterated local search (ILS) and a perturbation mechanism into the framework of the memetic algorithm (MA). The proposed MAILS is evaluated on the CARP benchmark instances and computational results show that the MAILS is very competitive. 相似文献
5.
We consider an inventory routing problem (IRP) in the liquefied natural gas (LNG) supply chain, called the LNG-IRP. Here, an actor is responsible for the LNG production and inventory management at the liquefaction plants, the routing and scheduling of a heterogeneous fleet of LNG ships, as well as the inventories and sales at the regasification terminals. Furthermore, all ports have a limited number of berths available for loading and unloading. The LNG-IRP is more complicated than many other maritime inventory routing problems because a constant rate of the cargo evaporates in the tanks each day and is used as fuel during transportation. In addition, a variable number of tanks are unloaded at the regasification terminals. We introduce a new path flow formulation for this problem arising from a novel decomposition scheme based on parts of a ship schedule, called duties. A ship schedule for the entire planning horizon can be divided into duties consisting of a visit to a liquefaction plant, then one or two visits to a regasification terminal before ending in a liquefaction plant. The solution method suggested is based on a priori generation of duties, and the formulation is strengthened by valid inequalities. The same problem was previously solved by a branch-price-and-cut algorithm for a schedule-based formulation. Computational results show that the new formulation provides tighter bounds than the previous schedule-based formulation. Furthermore, on a set of 27 benchmark instances, the proposed algorithm clearly outperforms the previous branch-price-and-cut algorithm both with regard to computational time and the number of problems solved within a 10-h time limit. 相似文献
6.
7.
Nowadays – particularly in systems dealing with hazardous materials (HAZMAT) – in addition to minimising the cost of operations in facility location and routing problems, the risk of these operations is considered an important objective. In this paper, a new mathematical model for the location and routing in facilities and disposal sites is proposed. Also, the risk and cost of transporting goods from facilities to customers is considered. The model minimises weighted sum of the cost and risk by answering these questions: (1) where to open the facilities which produce HAZMAT; (2) where to open disposal sites; (3) to which facilities every customer should be assigned; (4) to which disposal site each facility should be assigned; (5) which route a facility should choose to serve the customers; and (6) which route a facility should choose to reach a disposal site. A novel GA is applied to solve the mathematical model. The results show the robustness of GA in terms of finding high-quality non-dominated solutions and running time. 相似文献
8.
9.
10.
In this paper, the integrated production scheduling and vehicle routing problem is considered for a Make-to-Order manufacturer, who has a single machine for production and limited vehicles with capacity constraints for transportation. The objective is to determine production scheduling and vehicle routing, which are two interacted decisions, to minimise the maximum order delivery time. A property on optimal production sequence is proposed first, based on which backward and forward batching methods are developed and are embedded into a proposed genetic algorithm. The proposed genetic algorithm is capable of providing high-quality solutions by determining the two decisions simultaneously. For comparison purpose, a two-stage algorithm is developed, which decomposes the overall problem into two successively solved sub-problems. The experiments show that the proposed genetic algorithm can provide higher quality solutions than the proposed two-stage algorithm and two published algorithms studying related problems. 相似文献
11.
This article presents the variable neighbourhood simulated annealing (VNSA) algorithm, a variant of the variable neighbourhood search (VNS) combined with simulated annealing (SA), for efficiently solving capacitated vehicle routing problems (CVRPs). In the new algorithm, the deterministic ‘Move or not’ criterion of the original VNS algorithm regarding the incumbent replacement is replaced by an SA probability, and the neighbourhood shifting of the original VNS (from near to far by k← k+1) is replaced by a neighbourhood shaking procedure following a specified rule. The geographical neighbourhood structure is introduced in constructing the neighbourhood structures for the CVRP of the string model. The proposed algorithm is tested against 39 well-known benchmark CVRP instances of different scales (small/middle, large, very large). The results show that the VNSA algorithm outperforms most existing algorithms in terms of computational effectiveness and efficiency, showing good performance in solving large and very large CVRPs. 相似文献
12.
13.
A novel tool orientation optimisation algorithm is proposed for 5-axis NC machining with a short ball-end cutter. It can generate collision-free and smooth tool orientations along with a safe and shortest tool length (SSTL). The use of shorter cutters without collision is a key advantage of 5-axis machining because the magnitude of tool deflection and the stability of cutting process are greatly affected by the slenderness ratio of the cutter. Existing methods can calculate the SSTL in the NC simulation process. However, the SSTL is essentially determined by the tool orientations and should be considered in the process of tool path generation. To overcome this limitation, a new tool orientation optimisation algorithm is proposed. The SSTL is determined by optimising the tool orientations under the constraints of global collision avoidance and tool orientation smoothness. The algorithm first computes the global accessibility cone and the SSTL along each accessible tool orientation. Then the tool orientations are optimised based on the discrete dynamic programming with the SSTL along the whole tool path being the optimisation objective. Finally, the tool path is generated by globally smoothing the tool orientations. Computational examples and cutting experiment are given to illustrate the validity and efficiency of the proposed algorithm. 相似文献
14.
This paper addresses an integrated problem of vehicle routing and three-dimensional loading with additional practical constraints such as stability, fragility and LIFO. A column generation (CG) technique-based heuristic is proposed to handle this problem. To generate new columns in CG technique, first, an elementary shortest path problem is solved to find routes with negative reduced cost. Then an extreme point-based heuristic method is employed to verify feasibility of obtained routes in terms of loading and other constraints. To speed up the CG technique, fast column generation is also performed by applying an efficient heuristic pricing method. The CG technique, tested on the benchmark instances, outperforms the efficient tabu search method developed in the literature in terms of solution quality and computation time. 相似文献
15.
Summary In this paper we deal with the following special vehicle routing problem with time window constraints: Given a non-homogeneous fleet of vehicles and a fixed set of customers, during one time period, i.e. a day or a week, these customers have to be delivered in the first half of the period with a certain amount of goods. Thereby delivery may start at timet
start say at the depot and for every customer there is a so-called cut-off-time for the latest possible delivery. In addition to travel time there is a certain delivery-time associated with every customer. In the second half of the time period the vehicles have to pick-up certain amounts of goods and to ship them to the depot. Again there is a cut-off time for the earliest possible pick-up and a certain time-span consumed for every pick-up. We show how this problem can be formulated as a (highdimensional) set partitioning problem with two additional nontrivial sets of side-constraints. Assuming that the number of customers that can be served by a single vehicle on a delivery or pick-up-pass is at most two, the problem reduces to a matching problem with side-constraints. Although the problem is still NP-complete it becomes practicable in the sense that by relaxation and applying effective optimization techniques from non-smooth optimization and efficient matching software good approximate solutions are constructed in acceptable time.This work was partially supported by a grant from the Deutsche Forschungsgemeinschaft (DFG) 相似文献
16.
This study considers a two-echelon system in which a vendor produces a product at a finite production rate and supplies it to several buyers facing independent normally-distributed demands. The product is delivered to the buyers using a set of different speed vehicles with identical capacity and different operating costs. The issues of lead time reduction and the service level constraint on the buyers have been incorporated in the model. A model is formulated to determine the optimal production–inventory policy, vehicle routes and vehicle type for each route by minimising the related production, inventory, lead time crashing and transportation costs of the system while satisfying the service level constraint on each buyer. A coordinated two-phase iterative approach is proposed to solve the model. Finally, a numerical example is included to describe the solution approach and illustrate the results. 相似文献
17.
Jong Myoung Ko 《国际生产研究杂志》2013,51(23):6639-6654
The objective of this paper is to develop a wafer-by-wafer fault detection model for a semiconductor etch tool operating in a worksite situation in which the tool parameter traces are correlated and drift slowly from an initial recipe setting. Process drift is a common occurrence in many processes because of the aging of tool components. The proposed fault detection model compares the entire trace structures of the tool parameters with reference templates by using an improved DTW (dynamic time warping) algorithm, and it performs a T?2-based multivariate analysis with the structure similarity scores created by the improved DTW. In addition, to adapt to the process drift, a recursive T?2 update procedure with an optimal correction factor is incorporated in the model. The optimal correction factor is derived using the Kalman filtering technique. Experiments using the data collected from a worksite reactive ion etching process demonstrate that the performance of the proposed fault detection model is very encouraging. 相似文献
18.
Optimization of the energy required during data transmission in a wireless indoor area network can be achieved through intelligent router placements to keep the network active for longer and improve the packet delivery ratio. In this work, a cascaded cuckoo search algorithm (C-CSA) approach is implemented for optimal router placement in a wireless indoor area network based on minimization of signal attenuation during data packet transmission through a novel mathematical formulation. The transmission energy for each packet, signal-to-noise ratio and packet error ratio are studied over 50 independent runs of the algorithm. The results are presented with statistical confidence to prove the efficiency of the algorithm. C-CSA provides superior results for data transmission energy and the packet delivery ratio compared to existing algorithms. Physical placement of wireless nodes in a building further establishes the reduction in energy requirement and data packet loss through this optimal router placement strategy. 相似文献
19.
AbstractIt is costly to predict tool wear under various machining conditions. To address this challenge, a tool cyber-physical prediction (TCPP) scheme and a hybrid dynamic neural network (HDNN) model are proposed in this paper. This scheme enables users to build and use the models both in the cloud and at the factory by integrating the theoretical maximum tool life and the practical sensing features of the tool wear. Moreover, using features extracted from the sensors and controller, the HDNN model integrates the logistic regression and dynamic neural network to diagnose the tool break and predict tool wear simultaneously. In addition, the scheme presents a model-refreshing approach to tune the HDNN model to adapt to physical variation of the tool coating, the workpiece material, and the removal process in the similar cutting conditions. The experimental results demonstrate that the TCPP scheme with the HDNN model is promising for tool wear prediction while using only a few samples and the current features to adapt to various cutting conditions. 相似文献
20.