[PDF] Top 20 A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP)

... conventional tabu list is constructed to prevent the reversal of accepted moves for the next t iterations, where t is the length of the tabu ...the tabu list is fixed and after some experimentation ... See full document

... The capacitated arc routing problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on ... See full document

... optimal routing and allocation of vehicles in CARP is one of the major decisions for organizations such as municipalities in the context of the urban waste ...and routing of the vehicles they can ... 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

... 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

... vehicle routing problem arises when not all information relevant to the planning of the routes is known by the planner when the routing process begins and information can change after the initial ... 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

... 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 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

... 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

... 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

... The Fuzzy Logic Algorithm is lit up by the intense capacity of fluffy rationale framework to deal with vulnerability and uncertainty. Fluffy rationale framework is notable as model free. Their enrollment ... See full document

... Vehicle Routing Problem (VRP) is a discrete optimization problem with high industrial relevance and high computational ...The problem has been exten- sively studied since it was introduced by ... See full document

... our problem, each cus- tomer could have a unique destination, reducing the scope for efficiency gains through ef- fective ...our problem, the fixed nature of the transit schedule (and its use in creating ... 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

... an algorithm called “Rahyab”[2] is proposed that not only performs IA- RWA but also provides each established lightpath with dedicated redundant ...a routing algorithm is ...based algorithm ... See full document

... and Tabu Search Algorithm in the MATLAB ...the Tabu Search Algorithm shows better results than the Simulated Annealing Algorithm and the new method of Seeding technique is ... See full document

... The algorithm begins to generate a random initial solution, whose cost was obtained by means of the defined cost ...total search, vns_count with the iterations until reaching the value ...local ... 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

... 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