skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Abstract

This paper presents a new variant of periodic vehicle routing problem in which the reaching time to the customers affects market share. Thus, there is a competition between distributors to achieve more market share by reaching the customers earlier than others; moreover, travel time between each two pairs of customers is uncertain. This situation is called an uncertain competitive environment. For the given problem, a new bi-objective mathematical model including minimization of total traveled time and maximization of the market share is presented. In order to solve this model, a multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied; and to evaluate the algorithm performance, some samples are generated; and the results of algorithms are compared based on some comparison metrics. The results demonstrate that the proposed LMOPSO algorithm leads to a better performance compared to the MOPSO in most comparison metrics.

Authors:
 [1]; ;  [2]
  1. Isfahan University of Technology, Department of Industrial and Systems Engineering (Iran, Islamic Republic of)
  2. Iran University of Science and Technology, Department of Industrial Engineering (Iran, Islamic Republic of)
Publication Date:
OSTI Identifier:
22769340
Resource Type:
Journal Article
Journal Name:
Computational and Applied Mathematics
Additional Journal Information:
Journal Volume: 37; Journal Issue: 2; Other Information: Copyright (c) 2018 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 0101-8205
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; ALGORITHMS; COMPARATIVE EVALUATIONS; MATHEMATICAL MODELS; METRICS; MINIMIZATION; PERIODICITY

Citation Formats

Alinaghian, M., E-mail: alinaghian@cc.iut.ac.ir, Ghazanfari, M., and Hamedani, S. Gharegozloo. A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment. United States: N. p., 2018. Web. doi:10.1007/S40314-016-0410-0.
Alinaghian, M., E-mail: alinaghian@cc.iut.ac.ir, Ghazanfari, M., & Hamedani, S. Gharegozloo. A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment. United States. doi:10.1007/S40314-016-0410-0.
Alinaghian, M., E-mail: alinaghian@cc.iut.ac.ir, Ghazanfari, M., and Hamedani, S. Gharegozloo. Tue . "A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment". United States. doi:10.1007/S40314-016-0410-0.
@article{osti_22769340,
title = {A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment},
author = {Alinaghian, M., E-mail: alinaghian@cc.iut.ac.ir and Ghazanfari, M. and Hamedani, S. Gharegozloo},
abstractNote = {This paper presents a new variant of periodic vehicle routing problem in which the reaching time to the customers affects market share. Thus, there is a competition between distributors to achieve more market share by reaching the customers earlier than others; moreover, travel time between each two pairs of customers is uncertain. This situation is called an uncertain competitive environment. For the given problem, a new bi-objective mathematical model including minimization of total traveled time and maximization of the market share is presented. In order to solve this model, a multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied; and to evaluate the algorithm performance, some samples are generated; and the results of algorithms are compared based on some comparison metrics. The results demonstrate that the proposed LMOPSO algorithm leads to a better performance compared to the MOPSO in most comparison metrics.},
doi = {10.1007/S40314-016-0410-0},
journal = {Computational and Applied Mathematics},
issn = {0101-8205},
number = 2,
volume = 37,
place = {United States},
year = {2018},
month = {5}
}