Exact and heuristic algorithms for routing AGV on path with precedence constraints

DOI10.1155/2016/5040513zbMath1400.90313OpenAlexW2478131665WikidataQ59131464 ScholiaQ59131464MaRDI QIDQ1793242

Liang Xu, Lin Liu, Jiaxing Wang, Yao Wang

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/5040513

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Uses Software

• TSPTW

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
• The travelling salesman problem on permuted Monge matrices
• The Convex-hull-and-k-line Travelling Salesman Problem
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• Survey of research in the design and control of automated guided vehicle systems
• A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
• A Hybrid Exact Algorithm for the TSPTW
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Exact and heuristic algorithms for routing AGV on path with precedence constraints