Arc routing problems with time-dependent service costs

DOI10.1016/J.EJOR.2006.06.028zbMath1121.90031OpenAlexW2060226518MaRDI QIDQ872235

Jean-Yves Potvin, Michel Gendreau, Mariam Tagmouti

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.028

zbMATH Keywords

column generationarc routingresource constraintselementary shortest paths

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (23)

A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows ⋮ A branch-and-bound algorithm for the time-dependent rural postman problem ⋮ Freight railway operator timetabling and engine scheduling ⋮ Solving the time varying postman problems with timed automata ⋮ The traveling salesman problem with time-dependent service times ⋮ The traveling purchaser problem with time-dependent quantities ⋮ Time-dependent routing problems: a review ⋮ Arc routing problems: A review of the past, present, and future ⋮ A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ A Decade of Capacitated Arc Routing ⋮ 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 ⋮ A novel two-phase heuristic method for vehicle routing problem with backhauls ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Shortest path tour problem with time windows ⋮ Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ A time-dependent hierarchical Chinese postman problem ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time ⋮ The time-dependent rural postman problem: polyhedral results

Cites Work

• Routeing winter gritting vehicles
• Transforming arc routing into node routing problems
• Solving capacitated arc routing problems using a transformation to the CVRP
• The capacitated arc routing problem with intermediate facilities
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Capacitated arc routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Arc routing problems with time-dependent service costs