The commodity-split multi-compartment capacitated arc routing problem
From MaRDI portal
Publication:2664322
DOI10.1016/j.cor.2020.104994zbMath1458.90155OpenAlexW3025737531MaRDI QIDQ2664322
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104994
arc routingmatheuristicwaste collectiondata-drivencommodity-split multi-compartment capacitated arc routing problem
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The consistent vehicle routing problem with heterogeneous fleet, Arc routing with trip-balancing and attractiveness measures -- a waste collection case study, Arc routing problems: A review of the past, present, and future, Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-compartment vehicle routing problem with flexible compartment sizes
- Thirty years of heterogeneous vehicle routing
- A hybrid metaheuristic approach for the capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
- Vehicle routing with compartments: applications, modelling and heuristics
- Competitive memetic algorithms for arc routing problems
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Solving a fuel delivery problem by heuristic and exact approaches.
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Tour splitting algorithms for vehicle routing problems
- Capacitated arc routing problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- Approximation Algorithms for Some Postman Problems
- A heuristic column generation method for the heterogeneous fleet VRP
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- New large-scale data instances for CARP and new variations of CARP
