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

In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...