Improving a constructive heuristic for the general routing problem

DOI10.1002/net.22119zbMath1529.90063OpenAlexW4287147549MaRDI QIDQ6179705

Thu Huong Dang, Adam N. Letchford, Burak Boyacı

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/172027/1/GRP_heuristic.pdf

zbMATH Keywords

heuristicscombinatorial optimizationvehicle routingarc routing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact formulations of the Steiner traveling salesman problem and related problems
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Heuristics for the rural postman problem
• A cutting plane procedure for the travelling salesman problem on road networks
• An approximation algorithm for the general routing problem
• A polyhedral approach to the rural postman problem
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
• A branch-and-cut algorithm for the undirected rural postman problem
• Algorithms for the rural postman problem
• The Steiner traveling salesman problem and its extensions
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
• A constructive heuristic for the undirected rural postman problem
• On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
• The traveling salesman problem on a graph and some related integer polyhedra
• On general routing problems
• A fundamental problem in vehicle routing
• Approximation Algorithms for Some Postman Problems
• Improvement Procedures for the Undirected Rural Postman Problem
• Data Structures for Weighted Matching and Extensions to b -matching and f -factors
• A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
• Matching, Euler tours and the Chinese postman
• Fibonacci heaps and their uses in improved network optimization algorithms
• A branch & cut algorithm for the windy general routing problem and special cases
• Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
• Maximum matching and a polyhedron with 0,1-vertices
• Combinatorial optimization. Theory and algorithms
• A cutting plane algorithm for the general routing problem
• A note on computational aspects of the Steiner traveling salesman problem

This page was built for publication: Improving a constructive heuristic for the general routing problem