A Metaheuristic to Solve a Location Routing Problem with Non-Linear
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F05%3A06121713" target="_blank" >RIV/68407700:21260/05:06121713 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Metaheuristic to Solve a Location Routing Problem with Non-Linear
Original language description
The paper deals with location-routing problem with nonlivear carts. The problem is NP-Nord, Soheuristic elgorithms are needed to solve the problem. A metaheuristic merging Tabu Search and Variable Neighborhood Search is proposed in this paper.
Czech name
Metaheuristika k řešení lokalizačně-okružního problému s nelineálními cenami
Czech description
Není k dispozici
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Heuristics
ISSN
1381-1231
e-ISSN
—
Volume of the periodical
1
Issue of the periodical within the volume
11
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
375-391
UT code for WoS article
—
EID of the result in the Scopus database
—