A COMPARISON OF NSGA II AND MOSA FOR SOLVING MULTI-DEPOTS TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH HETEROGENEOUS FLEET

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.

AFSHAR NADJAFI BEHROUZ; RAZMI FAROOJI ARIAN

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2014 | Volume:8 | Issue:3 (16) Page(s): 65-73

Download Full-Text

View:

290

Download:

149

Cites:

Information Journal Paper

Title

A COMPARISON OF NSGA II AND MOSA FOR SOLVING MULTI-DEPOTS TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH HETEROGENEOUS FLEET

Author(s)

AFSHAR NADJAFI BEHROUZ | RAZMI FAROOJI ARIAN | Issue Writer Certificate

Keywords

TIME-DEPENDENT VEHICLE ROUTING PROBLEM

BI-OBJECTIVE OPTIMIZATION

META-HEURISTICS

NSGA II

MOSA

Abstract

TIME-DEPENDENT VEHICLE ROUTING PROBLEM is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of TIME-DEPENDENT VEHICLE ROUTING PROBLEMs with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come back to the depots, from which they were departed. In order to solve our bi-objective formulation, we presented two well-known Meta-heuristic algorithms, namely NSGA II and MOSA and compared their performance based on a set of randomly generated test problems. The results confirm that our MILP model is valid and both NSGA II and MOSA work properly. While NSGA II finds closer solutions to the true Pareto front, MOSA finds evenly- distributed solutions which allows the algorithm to search the space more diversely.

Cites

No record.

References

Cite

APA: Copy

AFSHAR NADJAFI, BEHROUZ, & RAZMI FAROOJI, ARIAN. (2014). A COMPARISON OF NSGA II AND MOSA FOR SOLVING MULTI-DEPOTS TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH HETEROGENEOUS FLEET. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 8(3 (16)), 65-73. SID. https://sid.ir/paper/631076/en

Vancouver: Copy

AFSHAR NADJAFI BEHROUZ, RAZMI FAROOJI ARIAN. A COMPARISON OF NSGA II AND MOSA FOR SOLVING MULTI-DEPOTS TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH HETEROGENEOUS FLEET. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2014;8(3 (16)):65-73. Available from: https://sid.ir/paper/631076/en

IEEE: Copy

BEHROUZ AFSHAR NADJAFI, and ARIAN RAZMI FAROOJI, “A COMPARISON OF NSGA II AND MOSA FOR SOLVING MULTI-DEPOTS TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH HETEROGENEOUS FLEET,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 8, no. 3 (16), pp. 65–73, 2014, [Online]. Available: https://sid.ir/paper/631076/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops