Keyword: programming: travelling salesman

Found 410 papers in total
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
2015,
The double traveling salesman problem with multiple stacks consists in determining a...
The selective pickup and delivery problem: Formulation and a memetic algorithm
The selective pickup and delivery problem: Formulation and a memetic algorithm
2013,
The pickup and delivery problem addresses the real‐world issues in logistic...
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor
2014,
We consider the construction of sparse covers for planar graphs and other graphs that...
Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production
Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production
2012,
This study deals with industrial processes that produce soft drink bottles in...
The two-machine no-wait general and proportionate open shop makespan problem
The two-machine no-wait general and proportionate open shop makespan problem
2014,
We consider the two‐machine no‐wait open shop minimum makespan problem...
Modeling and optimization of a container drayage problem with resource constraints
Modeling and optimization of a container drayage problem with resource constraints
2011,
This paper investigates the problem faced by firms that transport containers by truck...
Clustering of search trajectory and its application to parameter tuning
Clustering of search trajectory and its application to parameter tuning
2013,
This paper is concerned with automated classification of Combinatorial Optimization...
A note on the separation of subtour elimination constraints in elementary shortest path problems
A note on the separation of subtour elimination constraints in elementary shortest path problems
2013,
This note proposes an alternative procedure for identifying violated subtour...
New exact method for large asymmetric distance‐constrained vehicle routing problem
New exact method for large asymmetric distance‐constrained vehicle routing problem
2013,
In this paper we revise and modify an old branch‐and‐bound method for...
A Branch‐and‐Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
A Branch‐and‐Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
2013,
The double traveling salesman problem with multiple stacks is a variant of the pickup...
Variable neighborhood search for the travelling deliveryman problem
Variable neighborhood search for the travelling deliveryman problem
2013,
A travelling deliveryman needs to find a tour such that the total waiting time of all...
Flexible weekly tour scheduling for postal service workers using a branch and price
Flexible weekly tour scheduling for postal service workers using a branch and price
2013,
This paper addresses the problem of flexible shift scheduling of service employees at...
Investigating the use of metaheuristics for solving single vehicle routing problems with time‐varying traversal costs
Investigating the use of metaheuristics for solving single vehicle routing problems with time‐varying traversal costs
2013,
Metaheuristic algorithms, such as simulated annealing and tabu search, are popular...
Computing the variance of tour costs over the solution space of the TSP in polynomial time
Computing the variance of tour costs over the solution space of the TSP in polynomial time
2012,
We give an O ( n 2 ) time algorithm to find the population variance of tour costs over...
Bi‐directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
Bi‐directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
2000,
In this paper we study bi‐directional nearness in a network based on AHP...
Are Stacker Crane Problems easy? A statistical study
Are Stacker Crane Problems easy? A statistical study
2013,
Many full truckload pick‐up and delivery problems in the intermodal freight...
Efficient approximation algorithms for the routing open shop problem
Efficient approximation algorithms for the routing open shop problem
2013,
We consider the routing open shop problem being a generalization of two classical...
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
A Generic Branch‐and‐Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
2012,
This paper describes a generic branch‐and‐cut algorithm applicable to...
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
2011,
In this paper we deal with the preemptive asymmetric stacker crane problem in a...
On the maximum TSP with γ‐parameterized triangle inequality
On the maximum TSP with γ‐parameterized triangle inequality
2012,
The maximum TSP with γ ‐parameterized triangle inequality is defined as...
A Path Relinking approach for the Team Orienteering Problem
A Path Relinking approach for the Team Orienteering Problem
2010,
This paper introduces a Path Relinking metaheuristic approach for solving the Team...
Scheduling healthcare services in a home healthcare system
Scheduling healthcare services in a home healthcare system
2012,
We consider a scheduling problem in a home healthcare system in which nurses visit...
Fuzzy Multi‐objective Linear Programming Approach
Fuzzy Multi‐objective Linear Programming Approach
2007,
Traveling salesman problem (TSP) is one of the challenging real‐life problems,...
Approximation algorithms for multiple terminal, Hamiltonian path problems
Approximation algorithms for multiple terminal, Hamiltonian path problems
2012,
This article presents a new 2‐approximation algorithm for a multiple depot,...
Papers per page: