An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
From MaRDI portal
Publication:1761166
DOI10.1016/j.cor.2011.12.009zbMath1251.90051OpenAlexW1999260692WikidataQ58921233 ScholiaQ58921233MaRDI QIDQ1761166
Demetrio Laganà, Ornella Pisacane, Francesca Guerriero, Lucio Grandinetti
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
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times ⋮ Modelling the mobile target covering problem using flying drones ⋮ An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ 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 ⋮ 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 ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An exact \(\epsilon\)-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
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- The capacitated arc routing problem: Valid inequalities and facets
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- New lower bound for the capacitated arc routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- Decomposing Mom Matrix To Sparse Matrices for Wire Antennas and Wire Scattering By Mei Method
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A Decade of Capacitated Arc Routing
- Capacitated arc routing problems
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- The Capacitated Arc Routing Problem: Lower bounds
- On general routing problems
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
