Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
Published 2018 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
Authors
Keywords
Capacitated arc routing problem, Time-based capacities, Biased randomisation, Simulated annealing, Metaheuristics
Journal
ANNALS OF OPERATIONS RESEARCH
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-02-03
DOI
10.1007/s10479-018-2777-3
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An updated annotated bibliography on arc routing problems
- (2017) M. Cândida Mourão et al. NETWORKS
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- (2017) Thibaut Vidal OPERATIONS RESEARCH
- A hybrid metaheuristic approach for the capacitated arc routing problem
- (2016) Yuning Chen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem
- (2015) Claudia Bode et al. TRANSPORTATION SCIENCE
- Rich Vehicle Routing Problem
- (2014) Jose Caceres-Cruz et al. ACM COMPUTING SURVEYS
- A memetic algorithm with iterated local search for the capacitated arc routing problem
- (2013) Tiantang Liu et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
- (2013) Enrico Bartolini et al. OPERATIONS RESEARCH
- Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues
- (2013) Angel A. Juan et al. International Transactions in Operational Research
- Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands
- (2011) Angel A. Juan et al. ANNALS OF OPERATIONS RESEARCH
- Capacitated arc routing problem with deadheading demands
- (2011) Gokhan Kirlik et al. COMPUTERS & OPERATIONS RESEARCH
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- (2011) Fábio Luiz Usberti et al. COMPUTERS & OPERATIONS RESEARCH
- Applying min–max k postmen problems to the routing of security guards
- (2011) E J Willemse et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- (2011) Angel A. Juan et al. Top
- A dynamic capacitated arc routing problem with time-dependent service costs
- (2010) Mariam Tagmouti et al. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
- Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows
- (2009) Pieter Vansteenwegen et al. COMPUTERS & OPERATIONS RESEARCH
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- (2008) Adam N. Letchford et al. COMPUTERS & OPERATIONS RESEARCH
- Solution of real-world postman problems
- (2007) Stefan Irnich EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A deterministic tabu search algorithm for the capacitated arc routing problem
- (2006) José Brandão et al. COMPUTERS & OPERATIONS RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now