Solving symmetric vehicle routing problems asymmetrically

DOI10.1016/0377-2217(83)90160-1zbMath0497.90074OpenAlexW2059399761MaRDI QIDQ1171005

P. H. van Leeuwen, A. Volgenant

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90160-1

zbMATH Keywords

vehicle routingtraveling salesman problemcomputational resultsheuristic algorithmadditional constraintsassignment relaxationsasymmetric transformed distance matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items

The \(k\)-dissimilar vehicle routing problem, A symmetry-free polynomial formulation of the capacitated vehicle routing problem, On dual solutions of the linear assignment problem

Uses Software

• VRP

Cites Work

• Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms