Modeling and solving the mixed capacitated general routing problem

DOI10.1007/S11590-012-0552-YMaRDI QIDQ375984zbMATH OpenOpenAlexFDO

Authors Adamo Bosco, Demetrio Laganà, Roberto Musmanno, 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

mixed graphrelaxationrouting problemseparation algorithm

Mathematics Subject Classification ID

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

Recommendations

• Two-phase branch-and-cut for the mixed capacitated general routing problem
• Lower bounds for the mixed capacitated arc routing problem
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• scientific article; zbMATH DE number 2108935
• A capacitated general routing problem on mixed networks

Cites work

• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 2108935 (Why is no real title available?)
• 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
• A capacitated general routing problem on mixed networks
• A cutting plane algorithm for the capacitated arc routing problem
• A cutting plane algorithm for the general routing problem
• A fundamental problem in vehicle routing
• An improved heuristic for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Lower bounds for the mixed capacitated arc routing problem
• New Results on the Mixed General Routing Problem
• New inequalities for the general routing problem
• Odd Minimum Cut-Sets and b-Matchings
• On general routing problems
• Recent results on arc routing problems: an annotated bibliography
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• The capacitated arc routing problem: Valid inequalities and facets
• The feasibility pump
• The general routing polyhedron: A unifying framework
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• The mixed general routing polyhedron
• The vehicle routing problem. Latest advances and new challenges.
• Transforming arc routing into node routing problems

Cited in

(27)

• The mixed capacitated general routing problem under uncertainty
• The periodic rural postman problem with irregular services on mixed graphs
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• The multidepot drone general routing problem with duration and capacity constraints
• Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
• A transformation for the mixed general routing problem with turn penalties
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• An updated annotated bibliography on arc routing problems
• Arc routing problems: A review of the past, present, and future
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• scientific article; zbMATH DE number 2108935 (Why is no real title available?)
• Optimally solving the joint order batching and picker routing problem
• New Results on the Mixed General Routing Problem
• Ten years of feasibility pump, and counting
• The undirected capacitated general routing problem with profits
• The bi-objective mixed capacitated general routing problem with different route balance criteria
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
• A dynamic multi-period general routing problem arising in postal service and parcel delivery systems
• A capacitated general routing problem on mixed networks
• Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
• A parameterized lower bounding method for the open capacitated arc routing problem
• scientific article; zbMATH DE number 6913886 (Why is no real title available?)
• Combined route capacity and route length models for unit demand vehicle routing problems
• Profitable mixed capacitated arc routing and related problems
• The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
• A multi-stop routing problem

Describes a project that uses

Uses Software

• CBMix
• FEASPUMP

This page was built for publication: Modeling and solving the mixed capacitated general routing problem

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