[HTML][HTML] A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …
traveling salesman problem (TSP) and it is among the most researched combinatorial …
Barnacles mating optimizer: a new bio-inspired algorithm for solving engineering optimization problems
This paper presents a novel bio-inspired optimization algorithm namely the Barnacles
Mating Optimizer (BMO) algorithm to solve optimization problems. The proposed algorithm …
Mating Optimizer (BMO) algorithm to solve optimization problems. The proposed algorithm …
An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the
echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat …
echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat …
A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
The clustered generalized traveling salesman problem (CGTSP) is an extension of the
classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of …
classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of …
Reliable blood supply chain network design with facility disruption: A real-world application
The blood supply of hospitals in disasters is a crucial issue in supply chain management. In
this paper, a dynamic robust location–allocation model is presented for designing a blood …
this paper, a dynamic robust location–allocation model is presented for designing a blood …
[HTML][HTML] Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
After the completion of a job on a machine, it needs to be transported to the next machine,
actually taking some time. However, the transportation times are commonly neglected in the …
actually taking some time. However, the transportation times are commonly neglected in the …
A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem
The water cycle algorithm (WCA) is a nature-inspired meta-heuristic recently contributed to
the community in 2012, which finds its motivation in the natural surface runoff phase in water …
the community in 2012, which finds its motivation in the natural surface runoff phase in water …
A discrete shuffled frog-lea** algorithm based on heuristic information for traveling salesman problem
Y Huang, XN Shen, X You - Applied Soft Computing, 2021 - Elsevier
A discrete shuffled frog-lea** algorithm based on heuristic information is proposed and
the traveling salesman problem is used as a test problem. First, a new individual generation …
the traveling salesman problem is used as a test problem. First, a new individual generation …
Integrated production-inventory-routing problem for multi-perishable products under uncertainty by meta-heuristic algorithms
The present study aims to introduce an integrated production-inventory-routing problem
(PIRP) with a mixed-integer linear programming model, remarking a multi-perishable …
(PIRP) with a mixed-integer linear programming model, remarking a multi-perishable …
Colonial competitive differential evolution: an experimental study for optimal economic load dispatch
M Ghasemi, M Taghizadeh, S Ghavidel… - Applied Soft …, 2016 - Elsevier
Differential evolution (DE) algorithm is a population-based algorithm designed for global
optimization of the optimization problems. This paper proposes a different DE algorithm …
optimization of the optimization problems. This paper proposes a different DE algorithm …