2010
DOI: 10.1016/j.jmsy.2010.11.005
|View full text |Cite
|
Sign up to set email alerts
|

A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 39 publications
(11 citation statements)
references
References 23 publications
0
10
0
Order By: Relevance
“…The proposed model by Lin and Kwok [42] is the first M-O case of this type. The same track was followed by R. Tavakkoli-Moghaddam et al [43], where the authors aimed at service-level enhancement by maximization of the total served demand in addition to cost minimization. G. Nasab et al [44] considered three objectives, one of which is the minimization of the population who cannot access health services due to excessive distance.…”
Section: Location Routing Problemsmentioning
confidence: 97%
“…The proposed model by Lin and Kwok [42] is the first M-O case of this type. The same track was followed by R. Tavakkoli-Moghaddam et al [43], where the authors aimed at service-level enhancement by maximization of the total served demand in addition to cost minimization. G. Nasab et al [44] considered three objectives, one of which is the minimization of the population who cannot access health services due to excessive distance.…”
Section: Location Routing Problemsmentioning
confidence: 97%
“…A final equity objective is the minimisation of total distance to unmet demand, which incorporates the decision‐maker's desire to ensure that, in the future, the unmet demand can be met as easily as possible, by installing a new depot, or increasing the capacity of an existing one. This may be the case when the demand surpasses the (desired to install) supply, as in Johnson et al () and Tavakkoli‐Moghaddam et al ().…”
Section: Algorithmic Approaches and Objectivesmentioning
confidence: 99%
“…The remaining ones use non‐interactive methods, often using the weighting method for generating efficient solutions. Other used methods include goal programming (Zografos and Samara, ; Giannikos, ), constraint method (Wyman and Kuby, ), and more recently, metaheuristics (Lin and Kwok, ; Caballero et al, ; Tavakkoli‐Moghaddam et al, ).…”
Section: Algorithmic Approaches and Objectivesmentioning
confidence: 99%
“…They provide a solution procedure based on the SS framework. Tavakkoli-Moghaddam, Makui, and Mazloomi (2010) present an integrated mathematical model for the multi-depot location routing problem to maximise the total served demand and minimise the total cost. They propose a novel multi-objective SS algorithm to obtain the local diverse Pareto-optimal frontier.…”
Section: Review Of Related Researchmentioning
confidence: 99%