2014
DOI: 10.1016/j.ejor.2013.09.008
|View full text |Cite
|
Sign up to set email alerts
|

Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
37
0
3

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 101 publications
(40 citation statements)
references
References 28 publications
0
37
0
3
Order By: Relevance
“…This social objective was also presented by Martínez-Salazar et al (2014) in a two stage transportation location routing problem. They tried to minimize the number of trucks based on the truck capacity in the first stage and balancing the routes for city drivers in the second stage.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This social objective was also presented by Martínez-Salazar et al (2014) in a two stage transportation location routing problem. They tried to minimize the number of trucks based on the truck capacity in the first stage and balancing the routes for city drivers in the second stage.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Subsequently, various variants of the LRP emerge [4], such as multi-echelon LRP [5], LRP with pickup and delivery [6], LRP with time windows [7], transportation LRP [8], and dynamic LRP [9]. However, similar to the VRP, those studies almost focus on distribution system, particularly, non-fully loaded shipments.…”
Section: Introductionmentioning
confidence: 99%
“…Constraint (5) guarantees that the trips of heavy vehicles on an arc match the volumes of raw materials to be transported. Constraints (7), (8), and (9) guarantee the continuity of each route. Equation (10) indicates that no empty vehicle travels to plants and (11) indicates that no heavy vehicle travels to suppliers.…”
Section: Formulationsmentioning
confidence: 99%
“…About half of the mentioned papers put forward a new mathematical extension in addition to the solution algorithm. The majority of the LRP models belong to mixed-integer linear programming class, with only three nonlinear models of this type being found in the literature [35][36][37]. The other major categorization is the stochasticity of the proposed models.…”
Section: Location Routing Problemsmentioning
confidence: 99%