A NEW MATHEMATICAL PROGRAMMING MODEL FOR A VEHICLE ROUTING PROBLEM IN A COMPETITIVE ENVIRONMENT: A REAL CASE STUDY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

TAVAKOLI MOGHADAM R.; ALINAGHIAN M.; SALAMAT BAKHSH A.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2010 | Volume:6 | Issue:4 (21) Page(s): 311-323

Download Full-Text

Persian Verion

View:

1,389

Download:

Cites:

Information Journal Paper

Title

A NEW MATHEMATICAL PROGRAMMING MODEL FOR A VEHICLE ROUTING PROBLEM IN A COMPETITIVE ENVIRONMENT: A REAL CASE STUDY

Author(s)

TAVAKOLI MOGHADAM R. | ALINAGHIAN M. | SALAMAT BAKHSH A.R. | Issue Writer Certificate

Keywords

VEHICLE ROUTING PROBLEMQ2

MATHEMATICAL PROGRAMMINGQ3

CASH FLOWQ3

COMPETITIVE ENVIRONMENTQ2

HYBRID SIMULATED ANNEALINGQ2

Abstract

Transportation, which has a specific division in production economics and service systems, has a great value in a gross national product (GNP) in every country. Thus, most researchers worked on improving routes, omitting unimportant transportations, or replacing shortcut routes. For these reasons, they have developed a traveling salesman problem (TSP) and a VEHICLE ROUTING PROBLEM (VRP). The classical and deterministic VRP seeks routes with the lowest cost from a depot to a geographically dispersed customers’ set with known demands. Usually in the VRP, monopoly in an environment is the first assumption in solving the problem. Also attending to the competitors for getting better success is important. In the real-world situation, customer’s cash is limited, and a competitor that reach to customers earlier than others can receive the maximum cash. So, providing the specific service to customers earlier than other competitors is very important. In this paper, getting the maximum cash is considered in our presented model with a COMPETITIVE ENVIRONMENT. In the best of our knowledge, the VRP with maximizing cash in the objective function has not been considered in the literature. Thus, we consider a bi-objective model that minimizes the total distance travelled and maximizes the CASH FLOW in a COMPETITIVE ENVIRONMENT. These objectives conflict with each other (i.e., the better one of them, the worse the other). So for facing to this difficulty, a weighting method is needed to integrate these objectives into a single minimization cost function. The presented mathematical model is solved by the Lingo 8 software for various test problems. Since exact solutions of VRPs that belong to the category of NP-hard problems are not practical in large scale, a HYBRID SIMULATED ANNEALING (SA) algorithm embedded with genetic operators is proposed in order to obtain an efficient solution in a reasonable computational time. Furthermore, a real case study is carried out to validate our presented model and the related results are reported. Finally, the remarkable conclusion is presented.

Cites

No record.

References

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., ALINAGHIAN, M., & SALAMAT BAKHSH, A.R.. (2010). A NEW MATHEMATICAL PROGRAMMING MODEL FOR A VEHICLE ROUTING PROBLEM IN A COMPETITIVE ENVIRONMENT: A REAL CASE STUDY. JOURNAL OF TRANSPORTATION RESEARCH, 6(4 (21)), 311-323. SID. https://sid.ir/paper/83814/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., ALINAGHIAN M., SALAMAT BAKHSH A.R.. A NEW MATHEMATICAL PROGRAMMING MODEL FOR A VEHICLE ROUTING PROBLEM IN A COMPETITIVE ENVIRONMENT: A REAL CASE STUDY. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2010;6(4 (21)):311-323. Available from: https://sid.ir/paper/83814/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, M. ALINAGHIAN, and A.R. SALAMAT BAKHSH, “A NEW MATHEMATICAL PROGRAMMING MODEL FOR A VEHICLE ROUTING PROBLEM IN A COMPETITIVE ENVIRONMENT: A REAL CASE STUDY,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 6, no. 4 (21), pp. 311–323, 2010, [Online]. Available: https://sid.ir/paper/83814/en

Related Journal Papers