Branch-price-and-cut for the mixed capacitated general routing problem with time windows
From MaRDI portal
Publication:1754228
DOI10.1016/j.ejor.2017.11.039zbMath1403.90094OpenAlexW2768187667MaRDI QIDQ1754228
Francesca Vocaturo, Claudio Ciancio, Demetrio Laganà
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.11.039
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (8)
A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ Arc routing under uncertainty: introduction and literature review ⋮ 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 ⋮ Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ Arc-routing for winter road maintenance ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient elementary and restricted non-elementary route pricing
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A branch-price-and-cut algorithm for multi-mode resource leveling
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- A lower bound for the node, edge, and arc routing problem
- Modeling and solving the mixed capacitated general routing problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Arc routing problems with time-dependent service costs
- Exact algorithms for routing problems under vehicle capacity constraints
- Stabilized column generation
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- The undirected capacitated general routing problem with profits
- Recent advances in memetic algorithms.
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- Interior point stabilization for column generation
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A Decade of Capacitated Arc Routing
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Exact solution of the generalized routing problem through graph transformations
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
This page was built for publication: Branch-price-and-cut for the mixed capacitated general routing problem with time windows
