Keyword: programming: travelling salesman

Found 410 papers in total
A travelling salesman approach to solve the F/no-idle/Cmax problem
A travelling salesman approach to solve the F/no-idle/Cmax problem
2005,
This paper investigates the F /no-idle/ C max problem, where machines work...
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
2005,
This paper deals with the problem of constructing Hamiltonian paths of optimal weight,...
Bi-directional nearness in a network by analytic hierarchy process and analytic network process
Bi-directional nearness in a network by analytic hierarchy process and analytic network process
2000,
In this paper we study bi-directional nearness in a network based on AHP (Analytical...
Locating median cycles in networks
Locating median cycles in networks
2005,
In the median cycle problem the aim is to determine a simple cycle through a subset of...
Embedded local search approaches for routing optimization
Embedded local search approaches for routing optimization
2005,
This paper presents a new class of heuristics which embed an exact algorithm within...
Evolutionary algorithm for advanced process planning and scheduling in a multi-plant
Evolutionary algorithm for advanced process planning and scheduling in a multi-plant
2005,
Integration of process planning and scheduling is one of the most important functions...
A threshold accepting approach to the Open Vehicle Routing problem
A threshold accepting approach to the Open Vehicle Routing problem
2004,
In this paper we consider the operational planning problem of physical distribution...
Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
2004,
This paper deals with a generalisation of the well-known traveling salesman problem...
An empirical data driven optimization approach by simulating human learning processes
An empirical data driven optimization approach by simulating human learning processes
2004,
This study suggests a data driven optimization approach, which simulates the models of...
Efficient insertion heuristics for vehicle routing and scheduling problems
Efficient insertion heuristics for vehicle routing and scheduling problems
2004,
Insertion heuristics have proven to be popular methods for solving a variety of...
Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times
Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times
2004,
The problem of makespan minimization in a flow shop with two machines when the input...
Binary clutter inequalities for integer programs
Binary clutter inequalities for integer programs
2003,
We introduce a new class of valid inequalities for general integer linear programs,...
Detecting symmetries by branch and cut
Detecting symmetries by branch and cut
2003,
The NP-hard problem of finding symmetries in an abstract graph plays an important role...
Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
2004,
A new heuristic approach for minimizing the operating path of automated or computer...
Vehicle routing in a wood waste pickup system
Vehicle routing in a wood waste pickup system
2004,
In this paper, we analyze a new vehicle routing problem, the Prize Collecting Vehicle...
Solving the continuous flow-shop scheduling problem by metaheuristics
Solving the continuous flow-shop scheduling problem by metaheuristics
2003,
Continuous flow-shop scheduling problems circumscribe an important class of sequencing...
Improved heuristics for the traveling purchaser problem
Improved heuristics for the traveling purchaser problem
2004,
For the Traveling Purchaser Problem we describe improvement subprocedures that can be...
Analysis of a rollout approach to sequencing problems with stochastic routing applications
Analysis of a rollout approach to sequencing problems with stochastic routing applications
2003,
The paper considers sequencing problems, the traveling salesman problem being their...
The Steiner cycle polytope
The Steiner cycle polytope
2003,
This article introduces a new problem called Steiner cycle problem (SCP), closely...
Heterogenous selection genetic algorithms for traveling salesman problems
Heterogenous selection genetic algorithms for traveling salesman problems
2003,
This paper proposes a genetic algorithm, called the heterogeneous selection genetic...
The flow shop scheduling polyhedron with setup times
The flow shop scheduling polyhedron with setup times
2003,
This paper addresses the problem of improving the polyhedral representation of a...
A heuristic approach to the overnight security service problem
A heuristic approach to the overnight security service problem
2003,
This paper introduces the overnight security service problem. The model obtained is a...
Improved genetic algorithm for vehicle routing problem
Improved genetic algorithm for vehicle routing problem
2002,
In this paper, an improved genetic algorithm (IGA) is proposed based on a novel...
Approximation schemes for NP-hard geometric optimization problems: a survey
Approximation schemes for NP-hard geometric optimization problems: a survey
2003,
Traveling Salesman, Steiner Tree, and many other famous genetic optimization problems...
Papers per page: