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.106052OpenAlexW4307290958MaRDI QIDQ2108153FDOQ2108153
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
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
multi-objective optimizationperiodicrural postman problemintermediate facilitiesgeneralizedlength restrictions
Cites Work
- The periodic vehicle routing problem with intermediate facilities
- The Capacitated Arc Routing Problem: Lower bounds
- Arc Routing Problems, Part II: The Rural Postman Problem
- The capacitated arc routing problem with intermediate facilities
- Preference-inspired co-evolutionary algorithms using weight vectors
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- The fleet size and mix vehicle routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Evolutionary algorithms for periodic arc routing problems
- Title not available (Why is that?)
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- The periodic capacitated arc routing problem with irregular services
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- The generalized arc routing problem
- A heuristic for the periodic rural postman problem
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- 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
- On the distance-constrained close enough arc routing problem
- The commodity-split multi-compartment capacitated arc routing problem
Cited In (3)
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)