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

DOI10.1016/J.COR.2023.106345MaRDI QIDQ6047893zbMATH OpenFDO

Authors

Publication date 13 September 2023

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

Full work available at URL https://doi.org/10.1016/J.COR.2023.106345

zbMATH Keywords

intermediate facilitieslength restrictionsmulti-objective optimizationperiodicrich arc routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• 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 multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
• A genetic algorithm for a bi-objective capacitated arc routing problem
• scientific article; zbMATH DE number 1975105
• New upper bounds for the multi-depot capacitated arc routing problem

Cites work

• A genetic algorithm for a bi-objective capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• 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 scatter search for the periodic capacitated arc routing problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Capacitated arc routing problems
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Cut-first branch-and-price-second for the capacitated arc-routing problem
• Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
• Evolutionary algorithms for periodic arc routing problems
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• scientific article; zbMATH DE number 1703887 (Why is no real title available?)
• scientific article; zbMATH DE number 1975105 (Why is no real title available?)
• Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
• On the distance-constrained close enough arc routing problem
• Preference-inspired co-evolutionary algorithms using weight vectors
• Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm
• Routeing winter gritting vehicles
• Solving the close-enough arc routing problem
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The capacitated arc routing problem with intermediate facilities
• The Capacitated Arc Routing Problem: Lower bounds
• The fleet size and mix problem for capacitated arc routing
• The fleet size and mix vehicle routing problem
• The generalized arc routing problem
• The periodic capacitated arc routing problem with irregular services
• The Stochastic Close-Enough Arc Routing Problem
• Use of Ranks in One-Criterion Variance Analysis

Cited in

(1)

• Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling

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

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