共查询到20条相似文献,搜索用时 31 毫秒
1.
M. Fatih Tasgetiren Quan-Ke Pan P.N. Suganthan Adalet Oner 《Applied Mathematical Modelling》2013,37(10-11):6758-6779
In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant of the well-known permutation flowshop scheduling problem where idle time is not allowed on machines. In other words, the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions: First of all, a discrete artificial bee colony algorithm is presented to solve the problem on hand first time in the literature. Secondly, some novel methods of calculating the total tardiness from makespan are introduced for the no-idle permutation flowshop scheduling problem. Finally, the main contribution of the paper is due to the fact that a novel speed-up method for the insertion neighborhood is developed for the total tardiness criterion. The performance of the discrete artificial bee colony algorithm is evaluated against a traditional genetic algorithm. The computational results show its highly competitive performance when compared to the genetic algorithm. Ultimately, we provide the best known solutions for the total tardiness criterion with different due date tightness levels for the first time in the literature for the Taillard’s benchmark suit. 相似文献
2.
Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization 总被引:1,自引:0,他引:1
In this paper, a HGA (hybrid genetic algorithm) is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are known to be NP-hard. One of the chromosomes in the initial population is constructed by a suitable heuristic and the others are yielded randomly. An artificial chromosome is generated by a weighted simple mining gene structure, with which a new crossover operator is presented. Additionally, two effective heuristics are adopted as local search to improve all generated chromosomes in each generation. The HGA is compared with one of the most effective heuristics and a recent meta-heuristic on 120 benchmark instances. Experimental results show that the HGA outperforms the other two algorithms for all cases. Furthermore, HGA obtains 115 best solutions for the benchmark instances, 92 of which are newly discovered. 相似文献
3.
A hybrid genetic local search algorithm for the permutation flowshop scheduling problem 总被引:1,自引:0,他引:1
Traditionally, the permutation flowshop scheduling problem (PFSP) was with the criterion of minimizing makespan. The permutation flowshop scheduling problem to minimize the total flowtime has attracted more attention from researchers in recent years. In this paper, a hybrid genetic local search algorithm is proposed to solve this problem with each of both criteria. The proposed algorithm hybridizes the genetic algorithm and a novel local search scheme that combines two local search methods: the Insertion Search (IS) and the Insertion Search with Cut-and-Repair (ISCR). It employs the genetic algorithm to do the global search and two local search methods to do the local search. Two local search methods play different roles in the search process. The Insertion Search is responsible for searching a small neighborhood while the Insertion Search with Cut-and-Repair is responsible for searching a large neighborhood. Furthermore, the orthogonal-array-based crossover operator is designed to enhance the GA’s capability of intensification. The experimental results show the advantage of combining the two local search methods. The performance of the proposed hybrid genetic algorithm is very competitive. For the PFSP with the total flowtime criterion, it improved 66 out of the 90 current best solutions reported in the literature in short-term search and it also improved all the 20 current best solutions reported in the literature in long-term search. For the PFSP with the makespan criterion, the proposed algorithm also outperforms the other three methods recently reported in the literature. 相似文献
4.
《European Journal of Operational Research》1997,96(3):578-590
This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modern manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for this problem have not come to solve large scale problem instances with over a hundred jobs. In order to improve the performance of branch-and-bound algorithms this paper proposes a new dominance relation by which the search load could be reduced, and notices that it is based on a sufficient precondition. This suggests that the dominance relation holds with high possibility even if the precondition approximately holds, thus being more realistic. The branch-and-bound algorithm proposed here takes advantage of this possibility for obtaining an optimal solution as early as possible in the branch-and-bound search. For this purpose this paper utilizes membership functions in the context of the fuzzy inference. Extensive numerical experiments that were executed through Monte Carlo simulations and benchmark tests show that the developed branch-and-bound algorithm can solve 3-machine problem instances with up to 1000 jobs with probability of over 99%, and 4-machine ones with up to 900 jobs with over 97%. 相似文献
5.
The objective of this paper is to develop a branch and bound algorithm for the problem of minimising maximum lateness in a two-machine flowshop, subject to release dates and time lag constraints. The importance of this NP-hard problem is twofold, it arises as a strong relaxation of the classical permutation flowshop problem, and it generalises several well studied two-machine flowshop problems. Computational experiments performed on a large set of randomly generated problems show that our algorithm can solve to optimality large size instances. 相似文献
6.
7.
“Managed” lanes of highways usually refer to lanes that are not open to all types of vehicles, such as “High Occupancy Vehicles”
(HOV) lanes and “High Occupancy Toll” (HOT) lanes, etc. The HOV lanes of highways are reserved only for vehicles with a driver
and one or more passengers. Whereas, HOT lanes allow all vehicles but require tolls from the vehicles with no passenger except
the driver. In this paper, we present a discrete-time traffic assignment system optimum model to predict the optimal traffic
flows on managed lanes at various times in the entire planning horizon. This model minimizes the overall delay (travel time)
and belongs to the class of dynamic traffic assignment (DTA) problems. When applied to general networks, DTA problems can
be large and difficult to solve, but the problem is manageable when it is applied to a network with managed lanes. In particular,
the DTA model in this paper for managed lanes is reduced to a mixed integer program for which several efficient heuristic
algorithms exist. This paper also discusses the special properties of the discrete-time DTA model, based upon which a heuristic
algorithm is proposed. Numerical results show that this algorithm is efficient for many cases of the managed lane problems. 相似文献
8.
Emna Dhouib Jacques Teghem Taïcir Loukil 《Journal of Mathematical Modelling and Algorithms》2013,12(1):85-99
This paper studies the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints minimizing the number of tardy jobs. Dependent setup times are defined as the work to prepare the machines between two successive jobs. Time lags are defined as intervals of time that must exist between every couple of successive operations of the same job. Two mathematical programming formulations are proposed for the considered problem. A simulated annealing algorithm is also developed to solve the problem. Computational experiments are presented and discussed. 相似文献
9.
M. Fatih Tasgetiren Yun-Chia Liang Mehmet Sevkli Gunes Gencyilmaz 《European Journal of Operational Research》2007
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutation flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. For this purpose, a heuristic rule called the smallest position value (SPV) borrowed from the random key representation of Bean [J.C. Bean, Genetic algorithm and random keys for sequencing and optimization, ORSA Journal of Computing 6(2) (1994) 154–160] was developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems. In addition, a very efficient local search, called variable neighborhood search (VNS), was embedded in the PSO algorithm to solve the well known benchmark suites in the literature. The PSO algorithm was applied to both the 90 benchmark instances provided by Taillard [E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64 (1993) 278–285], and the 14,000 random, narrow random and structured benchmark instances provided by Watson et al. [J.P. Watson, L. Barbulescu, L.D. Whitley, A.E. Howe, Contrasting structured and random permutation flowshop scheduling problems: Search space topology and algorithm performance, ORSA Journal of Computing 14(2) (2002) 98–123]. For makespan criterion, the solution quality was evaluated according to the best known solutions provided either by Taillard, or Watson et al. The total flowtime criterion was evaluated with the best known solutions provided by Liu and Reeves [J. Liu, C.R. Reeves, Constructive and composite heuristic solutions to the P∥∑Ci scheduling problem, European Journal of Operational Research 132 (2001) 439–452], and Rajendran and Ziegler [C. Rajendran, H. Ziegler, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155(2) (2004) 426–438]. For the total flowtime criterion, 57 out of the 90 best known solutions reported by Liu and Reeves, and Rajendran and Ziegler were improved whereas for the makespan criterion, 195 out of the 800 best known solutions for the random and narrow random problems reported by Watson et al. were improved by the VNS version of the PSO algorithm. 相似文献
10.
In this paper, we show the use of Multivariate Time Series models, Markov Random Fields and Bayesian methodologies to solve
an applied ophthalmological problem related to the study of glaucoma. Glaucoma is a very serious and widely extended eye disease
characterized by a gradual decrease in the intensity of the patient’s sight. It is not, however, homogeneous over all the
visual field, and starts at one or several sites and gradually spreads to nearby sites. Measurement of the patient’s “seeing
threshold” at different points in the visual field is an important diagnostic tool for glaucoma and other diseases. It results
in a map with 52 numerical values, each of which represents the level of intensity perceived by the patient at that site,
and ranges from 0 (complete blindness) to 35 (exceptional vision). Additionally a “defect status” variable can be attached
at each site in the visual field. This variable would indicate whether the site is normal or defective. Using Bayesian methodologies,
the “defect status” process can be regarded as a parameter of the probability distribution of the thresholds and can be estimated
as the maximum of its posterior distribution. The stochastic model assumed for the observed “threshold”, given the “defect
status”, is a first order autoregressive integrated model (VARI(1,1)) in time, with first order homogeneous spatial correlation.
The defect status is modeled by using a Spatiotemporal Autologistic Model with non-homogeneous spatial dependence. This dependence
assumes that the propagation of the lesions follows the directions taken by the nerve fibers. MCMC methods are used to jointly
estimate the defect status, and parameters and hyperparameters of the model. 相似文献
11.
Kalpana Dahiya Surjeet Kaur Suneja Vanita Verma 《Computational Optimization and Applications》2007,36(1):67-82
In this paper a minimization problem with convex objective function subject to a separable convex inequality constraint “≤”
and bounded variables (box constraints) is considered. We propose an iterative algorithm for solving this problem based on
line search and convergence of this algorithm is proved. At each iteration, a separable convex programming problem with the
same constraint set is solved using Karush-Kuhn-Tucker conditions. Convex minimization problems subject to linear equality/
linear inequality “≥” constraint and bounds on the variables are also considered. Numerical illustration is included in support
of theory. 相似文献
12.
The complete topology design problem of survivable mesh-based transport networks is to address simultaneously design of network
topology, working path routing, and spare capacity allocation based on span-restoration. Each constituent problem in the complete
design problem could be formulated as an Integer Programming (IP) and is proved to be
NP\mathcal{NP}
-hard. Due to a large amount of decision variables and constraints involved in the IP formulation, to solve the problem directly
by exact algorithms (e.g. branch-and-bound) would be impractical if not impossible. In this paper, we present a two-level
evolutionary approach to address the complete topology design problem. In the low-level, two parameterized greedy heuristics
are developed to jointly construct feasible solutions (i.e., closed graph topologies satisfying all the mesh-based network
survivable constraints) of the complete problem. Unlike existing “zoom-in”-based heuristics in which subsets of the constraints
are considered, the proposed heuristics take all constraints into account. An estimation of distribution algorithm works on
the top of the heuristics to tune the control parameters. As a result, optimal solution to the considered problem is more
likely to be constructed from the heuristics with the optimal control parameters. The proposed algorithm is evaluated experimentally
in comparison with the latest heuristics based on the IP software CPLEX, and the “zoom-in”-based approach on 28 test networks
problems. The experimental results demonstrate that the proposed algorithm is more effective in finding high-quality topologies
than the IP-based heuristic algorithm in 21 out of 28 test instances with much less computational costs, and performs significantly
better than the “zoom-in”-based approach in 19 instances with the same computational costs. 相似文献
13.
The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved. 相似文献
14.
In this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by synthesizing the Cross Entropy method
and Markov decision processes. In particular, this new algorithm assigns a random length to each arc and alters the Hamiltonian
cycle problem to the travelling salesman problem. Thus, there is now a probability corresponding to each arc that denotes
the probability of the event “this arc is located on the shortest tour.” Those probabilities are then updated as in cross
entropy method and used to set a suitable linear programming model. If the solution of the latter yields any tour, the graph
is Hamiltonian. Numerical results reveal that when the size of graph is small, say less than 50 nodes, there is a high chance
the algorithm will be terminated in its cross entropy component by simply generating a Hamiltonian cycle, randomly. However,
for larger graphs, in most of the tests the algorithm terminated in its optimization component (by solving the proposed linear
program). 相似文献
15.
An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem 总被引:4,自引:0,他引:4
This paper proposes a new tabu search algorithm for multi-objective combinatorial problems with the goal of obtaining a good approximation of the Pareto-optimal or efficient solutions. The algorithm works with several paths of solutions in parallel, each with its own tabu list, and the Pareto dominance concept is used to select solutions from the neighborhoods. In this way we obtain at each step a set of local nondominated points. The dispersion of points is achieved by a clustering procedure that groups together close points of this set and then selects the centroids of the clusters as search directions. A nice feature of this multi-objective algorithm is that it introduces only one additional parameter, namely, the number of paths. The algorithm is applied to the permutation flowshop scheduling problem in order to minimize the criteria of makespan and maximum tardiness. For instances involving two machines, the performance of the algorithm is tested against a Branch-and-Bound algorithm proposed in the literature, and for more than two machines it is compared with that of a tabu search algorithm and a genetic local search algorithm, both from the literature. Computational results show that the heuristic yields a better approximation than these algorithms. 相似文献
16.
《European Journal of Operational Research》1996,93(3):490-510
A genetic algorithm (GA) with an asexual reproduction plan through a generalized mutation for an evolutionary operator is developed that can be directly applied to a permutation of n numbers for an approximate global optimal solution of a traveling salesman problem (TSP). Schema analysis of the algorithm shows that a sexual reproduction with the generalized mutation operator preserves the global convergence property of a genetic algorithm thus establishing the fundamental theorem of the GA for the algorithm. Avoiding an intermediate step of encoding through random keys to preserve crossover or permuting n and using “fixing” states for legal crossover are the chief benefits of the innovations reported in this paper. The algorithm has been applied to a number of natural and artificial problems and the results are encouraging. 相似文献
17.
Fernando Tavares-Pereira Vincent Mousseau Bernard Roy 《Annals of Operations Research》2007,154(1):69-92
Districting problems are of high importance in many different fields. Multiple criteria models seem a more adequate representation
of districting problems in real-world situations. Real-life decision situations are by their very nature multidimensional.
This paper deals with the problem of partitioning a territory into “homogeneous” zones. Each zone is composed of a set of
elementary territorial units. A district map is formed by partitioning the set of elementary units into connected zones without
inclusions. When multiple criteria are considered, the problem of enumerating all the efficient solutions for such a model
is known as being NP-hard, which is why we decided to avoid using exact methods to solve large-size instances. In this paper,
we propose a new method to approximate the Pareto front based on an evolutionary algorithm with local search. The algorithm
presents a new solution representation and the crossover/mutation operators. Its main features are the following: it deals with multiple criteria; it allows to solve large-size instances
in a reasonable CPU time and generates high quality solutions. The algorithm was applied to a real-world problem, that of
the Paris region public transportation. Results will be used for a discussion about the reform of its current pricing system. 相似文献
18.
In order to solve a quadratic 0/1 problem, some techniques, consisting in deriving a linear integer formulation, are used.
Those techniques, called “linearization”, usually involve a huge number of additional variables. As a consequence, the exact
resolution of the linear model is, in general, very difficult.
Our aim, in this paper, is to propose “economical” linear models. Starting from an existing linearization (typically the so-called
“classical linearization”), we find a new linearization with fewer variables. The resulting model is called “Miniaturized”
linearization. Based on this approach, we propose a new linearization scheme for which numerical tests have been performed. 相似文献
19.
In this paper, we propose a parallel exact method to solve bi-objective combinatorial optimization problems. This method has been inspired by the two-phase method which is a very general scheme to optimally solve bi-objective combinatorial optimization problems. Here, we first show that applying such a method to a particular problem allows improvements. Secondly, we propose a parallel model to speed up the search. Experiments have been carried out on a bi-objective permutation flowshop problem for which we also propose a new lower bound. 相似文献
20.
In this paper, we consider a permutation flowshop scheduling problem with deteriorating jobs. The objective is to minimize the total tardiness of all jobs. A branch-and-bound algorithm incorporating with a dominance property and a lower bound is developed. Furthermore, two metaheuristic algorithms, the simulated annealing algorithm, and the particle swarm optimization method, are proposed. Finally, computational studies are given. 相似文献