Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities

DOI10.1016/J.COR.2022.106052MaRDI QIDQ2108153zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 December 2022

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

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

zbMATH Keywords

multi-objective optimizationperiodicrural postman problemintermediate facilitiesgeneralizedlength restrictions

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
• Evolutionary algorithms for periodic arc routing problems
• A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves
• Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem
• Two phased hybrid local search for the periodic capacitated arc routing problem

Cites work

• scientific article; zbMATH DE number 1893558 (Why is no real title available?)
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• A genetic algorithm for a bi-objective capacitated arc routing problem
• A heuristic for the periodic rural postman problem
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• A scheduling model of logistics service supply chain based on the time windows of the FLSP's operation and customer requirement
• Arc Routing Problems, Part II: The Rural Postman Problem
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
• Evolutionary algorithms for periodic arc routing problems
• On the distance-constrained close enough arc routing problem
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Preference-inspired co-evolutionary algorithms using weight vectors
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem with intermediate facilities
• The commodity-split multi-compartment capacitated arc routing problem
• The fleet size and mix vehicle routing problem
• The generalized arc routing problem
• The periodic capacitated arc routing problem with irregular services
• The periodic vehicle routing problem with intermediate facilities

Cited in

(3)

• A multi-level capacitated arc routing problem with intermediate facilities in waste collection
• An improved multi-objective framework for the rich arc routing problem
• Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem

This page was built for publication: Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities

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