A TIME-DEPENDENT VEHICLE ROUTING PROBLEM FOR DISASTER RESPONSE PHASE IN MULTI-GRAPH-BASED NETWORK

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.

SETAK MOSTAFA; Izadi Shabnam; Tikani Hamid

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING
Year:2017 | Issue:13

Download Full-Text

View:

Download:

Information Seminar Paper

Title

A TIME-DEPENDENT VEHICLE ROUTING PROBLEM FOR DISASTER RESPONSE PHASE IN MULTI-GRAPH-BASED NETWORK

Author(s)

SETAK MOSTAFA | Izadi Shabnam | Tikani Hamid

Keywords

TIME-DEPENDENT VEHICLE ROUTING PROBLEM

MULTI-GRAPH

FIFO PROPERTY

DISASTER RELIEF

SERVICE TIME

Abstract

LOGISTICS PLANNING IN DISASTER RESPONSE PHASE INVOLVES DISPATCHING COMMODITIES SUCH AS MEDICAL MATERIALS, PERSONNEL, FOOD, ETC. TO AFFECTED AREAS AS SOON AS POSSIBLE TO ACCELERATE THE RELIEF OPERATIONS. SINCE, TRANSPORTATION VEHICLES IN DISASTER SITUATIONS CAN BE CONSIDERED AS SCARCE RESOURCES, THUS, THE EFFICIENT USAGE OF THEM IS SUBSTANTIALLY IMPORTANT. IN THIS STUDY, WE PROVIDE A DYNAMIC VEHICLE ROUTING MODEL FOR EMERGENCY LOGISTICS OPERATIONS IN THE OCCURRENCE OF NATURAL DISASTERS. THE AIM OF THE MODEL IS TO FIND OPTIMAL ROUTES FOR A FLEET OF VEHICLES TO GIVE EMERGENCY COMMODITIES TO A SET OF AFFECTED AREAS BY CONSIDERING THE EXISTENCE OF MORE THAN ONE ARC BETWEEN EACH TWO NODES IN THE NETWORK (MULTI-GRAPH NETWORK). PROPOSED MODEL CONSIDERS FIFO PROPERTY AND FOCUSED ON MINIMIZATION OF WAITING TIME AND TOTAL NUMBER OF VEHICLES. VARIOUS PROBLEM INSTANCES HAVE BEEN PROVIDED TO INDICATE THE EFFICIENCY OF THE MODEL. FINALLY, A BRIEF SENSITIVITY ANALYSIS IS PRESENTED TO INVESTIGATE THE IMPACT OF DIFFERENT PARAMETERS ON THE OBTAINED SOLUTIONS.

Cites

No record.

References

No record.

Cite

APA: Copy

SETAK, MOSTAFA, Izadi, Shabnam, & Tikani, Hamid. (2017). A TIME-DEPENDENT VEHICLE ROUTING PROBLEM FOR DISASTER RESPONSE PHASE IN MULTI-GRAPH-BASED NETWORK. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/938186/en

Vancouver: Copy

SETAK MOSTAFA, Izadi Shabnam, Tikani Hamid. A TIME-DEPENDENT VEHICLE ROUTING PROBLEM FOR DISASTER RESPONSE PHASE IN MULTI-GRAPH-BASED NETWORK. 2017. Available from: https://sid.ir/paper/938186/en

IEEE: Copy

MOSTAFA SETAK, Shabnam Izadi, and Hamid Tikani, “A TIME-DEPENDENT VEHICLE ROUTING PROBLEM FOR DISASTER RESPONSE PHASE IN MULTI-GRAPH-BASED NETWORK,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/938186/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops