Modeling and solving the mixed capacitated general routing problem

DOI10.1007/s11590-012-0552-yzbMath1280.90008OpenAlexW2083681781MaRDI QIDQ375984

Roberto Musmanno, Adamo Bosco, Demetrio Laganà, Francesca Vocaturo

Publication date: 1 November 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0552-y

zbMATH Keywords

relaxationrouting problemmixed graphseparation algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items

The mixed capacitated general routing problem under uncertainty ⋮ An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ Optimally solving the joint order batching and picker routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ The undirected capacitated general routing problem with profits ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm ⋮ Ten years of feasibility pump, and counting

Uses Software

• FEASPUMP
• CBMix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem. Latest advances and new challenges.
• An improved heuristic for the capacitated arc routing problem
• Lower bounds for the mixed capacitated arc routing problem
• New inequalities for the general routing problem
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• The capacitated arc routing problem: Valid inequalities and facets
• The mixed general routing polyhedron
• The general routing polyhedron: A unifying framework
• Transforming arc routing into node routing problems
• A cutting plane algorithm for the capacitated arc routing problem
• A capacitated general routing problem on mixed networks
• Lower and upper bounds for the mixed capacitated arc routing problem
• The feasibility pump
• Recent results on Arc Routing Problems: An annotated bibliography
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• Odd Minimum Cut-Sets and b-Matchings
• On general routing problems
• A fundamental problem in vehicle routing
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A branch & cut algorithm for the windy general routing problem and special cases
• New Results on the Mixed General Routing Problem
• A cutting plane algorithm for the general routing problem