Splitting a giant tour using integer linear programming

DOI10.1016/J.ENDM.2014.11.032MaRDI QIDQ2631278zbMATH OpenOpenAlexFDO

Authors 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

hybridizationinteger programmingroute first-cluster secondrouting problemsvariable neighborhood search

Mathematics Subject Classification ID

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

Recommendations

• Tour splitting algorithms for vehicle routing problems
• scientific article; zbMATH DE number 2077090
• Solving Large-Scale Tour Scheduling Problems
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• A combined local search and integer programming approach to the traveling tournament problem
• Solving the probabilistic profitable tour problem on a line
• On the tour planning problem
• An approximation algorithm for the traveling tournament problem
• An integer programming model for the weekly tour scheduling problem
• An Optimal Algorithm for the Orienteering Tour Problem

Cites work

• A new polynomial-time algorithm for linear programming
• Integer linear programming formulations of multiple salesman problems and its variations
• Integral boundary points of convex polyhedra
• The vehicle routing problem

Cited in

(1)

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

Describes a project that uses

Uses Software

• GLPK
• Concorde
• VRP

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

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