Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32146
Optimizing Logistics for Courier Organizations with Considerations of Congestions and Pickups: A Courier Delivery System in Amman as Case Study

Authors: Nader A. Al Theeb, Zaid Abu Manneh, Ibrahim Al-Qadi


Traveling salesman problem (TSP) is a combinatorial integer optimization problem that asks "What is the optimal route for a vehicle to traverse in order to deliver requests to a given set of customers?”. It is widely used by the package carrier companies’ distribution centers. The main goal of applying the TSP in courier organizations is to minimize the time that it takes for the courier in each trip to deliver or pick up the shipments during a day. In this article, an optimization model is constructed to create a new TSP variant to optimize the routing in a courier organization with a consideration of congestion in Amman, the capital of Jordan. Real data were collected by different methods and analyzed. Then, concert technology - CPLEX was used to solve the proposed model for some random generated data instances and for the real collected data. At the end, results have shown a great improvement in time compared with the current trip times, and an economic study was conducted afterwards to figure out the impact of using such models.

Keywords: Travel salesman problem, congestions, pick-up, integer programming, package carriers, service engineering.

Digital Object Identifier (DOI):

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 802


[1] Bhattacharyya, M., & Bandyopadhyay, A. K. (2008). On single courier problem. Optimization Letters, 2(4), 535-541.
[2] Singh, R., Tugave, G., & Patil, P. (2014). Cost optimization of courier dispatch system using genetic algorithm. International Journal of Management, IT and Engineering, 4(6), 91-97.
[3] Sesekin, A. N., Chentsov, A. A., & Chentsov, A. G. (2010). A generalized courier problem with the cost function depending on the list of tasks. Journal of Computer and Systems Sciences International, 49(2), 234-243.
[4] Chang, T. S., & Yen, H. M. (2012). City-courier routing and scheduling problems. European Journal of Operational Research, 223(2), 489-498.
[5] Avila, L. L., Elezi, F., Caridi, M., & Lindemann, U. (2011, December). Improving dispatch operations in complex courier organizations. In Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on (pp. 1289-1294). IEEE.
[6] Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2011). The traveling salesman problem: a computational study. Princeton university press.
[7] Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 57(4), 1472-1483.