A branch-and-price algorithm for capacitated arc routing problem with flexible time windows

DOI10.1016/J.ENDM.2010.05.041MaRDI QIDQ2883579zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• Cut-first branch-and-price-second for the capacitated arc-routing problem
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem

Cites work

• scientific article; zbMATH DE number 1568942 (Why is no real title available?)
• 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
• Arc routing problems with time-dependent service costs
• Branch-and-price: Column generation for solving huge integer programs
• Capacitated arc routing problems
• Routing with time windows by column generation
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience

Cited in

(7)

• 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
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• The windy rural postman problem with a time-dependent zigzag option
• An updated annotated bibliography on arc routing problems
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Arc routing problems: A review of the past, present, and future

This page was built for publication: A branch-and-price algorithm for capacitated arc routing problem with flexible time windows

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