Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-018-2777-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790740531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint programming approach to the Chinese postman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods based on node-routing formulations for undirected arc-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks and vehicle routing for municipal waste collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic tabu search algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic approach for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on Arc Routing Problems: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routeing winter gritting vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network service scheduling and routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of real-world postman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problem with deadheading demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-job Cutting Stock Problem with Due Dates and Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the directed Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated arc routing problems using a transformation to the CVRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Road network monitoring: algorithms and a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of simulated annealing cooling strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augment-insert algorithms for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming arc routing into node routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with evolutionary path-relinking for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Capacitated Arc Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Capacitated Arc Routing Problem / rank
 
Normal rank

Revision as of 14:25, 18 July 2024

scientific article
Language Label Description Also known as
English
Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
scientific article

    Statements

    Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 March 2019
    0 references
    capacitated arc routing problem
    0 references
    time-based capacities
    0 references
    biased randomisation
    0 references
    simulated annealing
    0 references
    metaheuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers