2017
DOI: 10.1007/s40314-016-0410-0
|View full text |Cite
|
Sign up to set email alerts
|

A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 41 publications
0
1
0
Order By: Relevance
“…A stochastic adaptive greedy algorithm was then proposed for solving this problem. Alinaghian et al [39] presented a new variant of the periodic vehicle routing problem in which reaching the customers affects the market share and where the objective function is to minimize the total transit time and maximize the market share. In order to solve this model, multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied, and the results of the algorithms are compared based on some comparison metrics.…”
Section: Introductionmentioning
confidence: 99%
“…A stochastic adaptive greedy algorithm was then proposed for solving this problem. Alinaghian et al [39] presented a new variant of the periodic vehicle routing problem in which reaching the customers affects the market share and where the objective function is to minimize the total transit time and maximize the market share. In order to solve this model, multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied, and the results of the algorithms are compared based on some comparison metrics.…”
Section: Introductionmentioning
confidence: 99%