Iclem 2014 2014
DOI: 10.1061/9780784413753.137
|View full text |Cite
|
Sign up to set email alerts
|

Solving the LRPTW Based on Tabu Search Algorithm

Abstract: The object of this paper is to research the multiple-depot location routing problem with time windows. This paper establishes a math model of the location routing problem with time-windows by adding the time constraint to the basic location routing problem, and validates checks the correctness of this math model in a small-scaled problem using Lingo software. This paper designs a tabu search algorithm to solve LRPTW (Location Routing Problem with Time Windows) for large-scaled problems, and uses data of differ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Our mathematical model for the LRPTW is based on the one proposed by Zhu et al [45] with a variation in the objective function. While these authors aim to minimize the total cost, this research seeks to minimize the total evacuation time.…”
Section: Problem Statement and Model Formulationmentioning
confidence: 99%
“…Our mathematical model for the LRPTW is based on the one proposed by Zhu et al [45] with a variation in the objective function. While these authors aim to minimize the total cost, this research seeks to minimize the total evacuation time.…”
Section: Problem Statement and Model Formulationmentioning
confidence: 99%