Splitting a giant tour using integer linear programming

DOI10.1016/j.endm.2014.11.032zbMath1362.90320OpenAlexW1968358827MaRDI QIDQ2631278

Mouaouia Cherif Bouzid

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.032

zbMATH Keywords

integer programmingvariable neighborhood searchrouting problemshybridizationroute first-cluster second

Mathematics Subject Classification ID

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

Related Items (1)

An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem

Uses Software

• GLPK
• Concorde
• VRP

Cites Work

• A new polynomial-time algorithm for linear programming
• Integer linear programming formulations of multiple salesman problems and its variations
• The Vehicle Routing Problem
• Integral Boundary Points of Convex Polyhedra

This page was built for publication: Splitting a giant tour using integer linear programming