[PDF] Top 20 A deterministic tabu search algorithm for the capacitated arc routing problem

... the problem of finding the minimum cost single route to service a set of required edges in an undirected graph and in general is NP-hard ...postman problem which is polynomially solvable ... See full document

... runs of our algorithm that included trials of different swap frequencies. The columns headed “CARPET” give the results reported in Hertz et al (2000). The run times have been divided by 7 to give an approximate ... See full document

... meta- algorithm is problem specific, and is generally designed by human ...Johnson’s algorithm (Johnson, 1954) can be used as a meta-algorithm for two- machine static job shop scheduling (Hunt ... See full document

... the problem parameters (demand, time, distance, city location, etc) are often ...as deterministic value, although in real application, it may not be possible to know all information about customers before ... See full document

... Boltzman constant ( ) K which are initialized before the search starts. Then, a neighborhood is created for the initial solution and it will be replaced with the initial solution, if its objective function value ... See full document

... related problem also frequently seen in practice and studied is the ...considered deterministic parameters such as deterministic travel times, demands and service ...branch-and-cut algorithm ... See full document

... table shows the importance of setting the parameter β correctly. If the value is high, more arcs are considered (i.e. more options to explore in the refinement process) but, at the same time, the processing time ... See full document

... the arc routing problem of the collection of garbage especially for developing ...collection problem in the area of Johor Bahru under municipal authorities of Majlis Perbandaran Johor Bahru ... See full document

... the algorithm. The refrigeration simulation algorithm is a meta-heuristic algorithm of local search which can refrain from local ...efficient algorithm for solving problems with ... See full document

... cost-effective routing, mathematics plays an important role especially in operational research which uses a lot of mathematical models in optimization, modelling and procedures to assist the managers in their ... See full document

... intelligent search techniques which can overcome the problem of being trapped in a local ...Bound algorithm and Belenguer and Benavent (2003) proposed a Cutting Plane ...plane algorithm for ... See full document

... p-median problem caused advances in solution techniques to be often made using combinations of mathematical programming and heuristic search techniques such as branch and bound and Lagrangean relaxation ... See full document

... Vehicle Routing Problem (VRP) is a combinatorial optimization problem with applications to diverse areas such as resource allocation, load balancing, and sensor ...this problem has been widely ... See full document

... 2084 | P a g e Table5.5 gives the time consumed for the simulation by the employed algorithms. The hybrid Simulated Annealing seed Tabu Search Algorithm takes higher time for converging than the ... See full document

... ABSTRACT: In this paper we have used D-Leach protocol along with Fuzzy Based Dynamic Clustering methodology where collection of enormous amount of homogenous sensor nodes forms the Wireless Sensor Network. These sensor ... See full document

... their search parameters based on recent performance and also used a modified objective function to escape local ...local search procedures that later became ...VNS–TS algorithm for the VRPMTW, ... See full document

... first algorithm aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their colony and a source of ...given problem and starts placing different ants ... See full document

... A multi-space sampling heuristic (MSH) for the GVRP was developed recently by Montoya et al. (2016). The algorithm alternates between two phases: sampling and assembling. During the sampling phase, sampled TSP ... See full document

... a capacitated hub location problem with fixed costs and a given number of hubs to be ...counting algorithm and a tabu search-based greedy interchange heuristic have been ...the ... See full document

... “ROLE” algorithm has been ...for routing and wavelength assignment, phase two attempts to reroute demands that were blocked, phase three will initialize phase one over again with a reordered demand ... See full document