SOLVING THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM BY A COLUMN GENERATION

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.

DOLAT NEJAD SOMARIN A.; MIRHASSANI S.A.; YOUSEFI KHOSHBAKHT M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2015 | Volume:11 | Issue:4 (41) Page(s): 307-320

Download Full-Text

Persian Verion

View:

1,912

Download:

Cites:

Information Journal Paper

Title

SOLVING THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM BY A COLUMN GENERATION

Author(s)

DOLAT NEJAD SOMARIN A. | MIRHASSANI S.A. | YOUSEFI KHOSHBAKHT M. | Issue Writer Certificate

Keywords

HETEROGENEOUS FIXED FLEETQ2

VEHICLE ROUTING PROBLEMQ2

COLUMN GENERATIONQ2

Abstract

The HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM (HFFVRP) is one of the most significant extension problems of the VEHICLE ROUTING PROBLEM (VRP). The HFFOVRP is the problem of designing optimal delivery from a given depot in order to satisfy the demand of the customer population by a fleet of a fixed number of vehicles. Because the solving of this problem which has numerous applications in industrial and service problems is difficult, a COLUMN GENERATION (CG) algorithm for solving HFFVRP is proposed in this paper. The proposed algorithm is tested on 16 standard instances involving 10 to 50 customers. The computational results show that the CG results are better than results of exact algorithm for solving the HFFVRP within a comparatively shorter period of time.

Cites

No record.

References

Cite

APA: Copy

DOLAT NEJAD SOMARIN, A., MIRHASSANI, S.A., & YOUSEFI KHOSHBAKHT, M.. (2015). SOLVING THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM BY A COLUMN GENERATION. JOURNAL OF TRANSPORTATION RESEARCH, 11(4 (41)), 307-320. SID. https://sid.ir/paper/83909/en

Vancouver: Copy

DOLAT NEJAD SOMARIN A., MIRHASSANI S.A., YOUSEFI KHOSHBAKHT M.. SOLVING THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM BY A COLUMN GENERATION. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2015;11(4 (41)):307-320. Available from: https://sid.ir/paper/83909/en

IEEE: Copy

A. DOLAT NEJAD SOMARIN, S.A. MIRHASSANI, and M. YOUSEFI KHOSHBAKHT, “SOLVING THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM BY A COLUMN GENERATION,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 11, no. 4 (41), pp. 307–320, 2015, [Online]. Available: https://sid.ir/paper/83909/en

Related Journal Papers