TOUR CONSTRUCTION HEURISTICS FOR AN ORDER SEQUENCING PROBLEM

Heuristics for the Stochastic Eulerian Tour Problem

The Stochastic Eulerian Tour Problem (SETP) seeks the Eulerian tour of minimum expected length on an undirected Eulerian graph, when demand on the arcs that have to be serviced is probabilistic. In an earlier paper, we have shown that the SETP is NP-hard and derived several properties of the optimal tour. In this paper, we develop three constructive heuristics for the SETP. The first two are gr...

Heuristics for the multi-vehicle covering tour problem

The multi-vehicle covering tour problem is de"ned on a graph G"(<X=, E), where= is a set of vertices that must collectively be covered by up to m vehicles. The problem consists of determining a set of total minimum length vehicle routes on a subset of <, subject to side constraints, such that every vertex of= is within a prespeci"ed distance from a route. Three heuristics are developed for this...

Hyper-heuristics for Sequencing by Hybridisation Problem

Empirical evaluation of construction heuristics for the multidimensional assignment problem

The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we consider four fast construction heuristics for MAP. One of the heuristics is new. A modification of the heuristics ...

Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...