Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
type: Item
instance of: scholarly article
title: Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
zbMATH Open document ID: 1208.90139
author: Tatiana Bassetto
author: Francesco Mason
published in: European Journal of Operational Research
publication date: 2011-01-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5842698
zbMATH Keywords: period routing problem
zbMATH Keywords: logistics
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.09.008
OpenAlex ID: W2027901711
cites work: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
cites work: A multi-period TSP with stochastic regular and urgent demands
cites work: Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
cites work: Competitive analysis for dynamic multiperiod uncapacitated routing problems
cites work: Q3425132
cites work: Q4349101
cites work: A period vehicle routing case study
cites work: An improved heuristic for the period traveling salesman problem
cites work: The two-period travelling salesman problem applied to milk collection in Ireland
cites work: A new heuristic for the period traveling salesman problem
cites work: The period routing problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A Heuristic for the Periodic Vehicle Routing Problem
cites work: A heuristic for the periodic rural postman problem
cites work: A variable neighborhood search heuristic for periodic routing problems
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Q5187226
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Geometric Approaches to Solving the Traveling Salesman Problem
cites work: A multiperiod traveling salesman problem: Heuristic algorithms
cites work: The period traveling salesman problem: A new heuristic algorithm
cites work: Solving the asymmetric traveling salesman problem with periodic constraints
DOI: 10.1016/J.EJOR.2010.09.008
description: scientific article; zbMATH DE number 5842698