Located Multiple Depots and Vehicles Routing with Capacity Problem
Locating and routing problems are important issues in the world and many researchers have researched on this subject. But sometimes we should consider the problems together to solve them. In this paper, first we aim at locating some depots station in orde
- PDF / 283,097 Bytes
- 12 Pages / 439.37 x 666.142 pts Page_size
- 76 Downloads / 182 Views
Located Multiple Depots and Vehicles Routing with Capacity Problem Masoud Amel Monirian, Shabnam Mahmoudzadeh Vaziri and Asadollah Mahmoudzadeh Vaziri
Abstract Locating and routing problems are important issues in the world and many researchers have researched on this subject. But sometimes we should consider the problems together to solve them. In this paper, first we aim at locating some depots station in order to meet demand points (MeLRPC). According to high costs or inaccessibility to all points, the demand of limited points can meet. The second purpose is to determine optimal points that a vehicle should visit in its route, so that total distance of unvisited points from nearest covered point, reach its minimum amount. Unvisited points can refer to nearest station and supply their needs. In this paper we use simulated annealing algorithm to solve the model. Keywords Locating-routing · Simulated annealing algorithm limited capacity · Median tour
·
Vehicles with
52.1 Introduction The Location-routing problem is one of the major issues in today’s world that in the last three decades has attracted a lot of attention to itself and recently many surveys are done about these problems [7, 8, 25]. In general, location-routing models want to find an appropriate number and location of service facilities and also determine the distribution routes and the movement of vehicles to reduce costs, simultaneously [21]. Thus, in the logistics discussion, this issue had has a special place in reducing costs and much attention is assigned to it.
M.A. Monirian (B) · S.M. Vaziri Faculty of Engineering, Industrial Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran e-mail: [email protected] A.M. Vaziri Faculty of Mathematical Science and Statistics, Department of Mathematics, University of Birjand, Birjand, Iran © Springer Science+Business Media Singapore 2017 J. Xu et al. (eds.), Proceedings of the Tenth International Conference on Management Science and Engineering Management, Advances in Intelligent Systems and Computing 502, DOI 10.1007/978-981-10-1837-4_52
619
620
M.A. Monirian et al.
Although most of these operational issues imply on the distribution of goods from the warehouse to customers, but cover some other efficient applications such as food distribution [32], newspapers distribution [12, 19], garbage collection [15], receipt delivery [17], military programs [22], package delivery [4, 31] and goods distribution for different customers [1]. The Location-routing has been constituted of two parts of placement (location) of facilities and vehicle routing. In other words, determining number of depots and finding the right places to build them on (FLP) and the allocation of appropriate routes to vehicles for acquiring demand of customers (VRP) is included in two separate problems which, LRP considers these two issues simultaneously to reduce costs, because the overall system costs will be very high if, locating these depots are made regardless of routing decisions. Considering that, both the V
Data Loading...
