logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Scatter search for network design problem

delete2005-09-01
delete24
PRE
AI
A
Alvarez, AM
J
José Luis González–Velarde
K
Karim De-Alba
DOI：10.1007/s10479-005-2451-4delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A fixed charge capacitated multicommodity network design problem on undirected networks is addressed. At the present time, there exists no algorithm that can solve large instances, common in several applications, in a reasonable period of time. This paper presents an efficient procedure using a scatter search framework. Computational experiments on a large set of randomly generated problems show that this procedure is capable of finding good solutions to large-scale problems within a reasonable amount of time.
Keywords:
network design
metaheuristics
scatter search
GRASP

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.0K
Citations:
2.1W

Organization

No organization information available