[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 …
A systematic study on meta-heuristic approaches for solving the graph coloring problem
Abstract Typically, Graph Coloring Problem (GCP) is one of the key features for graph
stam** in graph theory. The general approach is to paint at least edges, vertices, or the …
stam** in graph theory. The general approach is to paint at least edges, vertices, or the …
A best-path-updating information-guided ant colony optimization algorithm
J Ning, Q Zhang, C Zhang, B Zhang - Information Sciences, 2018 - Elsevier
The ant colony optimization (ACO) algorithm is a type of classical swarm intelligence
algorithm that is especially suitable for combinatorial optimization problems. To further …
algorithm that is especially suitable for combinatorial optimization problems. To further …
Reinforcement learning based local search for grou** problems: A case study on graph coloring
Grou** problems aim to partition a set of items into multiple mutually disjoint subsets
according to some specific criterion and constraints. Grou** problems cover a large class …
according to some specific criterion and constraints. Grou** problems cover a large class …
An effective genetic algorithm for solving the clustered shortest-path tree problem
The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-
source shortest-path problem, in which, given a graph with the set of nodes partitioned into a …
source shortest-path problem, in which, given a graph with the set of nodes partitioned into a …
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem
This paper investigates the clustered shortest-path tree (CluSPT) problem, a generalized
network design problem that has several applications in various areas such as network …
network design problem that has several applications in various areas such as network …
Partition independent set and reduction-based approach for partition coloring problem
Given a graph whose vertex set is partitioned, the partition coloring problem (PCP) requires
the selection of one vertex from each partite set, such that the subgraph induced by the set of …
the selection of one vertex from each partite set, such that the subgraph induced by the set of …
[HTML][HTML] A self-learning approach for optimal detailed scheduling of multi-product pipeline
Z Haoran, L Yongtu, L Qi, S Yun, Y **aohan - Journal of Computational and …, 2018 - Elsevier
Pipeline transportation is cost-optimal in refined product transportation. However, the
optimization of multi-product pipeline scheduling is rather complicated due to multi-batch …
optimization of multi-product pipeline scheduling is rather complicated due to multi-batch …
Digital annealer for quadratic unconstrained binary optimization: A comparative performance analysis
Digital Annealer (DA) is a computer architecture designed for tackling combinatorial
optimization problems formulated as quadratic unconstrained binary optimization (QUBO) …
optimization problems formulated as quadratic unconstrained binary optimization (QUBO) …
A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem
The soft-clustered vehicle routing problem (Soft-CluVRP) is a relaxation of the clustered
vehicle routing problem (CluVRP), which in turn is a variant of the generalized vehicle …
vehicle routing problem (CluVRP), which in turn is a variant of the generalized vehicle …