By Topic

Scatter search for a real-life fleet size and mix vehicle routing problem with time windows in Iran

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pourghaderi, A.R. ; Dept. of Ind. Eng., Univ. of Tehran, Tehran, Iran ; Torabi, S.A. ; Sekhavat, S.

The fleet size and mix vehicle routing problem (FSMVRP) consists of defining the type, the number of vehicles of each type, as well as the order in which to serve the customers with each vehicle when a company has to distribute goods to a set of customers geographically spread, with the objective of minimizing the total costs. In this paper, we study a real-life FSMVRP with time windows (FSMVRPTW) that occurs in a major Iranian industrial group. To find satisfying solutions to this complex problem, we propose a scatter search (SS) algorithm. Next, the solutions obtained are compared with the current vehicles and routes used actually by the company. Our results show that the total distribution cost can be reduced significantly when the proposed method is used.

Published in:

Industrial Engineering and Engineering Management, 2009. IEEM 2009. IEEE International Conference on

Date of Conference:

8-11 Dec. 2009