Results 191 to 200 of about 7,596,422 (242)
Some of the next articles are maybe not open access.

The Latency Location-Routing Problem

European Journal of Operational Research, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Moshref-Javadi, Seokcheon Lee
openaire   +1 more source

Dynamic Location-routeing Problems

Journal of the Operational Research Society, 1989
Dynamic location-routeing problems involve the determination of the least-cost sequence of depot, vehicle fleet and route configurations in a distribution system, over a given planning horizon. This paper presents two solution approaches to such problems. The first is an exact method which is appropriate for small-scale problems.
Laporte, Gilbert, Dejax, Pierre J.
openaire   +2 more sources

A Location-Routing Problem for Biomass Supply Chains

Computers and Industrial Engineering, 2021
Abstract Facility location and vehicle routing are two critical decision problems in the design of biomass supply chains. Different from previous studies considering these two problems separately, this paper integrates the facility location and the vehicle routing problems for biomass supply chains into a single one, namely the location-routing ...
Yuguang Zhou
exaly   +3 more sources

Location‐routing problem: a classification of recent research

International Transactions in Operational Research, 2021
Abstract The location‐routing problem (LRP) and its variants have been studied extensively over the past few years. The number of articles has grown more than ever, since the last surveys. Therefore, this study aims to perform a review of recent LRP research from 222 academic literature published from 2014 to 2019.
Setyo Tri Windras Mara   +2 more
openaire   +3 more sources

The Multicommodity-Ring Location Routing Problem

Transportation Science, 2016
The multicommodity-ring location routing problem (MRLRP) studied in this paper is an NP-hard minimization problem arising in city logistics. The aim is to locate a set of urban distribution centers (UDCs) and to connect them via a ring in which massive flows of goods will circulate.
Létocart, Lucas   +3 more
openaire   +2 more sources

Heuristics for a hub location‐routing problem

Networks, 2016
We investigate a variant of the many‐to‐many hub location‐routing problem which consists in partitioning the set of nodes of a graph into routes containing exactly one hub each, and determining an extra route interconnecting all hubs. A variable neighborhood descent with neighborhood structures based on remove/add, swap and exchange moves nested with ...
Mauro Cardoso Lopes   +4 more
openaire   +1 more source

Location-routing problem with time-dependent demands

Computers & Industrial Engineering, 2021
Abstract This study, by considering the time-dependent demand (TDD) characteristic, investigates the location-routing problem with time-dependent demands (LRPTDD) as an extension of the location-routing problem (LRP). The demand in each customer site is represented by a constant demand rate over a known production period. In the LRPTDD, the locations
Vincent F. Yu   +2 more
openaire   +2 more sources

A location-routing problem in glass recycling

Annals of Operations Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fatih Rahim, Canan Sepil
openaire   +3 more sources

A survey of the standard location-routing problem

Annals of Operations Research, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Schneider 0004, Michael Drexl
openaire   +3 more sources

Home - About - Disclaimer - Privacy