alexa A Possibilistic Programming Approach for Vehicle Routin
ISSN: 2169-0316

Industrial Engineering & Management
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article

A Possibilistic Programming Approach for Vehicle Routing Problem with Fuzzy Fleet Capacity (FCVRP)

Seyed Mohammad Seyedhosseini1*, Shima Kabirian1, Ahmad Makui1 and Nooraddin Dabiri2

1Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran

2Department of Industrial Engineering, Faculty of Engineering, Golestan University, Golestan, Iran

*Corresponding Author:
Seyed Mohammad Seyedhosseini
Department of Industrial Engineering
Iran University of Science and Technology
Narmak, Tehran, Iran
Tel: +98 9121261744
Fax: +98 21 77240482
E-mail: [email protected]

Received February 03, 2012; Accepted April 27, 2012; Published April 30, 2012

Citation: Seyedhosseini SM, Kabirian S, Makui A, Dabiri N (2012) A Possibilistic Programming Approach for Vehicle Routing Problem with Fuzzy Fleet Capacity (FCVRP). Ind Eng Manage 2:101. doi:10.4172/2169-0316.1000101

Copyright: © 2012 Seyedhosseini SM, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.



In this paper we present the vehicle routing problem with fuzzy fleet capacity (FCVRP) to find short routes with the minimal transportation cost. We propose a possibilistic 0-1 linear programming model to deal with such issues. To solve the proposed possibilistic optimization model, we apply an efficient possibilistic method proposed by Parra et al. [1] The FCVRP is NP-hard, which means that an efficient algorithm for solving the problem to optimality is unavailable. To deal with the problem efficiently, we develop a hybrid genetic algorithm (HGA). For the model verification, some small, medium and large-scale test problems are solved by HGA and the results are compared with obtained results from Lingo 9.0. Finally, we do a case study in the Kalleh Company in Amol and publish the results.


Share This Page

Additional Info

Loading Please wait..
Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version