A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …

The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …

Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …

The minimum independent dominance set (MIDS) problem is an important version of the
dominating set with some other applications. In this work, we present an improved master …

The joint order batching and picker routing problem (JOBPRP) is a combinatorial
optimization problem that occurs during in the order-picking operation of warehouse …

This article solves the scheduling problem in vegetable processing and packaging facility,
where multiple types of vegetable consignments need to be packed using dissimilar parallel …

Abstract The Set Orienteering Problem (SOP) is a variant of the popular Orienteering
Problem (OP) arising from a number of real-life applications. The aim is to find a tour across …

For a simple undirected weighted graph G=(V, E, w, c), the weighted total domination
problem is to find a total dominating set S with the minimum weight cost. A total dominating …

Industrial robot applications should be designed to allow the robot to provide the best
performance for increasing throughput. In this regard, both trajectory and task order …

A colored traveling salesman problem (CTSP) is an important variant of the well-known
multiple traveling salesman problem, which uses colors to differentiate salesmen's …