Classification and solution method overview of location-routing problem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F15%3A00234202" target="_blank" >RIV/68407700:21260/15:00234202 - isvavai.cz</a>

Result on the web

<a href="http://ytec2015.fd.cvut.cz/cz/proceedings.php" target="_blank" >http://ytec2015.fd.cvut.cz/cz/proceedings.php</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Classification and solution method overview of location-routing problem

Original language description

Location routing problem (LRP) combines two basic planning problems in logistics. These are facility location problem in which we decide about optimal location of arbitrary types of facilities (factories, warehouses, depots, hubs etc.) and vehicle routing problem that has a goal to determine optimal routes for vehicles. It is well known that making these two decisions independently can lead to significantly suboptimal results. Not only for this reason, much research is focused on LRP recently. The paperclassifies LRP according to its most important characteristics and presents basic methods for its solution.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

YTEC 2015 - Sborník příspěvků konference

ISBN

978-80-01-05791-9

ISSN

—

e-ISSN

—

Number of pages

6

Pages from-to

202-207

Publisher name

České vysoké učení technické v Praze, Fakulta dopravní

Place of publication

Praha

Event location

Praha

Event date

Sep 30, 2015

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—