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

DOI10.1016/J.EJOR.2010.09.008MaRDI QIDQ621695zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An improved heuristic for the period traveling salesman problem
• A multiperiod traveling salesman problem: Heuristic algorithms
• The balanced traveling salesman problem
• The two-period travelling salesman problem applied to milk collection in Ireland
• Approximation algorithms for the Euclidean bipartite TSP

Cites work

• A heuristic for the periodic rural postman problem
• A Heuristic for the Periodic Vehicle Routing Problem
• A multi-period TSP with stochastic regular and urgent demands
• A multiperiod traveling salesman problem: Heuristic algorithms
• A new heuristic for the period traveling salesman problem
• A period vehicle routing case study
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A variable neighborhood search heuristic for periodic routing problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An improved heuristic for the period traveling salesman problem
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Geometric Approaches to Solving the Traveling Salesman Problem
• Heuristic algorithms for the multiple knapsack problem
• scientific article; zbMATH DE number 1047152 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• Solving the asymmetric traveling salesman problem with periodic constraints
• The period routing problem
• The period traveling salesman problem: A new heuristic algorithm
• The traveling salesman problem. A computational study.
• The traveling salesman problem: An overview of exact and approximate algorithms
• The two-period travelling salesman problem applied to milk collection in Ireland

Cited in

(5)

• Exact algorithms for the equitable traveling salesman problem
• Approximation algorithms for the load-balanced capacitated vehicle routing problem
• Nested simulated annealing approach to periodic routing problem of a retail distribution system
• Formulations and branch-and-cut algorithms for the period travelling salesman problem
• A matheuristic and a hybrid algorithm for the asymmetric period travelling salesman problem

Describes a project that uses

Uses Software

• Concorde

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q621695)