Keyword: programming: travelling salesman
Crane scheduling in railway yards: an analysis of computational complexity
An efficient container transfer in railway yards is an important matter to increase...
The home health care problem with working regulations
Due to the geographically dispersed locations of their clients, home health care...
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
We consider the problem of constructing optimal decision trees: given a collection of...
Approximating the length of Chinese postman tours
This article develops simple and easy‐to‐use approximation formulae for...
Multi-depot rural postman problems
This paper studies multi‐depot rural postman problems on an undirected graph....
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
Recent papers on approximation algorithms for the traveling salesman problem (TSP)...
A general variable neighborhood search variants for the travelling salesman problem with draft limits
In this paper, we present two general variable neighborhood search (GVNS) based...
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
We present a randomized O (log n /log log n )‐approximation algorithm for the...
Adaptive large neighborhood search algorithm for the rural postman problem with time windows
The rural postman problem with time windows is the problem of serving some required...
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems
Crainic Teodor Gabriel
We present the symmetric traveling salesman problem with generalized latency...
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
In a single local search algorithm, several neighborhood structures are usually...
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
The multivehicle covering tour problem (m‐CTP) is a transportation problem with...
A Two-Phase Iterative Heuristic Approach for the Production Routing Problem
This paper investigates the integrated optimization of production, distribution, and...
A novel GRASP solution approach for the Orienteering Problem
The Orienteering Problem (OP) is a well‐known variant of the Traveling Salesman...
Finding optimal tour schedules on transportation paths under extended time window constraints
This paper addresses time‐critical routing on a given path under release dates...
Household-Level Economies of Scale in Transportation
Carlsson John Gunnar
One of the fundamental concerns in the analysis of logistical systems is the...
An interactive approach for biobjective integer programs under quasiconvex preference functions
We develop an interactive algorithm for biobjective integer programs that finds the...
A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem
In this paper, we study a k‐Travelling Repairmen Problem where the objective is...
Crystal Energy Optimization Algorithm
Nature has always been a muse for those who dream in art or science. As it goes,...
Memetic Algorithm based on Improved Inver‐over operator and Lin‐Kernighan local search for the Euclidean traveling salesman problem
In this study, an Improved Inver–over operator is proposed to solve the...
Transformations of node-balanced routing problems
This article describes a polynomial transformation for a class of unit‐demand...
Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
The vehicle routing problem with stochastic demands and customers (VRPSDC) requires...
An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
This article presents an exact algorithm for the precedence‐constrained...
Continuity of care in community midwifery
Continuity of care is often critical in delivering high quality health care. However,...
Papers per page: