A MULTI-CRITERIA VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS BY SIMULATED ANNEALING

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.; SAFAEI N.; SHARIAT M.A.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2005 | Volume:1 | Issue:1 Page(s): 28-36

Download Full-Text

View:

283

Download:

113

Cites:

Information Journal Paper

Title

A MULTI-CRITERIA VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS BY SIMULATED ANNEALING

Author(s)

TAVAKOLI MOGHADAM R. | SAFAEI N. | SHARIAT M.A. | Issue Writer Certificate

Keywords

MULTI-CRITERIA VEHICLE ROUTING PROBLEM

MATHEMATICAL MODEL

TIME WINDOWS

SIMULATED ANNEALING

Abstract

This paper presents a MULTI-CRITERIA VEHICLE ROUTING PROBLEM with soft TIME WINDOWS (VRPSTW) to minimize fleet cost, routes cost, and violation of soft TIME WINDOWS penalty. In this case, the fleet is heterogeneous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation affects customer satisfaction and penalty is equal to a degree of customer dissatisfaction. The VRP, which is an extension of traveling salesman problem (TSP), belongs to a class of NP-hard problems. Thus, it is necessary to use meta-heuristics for solving VRP in large-scale problems. This paper uses a SIMULATED ANNEALING (SA) approach with 1-Opt and 2- Opt operators for solving the proposed MATHEMATICAL MODEL. The proposed model is then solved by the Lingo software and the associated solutions are compared with the computational results obtained by the SA approach for a number of instance problems. The obtained results are promising and indicating the efficiency of the proposed SA approach.

Cites

A HYBRID META-HEURISTIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES CONSIDERING THE DRIVER'S SATISFACTION

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., SAFAEI, N., & SHARIAT, M.A.. (2005). A MULTI-CRITERIA VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS BY SIMULATED ANNEALING. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 1(1), 28-36. SID. https://sid.ir/paper/309821/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., SAFAEI N., SHARIAT M.A.. A MULTI-CRITERIA VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS BY SIMULATED ANNEALING. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2005;1(1):28-36. Available from: https://sid.ir/paper/309821/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, N. SAFAEI, and M.A. SHARIAT, “A MULTI-CRITERIA VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS BY SIMULATED ANNEALING,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 1, no. 1, pp. 28–36, 2005, [Online]. Available: https://sid.ir/paper/309821/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops