Log in to save to my catalogue

A biased‐randomized metaheuristic for the capacitated location routing problem

A biased‐randomized metaheuristic for the capacitated location routing problem

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1902478447

A biased‐randomized metaheuristic for the capacitated location routing problem

About this item

Full title

A biased‐randomized metaheuristic for the capacitated location routing problem

Publisher

Oxford: Blackwell Publishing Ltd

Journal title

International transactions in operational research, 2017-09, Vol.24 (5), p.1079-1098

Language

English

Formats

Publication information

Publisher

Oxford: Blackwell Publishing Ltd

More information

Scope and Contents

Contents

The location routing problem (LRP) involves the three key decision levels in supply chain design, that is, strategic, tactical, and operational levels. It deals with the simultaneous decisions of (a) locating facilities (e.g., depots or warehouses), (b) assigning customers to facilities, and (c) defining routes of vehicles departing from and finish...

Alternative Titles

Full title

A biased‐randomized metaheuristic for the capacitated location routing problem

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_1902478447

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1902478447

Other Identifiers

ISSN

0969-6016

E-ISSN

1475-3995

DOI

10.1111/itor.12322

How to access this item