Adaptive memory in multistart heuristics for multicommodity network design
type: Item
instance of: scholarly article
title: Adaptive memory in multistart heuristics for multicommodity network design
zbMATH Open document ID: 1211.90296
author: Daniel Aloise
author: Celso C. Ribeiro
published in: Journal of Heuristics
publication date: 2011-05-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5886940
zbMATH Keywords: adaptive memory
zbMATH Keywords: vocabulary building
zbMATH Keywords: multistart
zbMATH Keywords: multicommodity flows
zbMATH Keywords: network design
zbMATH Keywords: heuristics
describes a project that uses: Tabu search
describes a project that uses: PERL
describes a project that uses: TTTPLOTS
MaRDI profile type: Publication
full work available at URL: s10732-010-9130-6
OpenAlex ID: W2060030554
cites work: A survey of very large-scale neighborhood search techniques
cites work: Probability distribution of solution time in GRASP: an experimental investigation
cites work: TTT plots: a perl program to create time-to-target plots
cites work: D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
cites work: Tabu search for a network loading problem with multiple facilities
cites work: On implementing the push-relabel method for the maximum flow problem
cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
cites work: The flow deviation method: An approach to store‐and‐forward communication network design
cites work: Exact solution of multicommodity network optimization problems with general step cost functions
cites work: LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
cites work: Q4352217
cites work: Q4354785
cites work: Variable neighborhood search: Principles and applications
cites work: Q4843091
cites work: A Survey of Linear Cost Multicommodity Network Flows
cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem
cites work: A new proximal decomposition algorithm for routing in telecommunication networks
cites work: Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications
cites work: Discrete cost multicommodity network optimization problems and exact solution methods
cites work: Optimal solution of the discrete cost multicommodity network design problem
cites work: A hybrid GRASP with perturbations for the Steiner problem in graphs
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Q4495206
cites work: A More Portable Fortran Random Number Generator
cites work: A polyhedral approach to multicommodity survivable network design
DOI: 10.1007/S10732-010-9130-6
description: scientific article; zbMATH DE number 5886940