Search
Now showing items 11-16 of 16
A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature
(SPRINGER-VERLAG BERLIN, 2012)
Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model ...
A Discrete Harmony Search Algorithm for the Economic Lot Scheduling Problem with Power of Two Policy
(IEEE, 2012)
In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In ...
A Discrete Artificial Bee Colony Algorithm For the Economic Lot Scheduling Problem
(IEEE, 2011)
In this study we present a discrete artificial bee colony (DABC) algorithm to solve the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. In specific, our ...
A Differential Evolution Algorithm for the Median Cycle Problem
(IEEE, 2011)
This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ...
A Differential Evolution Algorithm for the Economic Lot Scheduling Problem
(IEEE, 2011)
In this study we provide a Differential Evolution (DE) based heuristic to solve the Economic Lot Scheduling Problem (ELSP) under basic period approach. The problem is to find the best cyclic production schedule of n items ...
A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy
(2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)
In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In ...