Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs

DOI10.1016/J.EJOR.2010.09.008zbMath1208.90139OpenAlexW2027901711MaRDI QIDQ621695

Tatiana Bassetto, Francesco Mason

Publication date: 28 January 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.008

zbMATH Keywords

logisticsperiod routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Nested simulated annealing approach to periodic routing problem of a retail distribution system ⋮ Exact algorithms for the equitable traveling salesman problem ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• Heuristic algorithms for the multiple knapsack problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• A multiperiod traveling salesman problem: Heuristic algorithms
• The two-period travelling salesman problem applied to milk collection in Ireland
• The period traveling salesman problem: A new heuristic algorithm
• A period vehicle routing case study
• A heuristic for the periodic rural postman problem
• An improved heuristic for the period traveling salesman problem
• A new heuristic for the period traveling salesman problem
• A variable neighborhood search heuristic for periodic routing problems
• A multi-period TSP with stochastic regular and urgent demands
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• The period routing problem
• A Heuristic for the Periodic Vehicle Routing Problem
• Geometric Approaches to Solving the Traveling Salesman Problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Solving the asymmetric traveling salesman problem with periodic constraints
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs