Keyword: programming: travelling salesman

Found 410 papers in total
Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions
Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions
1994,
In this paper, optimal strip strategies are developed for a variety of two-dimensional...
Genetic local search in combinatorial optimization
Genetic local search in combinatorial optimization
1994,
The most common application of genetic algorithms to combinatorial optimization...
Tabu search performance on the symmetric traveling salesman problem
Tabu search performance on the symmetric traveling salesman problem
1994,
This paper describes tabu search and its application to the symmetric TSP, which is a...
The delivery man problem and cumulative matroids
The delivery man problem and cumulative matroids
1993,
Given a complete directed graph G=(V,A), the delivery man problem (DMP) consists of...
A note on the 5-person traveling salesman game
A note on the 5-person traveling salesman game
1993,
Let N={1,2,...,n} be a set of customers and G=(Nℝ{0},E) an undirected connected...
On some approximately balanced combinatorial cooperative games
On some approximately balanced combinatorial cooperative games
1993,
A model of taxation for cooperative n- person games is introduced where proper...
Topological design of ring networks
Topological design of ring networks
1994,
In this paper the shortcomings of conventional ring networks are discussed and how...
A study of inserting sequence and feeder allocation problem on printed circuit board
A study of inserting sequence and feeder allocation problem on printed circuit board
1994,
In this paper, the authors try to raise the efficiency of PCB production by improving...
Machine setup and component placement in printed circuit board assembly
Machine setup and component placement in printed circuit board assembly
1994,
Populating printed circuit boards is one of the most costly and time-consuming steps...
A heuristic for the multiple tour maximum collection problem
A heuristic for the multiple tour maximum collection problem
1994,
The multiple tour maximum collection problem (MTMCP) consists of determining the m...
A decision support system for single machine scheduling problems
A decision support system for single machine scheduling problems
1992,
Production planning often implies scheduling a set of tasks, involving very complex...
An improved simulated annealing algorithm with genetic characteristics and the traveling salesman problem
An improved simulated annealing algorithm with genetic characteristics and the traveling salesman problem
1993,
There are two major criticisms about simulated annealing (SA) as a general method for...
Vehicle routing with stochastic demands and restricted failures
Vehicle routing with stochastic demands and restricted failures
1993,
This paper considers a class of stochastic vehicle routing problems (SVRPs) with...
Routing of straddle carriers at a container terminal with the special aspect of internal moves
Routing of straddle carriers at a container terminal with the special aspect of internal moves
1993,
Besides loading and discharging of ships, trucks and railway internal transportations...
Survivable networks, linear programming relaxations and the parsimonious property
Survivable networks, linear programming relaxations and the parsimonious property
1993,
The authors consider the survivable network design problem-the problem of designing,...
Hamiltonian cycles and Markov chains
Hamiltonian cycles and Markov chains
1994,
In this paper the authors derive new characterizations of the Hamiltonian cycles of a...
Sensitivity analysis for symmetric 2-Peripatetic Salesman Problems
Sensitivity analysis for symmetric 2-Peripatetic Salesman Problems
1993,
A greedy approach can be applied to find 2 edge-disjoint 1-trees or spanning trees (if...
Heuristics for the minimum Hamiltonian cycle problem. Part II: Partitioning heuristics for symmetric large scale graphs and guaranteed performance for the MinMax version
Heuristics for the minimum Hamiltonian cycle problem. Part II: Partitioning heuristics for symmetric large scale graphs and guaranteed performance for the MinMax version
1992,
This and a companion paper (Part I) describe the main heuristics for the symmetric...
Exact and heuristic procedures for the Traveling Salesman Problem with Precedence Constraints, based on dynamic programming
Exact and heuristic procedures for the Traveling Salesman Problem with Precedence Constraints, based on dynamic programming
1994,
The Traveling Salesman Problem with Precedence Constraints is to find an hamiltonian...
Precedence constrained TSP applied to circuit board assembly and no wait flowshop
Precedence constrained TSP applied to circuit board assembly and no wait flowshop
1993,
The travelling salesman problem formulation is extended to allow precedence...
A distributed exact algorithm for the Multiple Resource Constrained Sequencing Problem
A distributed exact algorithm for the Multiple Resource Constrained Sequencing Problem
1993,
Sequencing problems arise in the context of process scheduling both in isolation and...
Improving the performance of an X-ray diffractometer
Improving the performance of an X-ray diffractometer
1989,
X-ray diffractometers are widely used by crystallographers in the study of the atomic...
Tour construction algorithm for the capacitated arc routing problems
Tour construction algorithm for the capacitated arc routing problems
1992,
In this paper, the authors consider an exact algorithm for the capacitated arc routing...
A survey of algorithms for location-routing problems
A survey of algorithms for location-routing problems
1989,
Location-routing problems involve simultaneously locating a number of facilities among...
Papers per page: