## Search

Now showing items 1-10 of 11

#### A discrete artificial bee colony algorithm for the traveling salesman problem with time windows

(2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)

This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult ...

#### A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops

(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)

In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...

#### Solving fuzzy job-shop scheduling problem by a hybrid PSO algorithm

(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)

This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...

#### A Genetic Algorithm for the Economic Lot Scheduling Problem under Extended Basic Period Approach and Power-of-Two Policy

(SPRINGER-VERLAG BERLIN, 2012)

In this study, we propose a genetic algorithm (GA) for the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. The proposed GA employs a multi-chromosome solution ...

#### 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 DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion

(SPRINGER-VERLAG BERLIN, 2012)

In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ...

#### A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops

(SPRINGER-VERLAG BERLIN, 2012)

In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...

#### Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm

(SPRINGER-VERLAG BERLIN, 2012)

This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...

#### A Discrete Artificial Bee Colony Algorithm for the Traveling Salesman Problem with Time Windows

(IEEE, 2012)

This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult ...