[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
:: Volume 6, Number 4 (6-2017) ::
JGST 2017, 6(4): 173-184 Back to browse issues page
Optimization of Pick up and Delivery Problem of Postal Service between the Centers by Capacitated Vehicles based on Metahuristic Algorithms
K. Kabiri , M. Saadi Mesgari
Abstract:   (469 Views)

The development of effective decision support tools that can be adopted in the transportation industry is vital since it can lead to substantial cost reduction and efficient resource consumption. However, vehicles moving on our roads contribute to congestion, noise، pollution, and accidents. So route planning and transport management, using optimization tools, can help reduce transport costs by cutting mileage and improving driver and vehicle usage. In addition, it can improve customer service, cut carbon emissions, improve strategic decision making and reduce administration costs.

Due to the simultaneous pick-up and delivery postal service and delivery time importance of those parcels, this study focuses on the pick-up and delivery problems. The pick-up and delivery problems are important types of vehicle routing problem (VRP). VRP is the core of scientific research on the distribution and transport of people and goods. Unlike the classical VRP, in which all customers require the same services, in the pick-up and delivery problem basic it is considered that two different types of services can be found in one place, in fact there's a pick up or delivery. PDP has several applications in the transportation of pick-up and delivery parcel post. The purpose of this research is to find the most optimal route to transport postal service. It is performed by imposing a series of conditions to the pick-up and delivery problems using meta-heuristic algorithms for the simulation data. It is followed by brief explanation of present metaheuristic algorithms including bee colony algorithm and genetic algorithms and their features. Finally the results of the algorithms are compared on the basis of the accuracy, repeatability, speed of convergence. It is necessary to note that the results are not ideal, but the best case is considered. The results showed the performance of the bee algorithm are better than genetic. Based on the results obtained in each run, genetic algorithms and Bee were 84% and 93% are possible to achieve the best solution.

Keywords: Optimization, Pickup and Delivery Problem with Time Windows, Meta-Heuristic, Artificial bee Colony Algorithm, Genetic Algorithm
Full-Text [PDF 1060 kb]   (204 Downloads)    
Type of Study: Research | Subject: GIS
Send email to the article author

Add your comments about this article
Your username or email:

Write the security code in the box >



XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Kabiri K, Saadi Mesgari M. Optimization of Pick up and Delivery Problem of Postal Service between the Centers by Capacitated Vehicles based on Metahuristic Algorithms. JGST. 2017; 6 (4) :173-184
URL: http://jgst.issge.ir/article-1-443-en.html
Volume 6, Number 4 (6-2017) Back to browse issues page
نشریه علمی پژوهشی علوم و فنون نقشه برداری Journal of Geomatics Science and Technology