Ara
Toplam kayıt 7, listelenen: 1-7
An evolution strategy approach to the team orienteering problem with time windows
(PERGAMON-ELSEVIER SCIENCE LTD, 2020)
The team orienteering problem with time windows (TOPTW) is a highly constrained NP-hard problem having many practical applications in vehicle routing and production scheduling. The TOPTW is an extended variant of the ...
Null Control in Linear Antenna Arrays with Ensemble Differential Evolution
(IEEE, 2013)
This paper describes a synthesis method for null insertion in linear antenna array geometries by using newly proposed ensemble differential evolution (DE) algorithm. The given ensemble DE algorithm uses the advantages of ...
A Discrete Artificial Bee Colony Algorithm for the Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times
(IEEE, 2016)
A discrete artificial bee colony ( DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ...
A Discrete Artificial Bee Colony Algorithm for the Team Orienteering Problem with Time Windows
(IEEE, 2013)
This paper presents a discrete artificial bee colony algorithm (DABC) for solving the team orienteering problem with time windows (TOPTW). The proposed algorithm employs a destruction and construction procedure to generate ...
A variable iterated greedy algorithm for the traveling salesman problem with time windows
(ELSEVIER SCIENCE INC, 2014)
This paper presents a variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately. The TSPTW has ...
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 ...
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
(SPRINGER-VERLAG BERLIN, 2013)
In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction ...