The bottleneck traveling salesman problem is to find a Hamiltonian circuit that minimizes the
largest cost of any of its arcs in a graph. A simple genetic algorithm (GA) using sequential …

In this article we present a variant transportation problem called “A Variant Constrained Bulk
Transshipment Problem”. The purpose of this paper is to propose an efficient Lexi-Search …

(MSTSP), a variation of the famous travelling salesman problem (TSP), is considered here
for our study. The aim of problem is to maximize the minimum edge in a salesman's tour that …

We consider the clustered travelling salesman problem in which vertices (except the starting
vertex) of the network are divided into some prespecified clusters. The problem is to find a …

We consider the single-depot multiple travelling salesman Problem (MTSP) that is a
generalization of the benchmark travelling salesman problem (TSP). The problem outlines …

In this paper, we consider the quadratic assignment problem (QAP), one of the hardest NP-
hard combinatorial optimization problems. We first present a new reformulation of the …

A simple lexisearch algorithm that uses path representation method for the asymmetric
traveling salesman problem (ATSP) is proposed, along with an illustrative example, to obtain …

We consider the maximum scatter travelling salesman problem (MSTSP), a travelling
salesman problem (TSP) variant. The problem aims to maximize the shortest edge in the …

The vehicle routing problem (VRP), belongs to the class of NP-hard problems, is considered
as one of the most difficult problems. The problem aims to serve a number of customers with …

The quadratic assignment problem is a combinatorial problem of deciding the placement of
facilities in specified locations in such a way as to minimize a nonconvex objective function …