共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we present a general approach for solving constraint problems by local search. The proposed approach is based
on a set of high-level constraint primitives motivated by constraint programming systems. These constraints constitute the
basic bricks to formulate a given combinatorial problem. A tabu search engine ensures the resolution of the problem so formulated.
Experimental results are shown to validate the proposed approach.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
2.
A modified VNS metaheuristic for max-bisection problems 总被引:1,自引:0,他引:1
Ai-fan Ling Cheng-xian Xu Le Tang 《Journal of Computational and Applied Mathematics》2008,220(1-2):413-421
Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033–1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile that VNS metaheuristic is extended to solve max-bisection problems. Unfortunately, comparing with max-cut problems, max-bisection problems have more complicated feasible region via the linear constraint eTx=0. It is hard to directly apply the typical VNS metaheuristic to deal with max-bisection problems. In this paper, we skillfully combine the constraint eTx=0 with the objective function, obtain a new optimization problem which is equivalent to the max-bisection problem, and then adopt a distinct greedy local search technique to the resulted problem. A modified VNS metaheuristic based on the greedy local search technique is applied to solve max-bisection problems. Numerical results indicate that the proposed method is efficient and can obtain high equality solution for max-bisection problems. 相似文献
3.
An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem 总被引:2,自引:0,他引:2
Elder Magalhães Macambira 《Annals of Operations Research》2002,117(1-4):175-190
The purpose of this article is to describe an efficient search heuristic for the Maximum Edge-weighted Subgraph (MEwS) problem. This problem requires to find a subgraph such that the sum of the weights associated with the edges of the subgraph is maximized subject to a cardinality constraint. In this study a tabu search heuristic for the MEwS problem is proposed. Different algorithms to obtain an initial solution are presented. One neighborhood search strategy is also proposed. Preliminary computational results are reported for randomly generated test problems of MEwS problem with different densities and sizes. For most of test problems, the tabu search heuristic found good solutions. In addition, for large size test problems, the tabu search outperformed the local search heuristic appearing in the literature. 相似文献
4.
Constraint programming and local search are two well known optimization technologies. In recent years, methods for combining these two technologies have been put forward, one of which advocates the use of constraint programming for searching the local neighborhood of the current solution. We present a search technique which improves on the performance of this constraint programming-based local search method and perform experiments on a variety of both simple and more complex combinatorial problems. We also demonstrate the benefit of combining local and complete search methods. 相似文献
5.
The Gradient Projection Method with Exact Line Search 总被引:3,自引:0,他引:3
The gradient projection algorithm for function minimization is often implemented using an approximate local minimization along the projected negative gradient. On the other hand, for some difficult combinational optimization problems, where a starting guess may be far from a solution, it may be advantageous to perform a nonlocal (exact) line search. In this paper we show how to evaluate the piece-wise smooth projection associated with a constraint set described by bounds on the variables and a single linear equation. When the NP hard graph partitioning problem is formulated as a continuous quadratic programming problem, the constraints have this structure. 相似文献
6.
This paper focuses on introducing a concept of diversified local search strategy under the scatter search framework for the probabilistic traveling salesman problem (PTSP). Different combinations of three commonly used local search methods in the PTSP, i.e., 1-shift, 2-opt, and 3-opt, were used to investigate its effects. A set of numerical experiments were conducted to test the validity of the proposed strategy based on randomly generated test instances. The numerical results and the permutation test showed that the diversified local search strategy, especially by combining 1-shift and 2-opt algorithms, can most effectively solve the homogeneous and heterogeneous PTSP in most of the tested instances in comparison with the single local search strategy under scatter search framework. 相似文献
7.
A two-stage intelligent search algorithm for the two-dimensional strip packing problem 总被引:2,自引:0,他引:2
Stephen C.H. LeungDefu Zhang Kwang Mong Sim 《European Journal of Operational Research》2011,215(1):57-69
This paper presents a two-stage intelligent search algorithm for a two-dimensional strip packing problem without guillotine constraint. In the first stage, a heuristic algorithm is proposed, which is based on a simple scoring rule that selects one rectangle from all rectangles to be packed, for a given space. In the second stage, a local search and a simulated annealing algorithm are combined to improve solutions of the problem. In particular, a multi-start strategy is designed to enhance the search capability of the simulated annealing algorithm. Extensive computational experiments on a wide range of benchmark problems from zero-waste to non-zero-waste instances are implemented. Computational results obtained in less than 60 seconds of computation time show that the proposed algorithm outperforms the supposedly excellent algorithms reported recently, on average. It performs particularly better for large instances. 相似文献
8.
Steven Prestwich 《Discrete Applied Mathematics》2008,156(2):148-158
The IMPASSE class of local search algorithms have given good results on many vertex colouring benchmarks. Previous work enhanced IMPASSE by adding the constraint programming technique of forward checking, in order to prune colouration neighbourhoods during search. On several large graphs the algorithm found the best known colourings. This paper extends the work by improving the heuristics and generalising the approach to bandwidth multicolouring. It is shown to give better results than a related search algorithm on an integer programming model, and to be competitive with published results. Experiments indicate that stronger constraint propagation further improves search performance, but that a symmetry breaking technique has unpredictable effects. 相似文献
9.
10.
The irregular strip packing problem is a combinatorial optimization problem that requires to place a given set of two-dimensional polygons within a rectangular container so that no polygon overlaps with other polygons or protrudes from the container, where each polygon is not necessarily convex. The container has a fixed width, while its length can change so that all polygons are placed in it. The objective is to find a layout of the set of polygons that minimizes the length of the container.We propose an algorithm that separates overlapping polygons based on nonlinear programming, and an algorithm that swaps two polygons in a layout so as to find their new positions in the layout with the least overlap. We incorporate these algorithms as components into an iterated local search algorithm for the overlap minimization problem and then develop an algorithm for the irregular strip packing problem using the iterated local search algorithm. Computational comparisons on representative instances disclose that our algorithm is competitive with other existing algorithms. Moreover, our algorithm updates several best known results. 相似文献
11.
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows 总被引:3,自引:0,他引:3
We generalize the standard vehicle routing problem with time windows by allowing both traveling times and traveling costs to be time-dependent functions. In our algorithm, we use a local search to determine routes of the vehicles. When we evaluate a neighborhood solution, we must compute an optimal time schedule for each route. We show that this subproblem can be efficiently solved by dynamic programming, which is incorporated in the local search algorithm. The neighborhood of our local search consists of slight modifications of the standard neighborhoods called 2- opt*, cross exchange and Or-opt. We propose an algorithm that evaluates solutions in these neighborhoods more efficiently than the ones computing the dynamic programming from scratch by utilizing the information from the past dynamic programming recursion used to evaluate the current solution. We further propose a filtering method that restricts the search space in the neighborhoods to avoid many solutions having no prospect of improvement. We then develop an iterated local search algorithm that incorporates all the above ingredients. Finally we report computational results of our iterated local search algorithm compared against existing methods, and confirm the effectiveness of the restriction of the neighborhoods and the benefits of the proposed generalization. 相似文献
12.
Local search and constraint programming for the post enrolment-based course timetabling problem 总被引:1,自引:0,他引:1
Hadrien Cambazard Emmanuel Hebrard Barry O’Sullivan Alexandre Papadopoulos 《Annals of Operations Research》2012,194(1):111-135
We present a variety of approaches for solving the post enrolment-based course timetabling problem, which was proposed as
Track 2 of the 2007 International Timetabling Competition. We approach the problem using local search and constraint programming
techniques. We show how to take advantage of a list-colouring relaxation of the problem. Our local search approach won Track
2 of the 2007 competition. Our best constraint programming approach uses an original problem decomposition. Incorporating
this into a large neighbourhood search scheme seems promising, and provides motivation for studying complete approaches in
further detail. 相似文献
13.
Toshihide Ibaraki Koji Nonobe Mutsunori Yagiura 《Discrete Applied Mathematics》2008,156(11):2050-2069
We propose an iterated local search algorithm for the vehicle routing problem with time window constraints. We treat the time window constraint for each customer as a penalty function, and assume that it is convex and piecewise linear. Given an order of customers each vehicle to visit, dynamic programming (DP) is used to determine the optimal start time to serve the customers so that the total time penalty is minimized. This DP algorithm is then incorporated in the iterated local search algorithm to efficiently evaluate solutions in various neighborhoods. The amortized time complexity of evaluating a solution in the neighborhoods is a logarithmic order of the input size (i.e., the total number of linear pieces that define the penalty functions). Computational comparisons on benchmark instances with up to 1000 customers show that the proposed method is quite effective, especially for large instances. 相似文献
14.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
15.
Tommaso Schiavinotto Thomas Stützle 《Journal of Mathematical Modelling and Algorithms》2004,3(4):367-402
The linear ordering problem is an NP-hard problem that arises in a variety of applications. Due to its interest in practice, it has received considerable attention and a variety of algorithmic approaches to its solution have been proposed. In this paper we give a detailed search space analysis of available benchmark instance classes that have been used in various researches. The large fitness-distance correlations observed for many of these instances suggest that adaptive restart algorithms like iterated local search or memetic algorithms, which iteratively generate new starting solutions for a local search based on previous search experience, are promising candidates for obtaining high performing algorithms. We therefore experimentally compared two such algorithms and the final experimental results suggest that, in particular, the memetic algorithm is a new state-of-the-art approach to the linear ordering problem. 相似文献
16.
Antoine Jouglet Ceyda Oğuz Marc Sevaux 《Journal of Mathematical Modelling and Algorithms》2009,8(3):271-292
The paper considers the hybrid flow-shop scheduling problem with multiprocessor tasks. Motivated by the computational complexity
of the problem, we propose a memetic algorithm for this problem in the paper. We first describe the implementation details
of a genetic algorithm, which is used in the memetic algorithm. We then propose a constraint programming based branch-and-bound
algorithm to be employed as the local search engine of the memetic algorithm. Next, we present the new memetic algorithm.
We lastly explain the computational experiments carried out to evaluate the performance of three algorithms (genetic algorithm,
constraint programming based branch-and-bound algorithm, and memetic algorithm) in terms of both the quality of the solutions
produced and the efficiency. These results demonstrate that the memetic algorithm produces better quality solutions and that
it is very efficient. 相似文献
17.
The tradeoff between the speed and quality of the solutions obtained by various construction and local search algorithms for the elementary bin packing problem (BPP) are analyzed to obtain useful information for designing algorithms for real-world problems that can be modeled as BPPs. On the basis of intensive computational experiments, we observe that the framework of a solution (i.e., a part of a solution consisting of large items or items with tight constraints) should be constructed in the early stages of a local search. New local search algorithms are proposed as empirical support for the observation. 相似文献
18.
A. V. Orlov 《Computational Mathematics and Mathematical Physics》2008,48(2):225-241
A bilinear programming problem with uncoupled variables is considered. First, a special technique for generating test bilinear problems is considered. Approximate algorithms for local and global search are proposed. Asymptotic convergence of these algorithms is analyzed, and stopping rules are proposed. In conclusion, numerical results for randomly generated bilinear problems are presented and analyzed. 相似文献
19.
带投资约束且p不确定的推广p-中位问题 总被引:1,自引:0,他引:1
p-中位问题是设施选址中的一个经典模型,在交通、物流等领域有着广泛应用.在经典p-中位问题的基础上提出一种p不确定的推广p-中位问题,并且加上总投资约束,使得此推广模型更加实用.针对此推广模型,提出三种启发式算法:简单启发式算法、变邻域搜索算法和改进的遗传算法.数值实验结果表明变邻域搜索算法和改进的遗传算法在求解此推广模型时是有效的. 相似文献
20.
Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search 总被引:2,自引:0,他引:2
Steven Prestwich 《Annals of Operations Research》2002,115(1-4):51-72
Systematic backtracking is used in many constraint solvers and combinatorial optimisation algorithms. It is complete and can be combined with powerful search pruning techniques such as branch-and-bound, constraint propagation and dynamic variable ordering. However, it often scales poorly to large problems. Local search is incomplete, and has the additional drawback that it cannot exploit pruning techniques, making it uncompetitive on some problems. Nevertheless its scalability makes it superior for many large applications. This paper describes a hybrid approach called Incomplete Dynamic Backtracking, a very flexible form of backtracking that sacrifices completeness to achieve the scalability of local search. It is combined with forward checking and dynamic variable ordering, and evaluated on three combinatorial problems: on the n-queens problem it out-performs the best local search algorithms; it finds large optimal Golomb rulers much more quickly than a constraint-based backtracker, and better rulers than a genetic algorithm; and on benchmark graphs it finds larger cliques than almost all other tested algorithms. We argue that this form of backtracking is actually local search in a space of consistent partial assignments, offering a generic way of combining standard pruning techniques with local search. 相似文献