Genetic local search algorithm for a new bi-objective arc routing problem with profit collection and dispersion of vehicles

2018 ◽  
Vol 92 ◽  
pp. 276-288 ◽  
Author(s):  
Guilherme Dhein ◽  
Olinto César Bassi de Araújo ◽  
Ghendy Cardoso Jr.
Keyword(s):  
Local Search ◽  
Search Algorithm ◽  
Arc Routing ◽  
Local Search Algorithm ◽  
Routing Problem ◽  
Genetic Local Search

A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem

2019 ◽  
Vol 478 ◽  
pp. 40-61 ◽  
Author(s):  
Jianyu Long ◽  
Zhenzhong Sun ◽  
Panos M. Pardalos ◽  
Ying Hong ◽  
Shaohui Zhang ◽  
...  
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Local Search Algorithm ◽  
Routing Problem ◽  
Multi Objective ◽  
Prize Collecting ◽  
Genetic Local Search

scholarly journals GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem

2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Local Search ◽  
Hybrid Algorithm ◽  
State Of The Art ◽  
Search Algorithm ◽  
Satisfiability Problem ◽  
Local Search Algorithm ◽  
Overall Performance ◽  
Genetic Local Search ◽  
Search Stage

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.

Sign in / Sign up

Export Citation Format

Share Document