Search
Now showing items 1-7 of 7
Integrated blood collection and appointment scheduling
(Institute of Industrial Engineers, 2012)
Considering the processing requirements of donated blood, we study an integrated blood collection and appointment scheduling problem. We develop a mixed integer programming model to maximize the amount of donated blood ...
Modelling and solving an m-location, n-courier, priority-based planning problem on a network
(Springer Nature, 2012-01)
In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the ...
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
(Elsevier, 2012-05)
We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and ...
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
(Elsevier, 2012-05)
This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact ...
Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem
(Elsevier, 2012-12-25)
We propose a new nature inspired metaheuristic approach based on the V flight formation of the migrating birds which is proven to be an effective formation in energy saving. Its performance is tested on quadratic assignment ...
Calibrating artificial neural networks by global optimization
(Elsevier, 2012-01)
Artificial neural networks (ANNs) are used extensively to model unknown or unspecified functional relationships between the input and output of a “black box” system. In order to apply the generic ANN concept to actual ...
A branch-and-cut algorithm for the Steiner tree problem with delays
(Springer Science+Business Media, 2012-12)
In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ...
Share this page