Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
type: Item
instance of: scholarly article
title: Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634094
zbMATH Keywords: rural postman problem
zbMATH Keywords: periodic
zbMATH Keywords: generalized
zbMATH Keywords: length restrictions
zbMATH Keywords: intermediate facilities
zbMATH Keywords: multi-objective optimization
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106052
OpenAlex ID: W4307290958
cites work: The periodic vehicle routing problem with intermediate facilities
cites work: The generalized arc routing problem
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: Q4801179
cites work: On the distance-constrained close enough arc routing problem
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: The capacitated arc routing problem with intermediate facilities
cites work: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
cites work: A heuristic for the periodic rural postman problem
cites work: The fleet size and mix vehicle routing problem
cites work: Evolutionary algorithms for periodic arc routing problems
cites work: A genetic algorithm for a bi-objective capacitated arc routing problem
cites work: A scheduling model of logistics service supply chain based on the time windows of the FLSP's operation and customer requirement
cites work: A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
cites work: The periodic capacitated arc routing problem with irregular services
cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
cites work: Preference-inspired co-evolutionary algorithms using weight vectors
cites work: Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
cites work: Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
cites work: The commodity-split multi-compartment capacitated arc routing problem
DOI: 10.1016/J.COR.2022.106052
description: scientific article; zbMATH DE number 7634094