Keyword: programming: travelling salesman

Found 410 papers in total
A partheno-genetic algorithm for solving the degree-constrained minimum spanning tree problem
2005,
In this paper, a partheno-genetic algorithm for solving the degree-constrained minimum...
A review of traveling salesman problem based approaches for flowshop scheduling
2006,
Contemporary flowshops that are variants of the classical flowshop frequently pose...
Scheduling and lot streaming in two-machine open shops with no-wait in process
2005,
We study the problem of minimizing the makespan in no-wait two-machine open shops...
A note on relatives to the Held and Karp 1-tree problem
2006,
We study a class of graph problems which includes as special cases the Held and Karp...
A tabu search heuristic for the single vehicle pickup and delivery problem with time windows
2001,
The single vehicle pickup and delivery problem with time windows is a generalization...
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
2006,
This article analyzes the performance of metaheuristics on the vehicle routing problem...
Cluster-level operations planning for the out-of-position robotic arc-welding
2006,
Recent advances in computer vision and arc-welding technology have motivated a...
The competitive salesman problem on a network: a worst-case approach
2006,
We provide a complexity analysis of the problem of optimal routing of a server on a...
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
2005,
We present a short overview on polynomial approximation of NP-hard problems. We...
Rank-based ant colony optimization applied to dynamic traveling salesman problems
2005,
This study proposes a rank-based colony optimization (ACO) of method with a rank-based...
A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
2005,
This paper presents an empirical study on the efficiency of the simulated annealing...
Ant colony system for a dynamic vehicle routing problem
2005,
An abundant literature on vehicle routing problems is available. However, most of the...
Scheduling a professional sports league in Microsoft® Excel: Showing students the value of good modeling and solution techniques
2004,
Scheduling a sports league to minimize travel is a notoriously difficult task...
Efficient heuristics for the rural postman problem
2005,
A local search framework for the (undirected) Rural Postman Problem (RPP) is presented...
Design of unidirectional cyclic layouts
2005,
This work is concerned with the unidirectional cyclic layout problem, which is known...
A note on postman problems with zigzag service
2005,
This note presents a generalization of postman problems with more flexibility of...
Container movement by trucks in metropolitan networks: modeling and optimization
2005,
Container movement by trucks with time constraints at origins and destinations is...
A travelling saleman Problem–Genetic Algorithm multi-objective algorithm for flow-shop scheduling
2004,
A multi-objective evolutionary search algorithm using a travelling salesman algorithm...
Online recoverable Canadian traveler problem on a continuous network
2004,
The online Recoverable Canadian Traveler Problem is considered for the case when the...
Record breaking optimization results using the ruin and recreate principle
2000,
A new optimization principle is presented. Solutions of problems are partly, but...
Solving a circle permutation problem with ant colony-simulated annealing algorithm
2004,
The circle permutation problem is translated into a traveling salesman problem (TSP)...
A branch-and-cut algorithm for the median-path problem
2005,
The Median-Path problem consists of locating an st -path on a network, minimizing a...
The a priori dynamic traveling salesman problem with time windows
2004,
In this paper we examine the traveling salesman problem with time windows for various...
An improved upper bound for the traveling salesman problem in cubic 3-edge-connected graphs
2005,
We consider the traveling salesman problem (TSP) on (the metric completion of)...
Papers per page: