An improved multi-objective framework for the rich arc routing problem

DOI10.1016/j.cor.2023.106345MaRDI QIDQ6047893

No author found.

Publication date: 13 September 2023

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

zbMATH Keywords

multi-objective optimizationperiodicintermediate facilitieslength restrictionsrich arc routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Preference-inspired co-evolutionary algorithms using weight vectors
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The fleet size and mix problem for capacitated arc routing
• The fleet size and mix vehicle routing problem
• Routeing winter gritting vehicles
• The generalized arc routing problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Evolutionary algorithms for periodic arc routing problems
• A guided local search heuristic for the capacitated arc routing problem
• The periodic capacitated arc routing problem with irregular services
• A matheuristic for the distance-constrained close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
• A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• A genetic algorithm for a bi-objective capacitated arc routing problem
• A scatter search for the periodic capacitated arc routing problem
• The capacitated arc routing problem with intermediate facilities
• Solving the close-enough arc routing problem
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• The stochastic close-enough arc routing problem
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
• Use of Ranks in One-Criterion Variance Analysis

This page was built for publication: An improved multi-objective framework for the rich arc routing problem