The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
DOI10.1002/net.21984zbMath1527.90032OpenAlexW3084549995MaRDI QIDQ6092639
André Langevin, Unnamed Author, Martin Trépanier
Publication date: 23 November 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21984
metaheuristicmixed capacitated general routing problemroad winter maintenanceslack induction by string removalstime-dependent demands
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- The time-dependent prize-collecting arc routing problem
- A lower bound for the node, edge, and arc routing problem
- Time-dependent routing problems: a review
- Modeling and solving the mixed capacitated general routing problem
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- Arc routing problems with time-dependent service costs
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- The windy rural postman problem with a time-dependent zigzag option
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Vehicle dispatching with time-dependent travel times
- A guided local search heuristic for the capacitated arc routing problem
- Time-constrained Chinese postman problems
- A capacitated general routing problem on mixed networks
- Models and algorithms for the traveling salesman problem with time-dependent service times
- A time-dependent hierarchical Chinese postman problem
- An enhanced lower bound for the time-dependent travelling salesman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- Time dependent vehicle routing problem with a multi ant colony system
- A constraint programming approach to the Chinese postman problem with time windows
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- Use of Ranks in One-Criterion Variance Analysis
- Using constraint-based operators to solve the vehicle routing problem with time windows
This page was built for publication: The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
