نتایج جستجو برای: constructive heuristic
تعداد نتایج: 74351 فیلتر نتایج به سال:
This paper presents a real-world, capacitated examination timetabling problem from Universiti Malaysia Pahang (UMP), Malaysia. The problem has constraints which have not been modelled before, these being the distance between examination rooms and splitting exams across several rooms. These constraints provide additional challenges in defining a suitable model and in developing a constructive he...
Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling Thief Problem (TTP). However, the accuracy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-theart approaches to gather a comprehensive overview on...
This paper presents an eecient implementation method for a constructive negation approach in logic programming. The constructive negation approach is reformulated as a derivation rule. An heuristic method for eeciently implementing the derivation rule is presented and the complexity of the heuristic method is analysed.
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first improvement, if the initial solution is chosen at random. However, starting with ‘greedy’ or ‘nearest neighbor’ constructive heuristics, the best improvement is better and faster on average. Reasons for this behavior are i...
The general routing problem (GRP) is a fundamental ???? ???? -hard vehicle problem, first defined by Orloff in 1974. It contains as special cases the Chinese postman rural graphical TSP, and Steiner TSP. We examine detail known constructive heuristic for GRP, due to Christofides others. show how speed it up, both theory practice, while obtaining solutions that are at least good. Computational r...
in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...
vehicle routing problem (vrp) is one of the major problems in the transportation and distribution planning. in the most previous studies, the objective of vrp models was distance and vehicle related costs. however in many industrial cases along with routing distance, vehicle loading amount is a factor of cost function. in this paper, we formulate a mixed integer non-linear programming (minlp) m...
We present a genetic programming hyper-heuristic system to evolve a ‘disposable’ heuristic for each of a wide range of benchmark instances of the two-dimensional strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. Usually, there is a trade-off between the generality of a packi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید