Keyword: programming: travelling salesman

Found 410 papers in total
Using group theory and transition matrices to study a class of metaheuristic neighborhoods
Using group theory and transition matrices to study a class of metaheuristic neighborhoods
2002,
The one-step conjugative rearrangement neighborhood of all possible incumbent tours in...
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
2002,
The traveling salesman problem (TSP) is a classical combinatorial optimization...
Rotation cycle schedulings for multi-item production systems
Rotation cycle schedulings for multi-item production systems
2001,
Consider the production planning and scheduling on a single machine with finite...
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
2001,
An intuitive solution-doubling argument establishes well known results concerning the...
Optimal routing in an automated storage/retrieval system with dedicated storage
Optimal routing in an automated storage/retrieval system with dedicated storage
1999,
We address the sequencing of requests in an automated storage/retrieval system with...
The laser-plotter beam routing problem
The laser-plotter beam routing problem
2001,
Laser-plotters are used in the manufacturing industry to draw trademarks and...
A cutting plane algorithm for the general routing problem
A cutting plane algorithm for the general routing problem
2001,
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a...
Comparing due-date based performance measures for queueing models
Comparing due-date based performance measures for queueing models
1999,
Queueing models provide a useful tool in designing manufacturing systems amongst...
A tabu search algorithm for the site dependent vehicle routing problem with time windows
A tabu search algorithm for the site dependent vehicle routing problem with time windows
2001,
This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) can be viewed...
Magic labeling in graphs: Bounds, complexity, and an application to a variant of travelling salesman problem
Magic labeling in graphs: Bounds, complexity, and an application to a variant of travelling salesman problem
1996,
Let G be an undirected graph with n vertices and m edges. A natural number λ is...
An improved ant system algorithm for the vehicle routing problem
An improved ant system algorithm for the vehicle routing problem
1999,
The Ant System is a distributed metaheuristic that combines an adaptive memory with a...
The vehicle routing problem with time windows and precedence constraints and its algorithm
The vehicle routing problem with time windows and precedence constraints and its algorithm
2000,
This paper presents the vehicle routing problem with time windows and precedence...
Solving arc routing problems with turn penalties
Solving arc routing problems with turn penalties
2001,
In several arc routing problems, it is necessary to take turn penalties into account...
An optimal algorithm for the mixed Chinese postman problem
An optimal algorithm for the mixed Chinese postman problem
1996,
The Chinese Postman Problem is well solved when the original graph contains only arcs...
Experiences with fine-grained parallel genetic algorithms
Experiences with fine-grained parallel genetic algorithms
1999,
In this paper, we present some results of our systematic studies of fine-grained...
Scheduling tasks on moving executors to minimise the maximum lateness
Scheduling tasks on moving executors to minimise the maximum lateness
2001,
The problem of scheduling tasks on moving executors in complex operation systems with...
An ant colony system hybridized with a new local search for the sequential ordering problem
An ant colony system hybridized with a new local search for the sequential ordering problem
2000,
We present a new local optimizer called SOP-3-exchange for the sequential ordering...
A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems
A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems
1999,
This paper addresses several algorithms based on self-organizing neural network...
A modified subgradient algorithm for Lagrangean relaxation
A modified subgradient algorithm for Lagrangean relaxation
2001,
Despite nonmonotonic properties, weak convergence performance and possible erratic...
A heuristic for the pickup and delivery traveling salesman problem
A heuristic for the pickup and delivery traveling salesman problem
2000,
This paper deals with the pickup and delivery traveling salesman problem. First we...
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
2000,
This paper presents the model, solution method, and system developed and implemented...
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
2000,
The design of effective exact enumerative algorithms for finding the optimal solution...
A path-exchange-type local search algorithm for vehicle routing and its efficient search strategy
A path-exchange-type local search algorithm for vehicle routing and its efficient search strategy
2000,
This paper proposes a fast path-exchange-type local search algorithm for vehicle...
A new heuristic for the traveling salesman problem with time windows
A new heuristic for the traveling salesman problem with time windows
2000,
The aim of this paper is to present a new heuristic method for the Traveling Salesman...
Papers per page: