A new variant of a vehicle routing problem: Lower and upper bounds

DOI10.1016/S0377-2217(01)00201-6zbMath0992.90083OpenAlexW2066345328MaRDI QIDQ1598727

Holger Glaab

Publication date: 28 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00201-6

zbMATH Keywords

heuristicscombinatorial optimizationmatching algorithminteger linear programfeasible solutions\(m\)-depot vehicle routing problemlaser multiscanner problemminimal direct \(m\)-forest problemsemi-automatic system for cutting leather skins

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Node based compact formulations for the Hamiltonian p‐median problem, A hybrid genetic algorithm for the Hamiltonian p‐median problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized

Uses Software

• TSPLIB

Cites Work

• The Hamiltonian p-median problem
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• The traveling salesman. Computational solutions for RSP applications
• The Hamiltonian \(p\)-median problem
• The nesting problem in the leather manufacturing industry
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item