Profitable mixed capacitated arc routing and related problems

DOI10.1007/s11750-014-0336-xzbMath1312.90012OpenAlexW2028844056MaRDI QIDQ2343077

Enrique Benavent, Maria Cândida Mourão, Angel Corberán, Leonor Santiago Pinto, Luís Gouveia

Publication date: 4 May 2015

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-014-0336-x

zbMATH Keywords

routingprofitsarc routing problemsflow-based models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

A branch-and-cut algorithm for the profitable windy rural postman problem, Multi-vehicle prize collecting arc routing for connectivity problem, The profitable close-enough arc routing problem, Arc routing problems: A review of the past, present, and future, Arc routing for parking enforcement officers: exact and heuristic solutions

Uses Software

• CPLEX
• VRP

Cites Work

• A matheuristic for the team orienteering arc routing problem
• Local search for the undirected capacitated arc routing problem with profits
• The orienteering problem: a survey
• The undirected capacitated arc routing problem with profits
• Lower bounds for the mixed capacitated arc routing problem
• Solving the prize-collecting rural postman problem
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• Alternative formulations for a layout problem in the fashion industry
• New results on the windy postman problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Privatized rural postman problems
• The Vehicle Routing Problem
• The Bounded Cycle-Cover Problem
• Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
• Min-Max K -vehicles windy rural postman problem
• Improving Discrete Model Representations via Symmetry Considerations
• The Capacitated Arc Routing Problem: Lower bounds
• Improvement Procedures for the Undirected Rural Postman Problem
• New Results on the Mixed General Routing Problem
• Approximate solutions for the maximum benefit chinese postman problem