Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs

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.

khorramizadeh s.m.; Esfandyaran d.

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

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2019 | Volume:5 | Issue:19 Page(s): 19-30

Download Full-Text

Persian Verion

View:

416

Download:

Cites:

Information Journal Paper

Title

Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs

Author(s)

khorramizadeh s.m. | Esfandyaran d. | Issue Writer Certificate

Keywords

Orienteering problemQ1

Arc routingQ1

Branch and cutQ1

Bisection methodQ1

Fractional objective functionQ1

Abstract

Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’ s satisfaction and maximize profits. In this paper, the Orienteering problem with variable profits, Fractional objective function and demand on arcs is studied. An appropriate integer programming model is proposed to solve it. In this case, the purpose is to determine a route for a vehicle so that it maximizes the profit, the start and end of its route is at the origin, serving demands of customers, and does not exceed a maximum allowed travel time. In the orinteering problem with variable profits and Fractional objective function the customers are located on vertices of the graph corresponding to the problem. Next, a problem is considered in which the service is performed on arcs. The resulting problem is called the orinteering Arc routing problem with variable profits and Fractional objective function. We solve the problem by Bisection method. In the end, the numerical efficiency of the proposed model is examined. The proposed algorithms can solve problems in a reasonable amount of time. We will also see that the time of solving problems depends on their graph structure and not on their size.

Cites

No record.

References

No record.

Cite

APA: Copy

khorramizadeh, s.m., & Esfandyaran, d.. (2019). Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 5(19 ), 19-30. SID. https://sid.ir/paper/257346/en

Vancouver: Copy

khorramizadeh s.m., Esfandyaran d.. Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2019;5(19 ):19-30. Available from: https://sid.ir/paper/257346/en

IEEE: Copy

s.m. khorramizadeh, and d. Esfandyaran, “Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 5, no. 19 , pp. 19–30, 2019, [Online]. Available: https://sid.ir/paper/257346/en

Related Journal Papers