Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
Authors
Keywords
Capacitated arc routing problem, Route cutting off, Large scale optimization, Divide-and-conquer
Journal
INFORMATION SCIENCES
Volume 553, Issue -, Pages 208-224
Publisher
Elsevier BV
Online
2020-11-28
DOI
10.1016/j.ins.2020.11.011
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- (2017) Thibaut Vidal OPERATIONS RESEARCH
- A Scalable Approach to Capacitated Arc Routing Problems Based on Hierarchical Decomposition
- (2017) Ke Tang et al. IEEE Transactions on Cybernetics
- A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem
- (2016) Fernando Bernardes de Oliveira et al. EXPERT SYSTEMS WITH APPLICATIONS
- Improved Memetic Algorithm Based on Route Distance Grouping for Multiobjective Large Scale Capacitated Arc Routing Problems
- (2016) Ronghua Shang et al. IEEE Transactions on Cybernetics
- Immune clonal selection algorithm for capacitated arc routing problem
- (2015) Ronghua Shang et al. SOFT COMPUTING
- Improved bounds for large scale capacitated arc routing problem
- (2013) Rafael Martinelli et al. COMPUTERS & OPERATIONS RESEARCH
- Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems
- (2013) Yi Mei et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Automatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming
- (2013) Su Nguyen et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- (2012) Claudia Bode et al. OPERATIONS RESEARCH
- Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
- (2011) Yi Mei et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- A Memetic Algorithm for Periodic Capacitated Arc Routing Problem
- (2011) Yi Mei et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- (2011) Enrico Bartolini et al. MATHEMATICAL PROGRAMMING
- A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem
- (2010) Rui Zhang et al. ENGINEERING OPTIMIZATION
- Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems
- (2009) Ke Tang et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- An Evolutionary Approach to the Multidepot Capacitated Arc Routing Problem
- (2009) Lining Xing et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- A Global Repair Operator for Capacitated Arc Routing Problem
- (2009) Yi Mei et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
- A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization
- (2008) Chi-Keong Goh et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Large scale evolutionary optimization using cooperative coevolution
- (2008) Zhenyu Yang et al. INFORMATION SCIENCES
- POPMUSIC for a real-world large-scale vehicle routing problem with time windows
- (2008) A Ostertag et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- A deterministic tabu search algorithm for the capacitated arc routing problem
- (2006) José Brandão et al. COMPUTERS & OPERATIONS RESEARCH
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now