Keyword: programming: travelling salesman

Found 410 papers in total
Bounding, filtering and diversification in CP‐based local branching
Bounding, filtering and diversification in CP‐based local branching
2012,
Local branching is a general purpose heuristic method which searches locally around...
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
2012,
Constant‐factor, polynomial‐time approximation algorithms are presented...
On dominance‐based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
On dominance‐based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
2012,
This paper discusses simple local search approaches for approximating the efficient...
An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities
An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities
2012,
Transportation projects are generally large, with limited resources and highly...
Lower tolerance‐based Branch and Bound algorithms for the ATSP
Lower tolerance‐based Branch and Bound algorithms for the ATSP
2012,
In this paper, we develop a new tolerance‐based Branch and Bound algorithm for...
New Algorithms for Disk Scheduling
New Algorithms for Disk Scheduling
2002,
Processor speed and memory capacity are increasing several times faster than disk...
An Integer Linear Programming based heuristic for the Capacitated m‐Ring‐Star Problem
An Integer Linear Programming based heuristic for the Capacitated m‐Ring‐Star Problem
2012,
We address the Capacitated m‐Ring‐Star Problem in which the aim is to...
A metaheuristic for a teaching assistant assignment‐routing problem
A metaheuristic for a teaching assistant assignment‐routing problem
2012,
The Flemish Ministry of Education promotes the integrated education of disabled...
A study on the effect of the asymmetry on real capacitated vehicle routing problems
A study on the effect of the asymmetry on real capacitated vehicle routing problems
2012,
Matrices with distances between pairs of locations are essential for solving vehicle...
The Traveling Salesman Problem with Draft Limits
The Traveling Salesman Problem with Draft Limits
2012,
In maritime transportation, routing decisions are sometimes affected by draft limits...
The effect of the asymmetry of road transportation networks on the traveling salesman problem
The effect of the asymmetry of road transportation networks on the traveling salesman problem
2012,
The routing of vehicles on road transportation networks is an area of great importance...
Algorithms for the On‐Line Travelling Salesman
Algorithms for the On‐Line Travelling Salesman
2001,
In this paper the problem of efficiently serving a sequence of requests presented in...
Combinatorial Optimization by Dynamic Contraction
Combinatorial Optimization by Dynamic Contraction
1997,
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an...
A framework for analyzing sub‐optimal performance of local search algorithms
A framework for analyzing sub‐optimal performance of local search algorithms
2011,
This paper presents a framework for analyzing and comparing sub‐optimal...
A heterogeneous cooperative parallel search of branch‐and‐bound method and tabu search algorithm
A heterogeneous cooperative parallel search of branch‐and‐bound method and tabu search algorithm
2011,
In this study, we present a heterogeneous cooperative parallel search that integrates...
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
2011,
In this paper, we first present a binary linear programming formulation for the...
Layout and control policies for cross docking operations
Layout and control policies for cross docking operations
2011,
Many supply chains strive to shorten the time between a customer’s order and the...
A Branch‐and‐Cut Algorithm Using a Strong Formulation and an A Priori Tour‐Based Heuristic for an Inventory‐Routing Problem
A Branch‐and‐Cut Algorithm Using a Strong Formulation and an A Priori Tour‐Based Heuristic for an Inventory‐Routing Problem
2011,
We address a vendor‐managed inventory‐routing problem where a supplier...
A multi‐round generalization of the traveling tournament problem and its application to Japanese baseball
A multi‐round generalization of the traveling tournament problem and its application to Japanese baseball
2011,
In a double round‐robin tournament involving n teams, every team plays 2( n...
A statistical analysis of parameter values for the rank‐based ant colony optimization algorithm for the traveling salesperson problem
A statistical analysis of parameter values for the rank‐based ant colony optimization algorithm for the traveling salesperson problem
2011,
Ant colony optimization (ACO) is a metaheuristic for solving combinatorial...
A hybrid simulation‐optimization algorithm for the Hamiltonian cycle problem
A hybrid simulation‐optimization algorithm for the Hamiltonian cycle problem
2011,
In this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by...
Charlemagne's Challenge: The Periodic Latency Problem
Charlemagne's Challenge: The Periodic Latency Problem
2011,
Latency problems are characterized by their focus on minimizing the waiting time for...
Very large street routing problem with mixed transportation mode
Very large street routing problem with mixed transportation mode
2011,
Providers of logistic services in recent years are under a big pressure to lower their...
The Directed Orienteering Problem
The Directed Orienteering Problem
2011,
This paper studies vehicle routing problems on asymmetric metrics. Our starting point...
Papers per page: