The single-stage location-routing problem with time windows

Authors:
Halil Ibrahim Gündüz
Affiliations:
RWTH Aachen
Venue:
ICCL'11 Proceedings of the Second international conference on Computational logistics
Year:
2011

Citing 5
Cited 0

A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

Computers and Operations Research
The vehicle routing problem

The vehicle routing problem
The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem

Operations Research
A compact model and tight bounds for a combined location-routing problem

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known capacitated facility location problem (CFLP) and the vehicle routing problem with time windows (VRPTW) have been studied intensively over the last decades. In most distribution systems, depot location and routing decisions are implemented independently. Low-quality solutions are obtained if a sequential method, e.g., locate depots first and plan routes second, is used. In location-routing problems (LRP), location and routing are solved simultaneously. Here, our goal is to combine the CFLP and the VRPTW into a single-stage LRP with time windows (SSLRPTW), which covers more realistic aspects, especially time aspects, of many real problems. In order to efficiently solve the SSLRPTW for large-scale instances, a tabu search heuristic is proposed. This method outperforms the used sequential method.