Keyword: programming: travelling salesman

Found 410 papers in total
Flow shop no-wait scheduling with sequence dependent setup times and release dates
1999,
We consider the problem of scheduling no-wait jobs, with release dates and sequence...
The General Routing Problem polyhedron: Facets from the Rural Postman Problem and Graphical Traveling Salesman Problem polyhedra
1998,
In this paper we study the polyhedron associated with the General Routing Problem...
Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
1998,
The potential of Genetic Algorithmic (GA) approaches for solving order-based problems...
Heuristics for the flow line problem with setup costs
1998,
This paper presents two new heuristics for the flowshop scheduling problem with...
The Hot Strip Mill Production Scheduling Problem: A Tabu Search approach
1998,
The Hot Strip Mill Production Scheduling Problem is a hard problem that arises in the...
A model for warehouse order picking
1998,
Order picking in conventional warehouse environments involves determining a sequence...
Heuristics approach to printed circuit board insertion problem
1998,
This paper studies the operation of a surface mount technology (SMT) machine which...
A tiling and routing heuristic for the screening of cytological samples
1998,
In the screening of cytological samples, a slide is examined using a microscope. Since...
Improved solutions for the traveling purchaser problem
1998,
The traveling purchaser problem (TPP) is an interesting generalization of the...
Linear programs for constraint satisfaction problems
1997,
A novel representation is described that models some important NP-hard problems, such...
A TSP-based heuristic for forming machine groups and part families
1998,
Cellular manufacturing has been proposed as a layout approach to improve manufacturing...
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
1998,
This paper presents a branch-and-cut (B&C) algorithm for the problem of minimizing...
Application of traveling salesman problem for decision of optimal production sequence
1997,
In the present study a reliable and structural decision system for production sequence...
Efficiently solvable special cases of hard combinatorial optimization problems
1997,
We survey some recent advances in the field of polynomially solvable special cases of...
Practical aspects of route planning for magazine and newspaper wholesalers
1996,
The complex distribution problem of magazine and newspaper wholesalers is an ideal...
Generalized bilinear programming: An application in farm management
1996,
In this paper we analyze a model which arises from considering manure and fertilizer...
On the core of routing games
1997,
A repairman makes a round-trip along a set of customers. He starts in his home...
On approximately fair cost allocation in Euclidean TSP games
1998,
We consider the problem of allocating the cost of an optimal traveling salesman tour...
Routing helicopters for crew exchanges on off-shore locations
1998,
This paper deals with a vehicle routing problem with split demands, namely the problem...
The team orienteering problem
1996,
In the team orienteering problem, start and end points are specified along with other...
A fast and effective heuristic for the orienteering problem
1996,
In the orienteering problem, start and end points are specified along with other...
Mechanisms for local search
1996,
Local search methods for combinatorial optimization make a series of steps, at each...
An effective tour construction and improvement procedure for the traveling salesman problem
1995,
This paper presents an effective neighborhood structure for the traveling salesman...
Papers per page: