A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows

DOI10.1016/j.endm.2010.05.041zbMath1237.90187OpenAlexW2091180805MaRDI QIDQ2883579

H. Murat Afsar

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.041

zbMATH Keywords

column generationcapacitated arc routingflexible time windows

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

An efficiency-based path-scanning heuristic for the capacitated arc routing problem, A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, Arc routing problems: A review of the past, present, and future, The windy rural postman problem with a time-dependent zigzag option

Cites Work

• Unnamed Item
• Arc routing problems with time-dependent service costs
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Routing with time windows by column generation
• Capacitated arc routing problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems