Proposing a Constrained-GSA for the Vehicle Routing Problem

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.

EBRAHIMI MOOD SEPEHR; Javidi Mohammad Masoud; KHOSRAVI MOHAMMAD REZA

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

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2022 | Volume:18 | Issue:4 (50) Page(s): 23-35

Download Full-Text

Persian Verion

View:

273

Download:

Cites:

Information Journal Paper

Title

Proposing a Constrained-GSA for the Vehicle Routing Problem

Author(s)

EBRAHIMI MOOD SEPEHR | Javidi Mohammad Masoud | KHOSRAVI MOHAMMAD REZA | Issue Writer Certificate

Keywords

Vehicle Routing Problem

Meta-heuristic algorithms

Constrained Gravitational Search Algorithm

Abstract

In the past decades, Vehicle Routing Problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle Routing Problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and these methods are not useful in real-world applications. Using Meta-heuristic algorithms for calculating and computing the solutions for NP-hard problems is a common method to contrast this challenge. The objective function defined for this problem, is a constrained objective function. In previous algorithms, the penalty method was used as constraint handling technique to define the objective function. Determining the value of parameters and penalty coefficient is not easy in these methods. Moreover, the optimal number of vehicles was not considered in the previous algorithms. So, the user should guess number of vehicles and compare the result with other values for this variable. In this paper, a novel objective function is defined to solve the Vehicle Routing Problem with simultaneous pickup and delivery. This method can find the vehicle routes such that increases the performance of the vehicles and decreases the processes’ costs of transportation. in addition, the optimal number of vehicle in this problem can be calculated using this objective function. Finding the best solution for this optimization problems is an NP-hard and meta-heuristic methods can be used to estimate good solutions for this problem. Then, a constrained version of gravitational search algorithm is proposed. In this method, a fuzzy logic controller is used to calculate the value of the parameters and control the abilities of the algorithm, automatically. Using this controller can balance the exploration and exploitation abilities in the gravitational search algorithm and improve the performance of the algorithm. This new version of gravitational search algorithm is used to find a good solution for the predefined objective function. The proposed method is evaluated on some standard benchmark test functions and problems. The experimental results show that the proposed method outperforms the state-of-the-art methods, despite the simplicity of implementation.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

EBRAHIMI MOOD, SEPEHR, Javidi, Mohammad Masoud, & KHOSRAVI, MOHAMMAD REZA. (2022). Proposing a Constrained-GSA for the Vehicle Routing Problem. SIGNAL AND DATA PROCESSING, 18(4 (50) ), 23-35. SID. https://sid.ir/paper/953206/en

Vancouver: Copy

EBRAHIMI MOOD SEPEHR, Javidi Mohammad Masoud, KHOSRAVI MOHAMMAD REZA. Proposing a Constrained-GSA for the Vehicle Routing Problem. SIGNAL AND DATA PROCESSING[Internet]. 2022;18(4 (50) ):23-35. Available from: https://sid.ir/paper/953206/en

IEEE: Copy

SEPEHR EBRAHIMI MOOD, Mohammad Masoud Javidi, and MOHAMMAD REZA KHOSRAVI, “Proposing a Constrained-GSA for the Vehicle Routing Problem,” SIGNAL AND DATA PROCESSING, vol. 18, no. 4 (50) , pp. 23–35, 2022, [Online]. Available: https://sid.ir/paper/953206/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops