The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NPcomplete combinatorial optimization problems. By literatures, many algorithms and approaches have been launched to solve such the TSP. However, no current algorithms that can provide the exactly optimal solu...

In this paper a new bf oriented tabu search version is presented. It can be used to improve arbitrary existing sequential or parallel tabu search procedures for solving especially long-term production planning problems. As an example the Simple Assembly Line Balancing Problem 2 is considered where an eecient tabu search heuristic exists. Although this sequential procedure reach already good res...

We present here a simplified version of the High-Level Synthesis problem solved using Tabu Search. We show that the simplified problem is related to a scheduling problem in which a large set of jobs has to be sequenced and the objective is to use a minimum number of machines. For each job, a specific time window (release and due date) is known. Instead of solving the HLS problem directly, we so...

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the object...

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Using a simple multiprocessor scheduling problem as a vehicle, we explore the behavior of tabu search algorithms using different tabu, local search and list management strategies. We found that random blocking of the tail of the tabu list always improved performance; but that the use of frequency-based penalties to discourage frequently selected moves did not. Hash coding without conflict resol...