Sciweavers

205 search results - page 11 / 41
» A Heuristic Solution for a Driver-Vehicle Scheduling Problem
Sort
View
ICCS
2007
Springer
14 years 1 months ago
An Heuristic Method for GPS Surveying Problem
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
Stefka Fidanova
COR
2008
88views more  COR 2008»
13 years 7 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
COR
2008
118views more  COR 2008»
13 years 7 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
13 years 7 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
EVOW
2005
Springer
14 years 1 months ago
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Konstantin Chakhlevitch, Peter I. Cowling