A MIXED INTEGER PROGRAMMING FORMULATION FOR THE HETEROGENEOUS FIXED FLEET OPEN 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.

YOUSEFIKHOSHBAKHT MAJID; DIDEHVAR FRAZAD; RAHMATI FARHAD

مرکز اطلاعات علمی 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:2015 | Volume:8 | Issue:18 Page(s): 37-46

Download Full-Text

View:

356

Download:

194

Cites:

Information Journal Paper

Title

A MIXED INTEGER PROGRAMMING FORMULATION FOR THE HETEROGENEOUS FIXED FLEET OPEN VEHICLE ROUTING PROBLEM

Author(s)

YOUSEFIKHOSHBAKHT MAJID | DIDEHVAR FRAZAD | RAHMATI FARHAD | Issue Writer Certificate

Keywords

OPEN VEHICLE ROUTING PROBLEM

HETEROGENEOUS FLEET

ANT COLONY SYSTEM

EXACT ALGORITHM

MIXED INTEGER PROGRAMMING

Abstract

The heterogeneous fixed fleet OPEN VEHICLE ROUTING PROBLEM (HFFOVRP) is one of the most significant extension problems of the OPEN VEHICLE ROUTING PROBLEM (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after serving the last customer. Because of its numerous applications in industrial and service problems, a new model of the HFFOVRP based on MIXED INTEGER PROGRAMMING is proposed in this paper. Furthermore, due to its NP-hard nature, an ANT COLONY SYSTEM (ACS) algorithm was proposed. Since there were no existing benchmarks, this study generated some test problems. From the comparison with the results of EXACT ALGORITHM, the proposed algorithm showed that it can provide better solutions within a comparatively shorter period of time.

Cites

No record.

References

SOLVING THE VEHICLE ROUTING PROBLEM BY A HYBRID META-HEURISTIC ALGORITHM

Cite

APA: Copy

YOUSEFIKHOSHBAKHT, MAJID, DIDEHVAR, FRAZAD, & RAHMATI, FARHAD. (2015). A MIXED INTEGER PROGRAMMING FORMULATION FOR THE HETEROGENEOUS FIXED FLEET OPEN VEHICLE ROUTING PROBLEM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 8(18), 37-46. SID. https://sid.ir/paper/667334/en

Vancouver: Copy

YOUSEFIKHOSHBAKHT MAJID, DIDEHVAR FRAZAD, RAHMATI FARHAD. A MIXED INTEGER PROGRAMMING FORMULATION FOR THE HETEROGENEOUS FIXED FLEET OPEN VEHICLE ROUTING PROBLEM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2015;8(18):37-46. Available from: https://sid.ir/paper/667334/en

IEEE: Copy

MAJID YOUSEFIKHOSHBAKHT, FRAZAD DIDEHVAR, and FARHAD RAHMATI, “A MIXED INTEGER PROGRAMMING FORMULATION FOR THE HETEROGENEOUS FIXED FLEET OPEN VEHICLE ROUTING PROBLEM,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 8, no. 18, pp. 37–46, 2015, [Online]. Available: https://sid.ir/paper/667334/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops