This paper presents a new multi-objective evolutionary algorithm which consists of a hybrid between a particle swarm optimization (PSO) approach and scatter search. The main idea of the approach is to combine the high convergence rate of the particle swarm optimization algorithm with a local search approach based on scatter search. We propose a new leader selection scheme for PSO, which aims to...

This paper presents a novel hybrid ant colony optimization approach called SS_ACO algorithm to solve the vehicle routing problem. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with scatter search (SS). In our hybrid algorithm, we use ACO algorithm and greedy heuristic to generate the initial solutions which are ...

Scatter Search and its generalized form Path Relinking, are evolutionary methods that have been successfully applied to hard optimization problems. Unlike genetic algorithms, they operate on a small set of solutions and employ diversification strategies of the form proposed in Tabu Search, which give precedence to strategic learning based on adaptive memory, with limited recourse to randomizati...

Despite the development of huge healthcare Web sites and powerful search engines, many searchers end their searches prematurely with incomplete information. Recent studies suggest that users often retrieve incomplete information because of the complex scatter of relevant facts about a topic across Web pages. However, little is understood about regularities underlying such information scatter. T...

Time-dependent prize-collecting arc routing problems (TD-PARPs) generalise the regular (PARPs). PARPs have arcs associated with collectable prizes along travelling costs. TD-PARPs allow travel times to vary at horizon so that real-life uncertain factors such as traffic and weather conditions can be taken into account. A TD-PARP is find a route maximises profit i.e. total collected minus two fac...