Sciweavers

594 search results - page 10 / 119
» Travelling Miser Problem
Sort
View
JAR
2000
149views more  JAR 2000»
13 years 7 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
CEC
2011
IEEE
12 years 7 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
COR
2008
160views more  COR 2008»
13 years 6 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
14 years 1 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan