An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem

DOI10.1016/J.COR.2011.12.009MaRDI QIDQ1761166zbMATH OpenOpenAlexWikidataFDO

Authors Lucio Grandinetti, Francesca Guerriero, Demetrio Laganà, Ornella Pisacane

Publication date 15 November 2012

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.12.009

zbMATH Keywords

arc routing problemshybrid heuristic algorithmmulti-objective combinatorial optimization

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1975105
• A genetic algorithm for a bi-objective capacitated arc routing problem
• New upper bounds for the multi-depot capacitated arc routing problem
• The open capacitated arc routing problem
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem

Cites work

• A cutting plane algorithm for the capacitated arc routing problem
• A decade of capacitated arc routing
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A genetic algorithm for a bi-objective capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• An improved heuristic for the capacitated arc routing problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Capacitated arc routing problems
• Competitive memetic algorithms for arc routing problems
• Decomposing MoM matrix to sparse matrices for wire antennas and wire scatterings by MEI method
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• scientific article; zbMATH DE number 3833720 (Why is no real title available?)
• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1568940 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 232390 (Why is no real title available?)
• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• Lower and upper bounds for the mixed capacitated arc routing problem
• Multi-objective optimization using evolutionary algorithms
• New lower bound for the capacitated arc routing problem
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• On general routing problems
• Solving capacitated arc routing problems using a transformation to the CVRP
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem: Valid inequalities and facets

Cited in

(16)

• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• A guided local search procedure for the multi-compartment capacitated arc routing problem
• An artificial bee colony approach for the undirected capacitated arc routing problem with profits
• Modelling the mobile target covering problem using flying drones
• The bi-objective mixed capacitated general routing problem with different route balance criteria
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
• An improved multi-objective framework for the rich arc routing problem
• Arc routing problems: A review of the past, present, and future
• Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems
• An updated annotated bibliography on arc routing problems
• A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times

This page was built for publication: An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem

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