Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services

Journals

  • IJIEC (777)
  • MSL (2643)
  • DSL (690)
  • CCL (528)
  • USCM (1092)
  • ESM (421)
  • AC (562)
  • JPM (293)
  • IJDS (952)
  • JFS (101)
  • HE (32)
  • SCI (26)

IJIEC Volumes

    • Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)
    • Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • Volume 3 (76)
      • Issue 1 (9)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • Volume 17 (51)
      • Issue 1 (21)
      • Issue 2 (30)

Keywords

Supply chain management(168)
Jordan(165)
Vietnam(151)
Customer satisfaction(120)
Performance(115)
Supply chain(112)
Service quality(98)
Competitive advantage(97)
Tehran Stock Exchange(94)
SMEs(89)
optimization(87)
Sustainability(86)
Artificial intelligence(85)
Financial performance(84)
Trust(83)
TOPSIS(83)
Job satisfaction(81)
Genetic Algorithm(78)
Factor analysis(78)
Social media(78)


» Show all keywords

Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(66)
Mohammad Reza Iravani(64)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(40)
Dmaithan Almajali(37)
Jumadil Saputra(36)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Barween Al Kurdi(32)
Hassan Ghodrati(31)
Basrowi Basrowi(31)
Sautma Ronni Basana(31)
Mohammad Khodaei Valahzaghard(30)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Haitham M. Alzoubi(28)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)


» Show all authors

Countries

Iran(2192)
Indonesia(1311)
Jordan(813)
India(793)
Vietnam(510)
Saudi Arabia(478)
Malaysia(444)
China(231)
United Arab Emirates(226)
Thailand(160)
United States(114)
Ukraine(110)
Turkey(110)
Egypt(106)
Peru(94)
Canada(93)
Morocco(86)
Pakistan(85)
United Kingdom(80)
Nigeria(78)


» Show all countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 9 Issue 3 pp. 369-396 , 2018

A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services Pages 369-396 Right click to download the paper Download PDF

Authors: Eduyn López-Santana, William Camilo Rodríguez-Vásquez, Germán Méndez-Giraldo

DOI: 10.5267/j.ijiec.2017.8.001

Keywords: Courier services, Clustering, Expert system, Routing, Scheduling

Abstract: This paper focuses on the problem of scheduling and routing workers in a courier service to deliver packages for a set of geographically distributed customers and, on a specific date and time window. The crew of workers has a limited capacity and a time window that represents their labor length. The problem deals with a combination of multiples variants of the vehicle routing problem as capacity, multiple periods, time windows, due dates and distance as constraints. Since in the courier services the demands could be of hundreds or thousands of packages to be delivered, the problem is computationally unmanageable. We present a three-phase solution approach. In the first phase, a scheduling model determines the visit date for each customer in the planning horizon by considering the release date, due date to visit and travel times. We use an expert system based on the know-how of the courier service, which uses an inference engine that works as a rule interpreter. In the second phase, a clustering model assigns, for each period, customers to workers according to the travel times, maximum load capacity and customer’s time windows. We use a centroid based and sweep algorithms to solve the resulted problem. Finally, in the third phase, a routing model finds the order in which each worker will visit all customers taking into account their time windows and worker’s available time. To solve the routing problem we use an Ant Colony Optimization metaheuristic. We present some numerical results using a case study, in which the proposed method of this paper finds better results in comparison with the current method used in the case study.

How to cite this paper
López-Santana, E., Rodríguez-Vásquez, W & Méndez-Giraldo, G. (2018). A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services.International Journal of Industrial Engineering Computations , 9(3), 369-396.

Refrences
Almoustafa, S., Hanafi, S., & Mladenović, N. (2013). New exact method for large asymmetric distance-constrained vehicle routing problem. European Journal of Operational Research, 226(3), 386–394. Journal Article. https://doi.org/10.1016/j.ejor.2012.11.040
Archetti, C., Jabali, O., & Speranza, M. G. (2015). Multi-period Vehicle Routing Problem with Due dates. Computers & Operations Research, 61, 122–134. https://doi.org/10.1016/j.cor.2015.03.014
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016). The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering, 99, 300–313. https://doi.org/10.1016/j.cie.2015.12.007
Cacchiani, V., Hemmelmayr, V. C., & Tricoire, F. (2014). A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics (Amsterdam, Netherlands : 1988), 163(Pt 1), 53–64. https://doi.org/10.1016/j.dam.2012.08.032
Chang, T.-S., & Yen, H.-M. (2012). City-courier routing and scheduling problems. European Journal of Operational Research, 223(2), 489–498. https://doi.org/10.1016/j.ejor.2012.06.007
Cheng, C.-B., & Mao, C.-P. (2007). A modified ant colony system for solving the travelling salesman problem with time windows. Mathematical and Computer Modelling, 46(9–10), 1225–1235. Journal Article. https://doi.org/10.1016/j.mcm.2006.11.035
Chu, F., Labadi, N., & Prins, C. (2006). A Scatter Search for the periodic capacitated arc routing problem. European Journal of Operational Research, 169(2), 586–605. https://doi.org/10.1016/j.ejor.2004.08.017
Clarke, G. u, & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581. Journal Article. https://doi.org/10.1287/opre.12.4.568
Díez, R. P., Gómez, A. G., & Martínez, N. de A. (2001). Introduction to Artificial Intelligence: Expert Systems, Artificial Neural Networks, and Evolutionary Computation. Universidad de Oviedo.
Ding, Q., Hu, X., Sun, L., & Wang, Y. (2012). An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing, 98, 101–107. Journal Article. https://doi.org/10.1016/j.neucom.2011.09.040
Dios, M., & Framinan, J. M. (2016). A review and classification of computer-based manufacturing scheduling tools. Computers and Industrial Engineering, 99, 229–249. https://doi.org/10.1016/j.cie.2016.07.020
Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 57(4), 1472–1483. Journal Article. https://doi.org/10.1016/j.cie.2009.05.009
Farahani, R. Z., Rezapour, S., & Kardar, L. (2011). Logistics Operations and Management. Book, Elsevier. https://doi.org/10.1016/C2010-0-67008-8
Fikar, C., & Hirsch, P. (2015). A matheuristic for routing real-world home service transport systems facilitating walking. Journal of Cleaner Production, 105, 300–310. https://doi.org/10.1016/j.jclepro.2014.07.013
Francis, P., Smilowitz, K., & Tzur, M. (2006). The Period Vehicle Routing Problem with Service Choice. Transportation Science, 40(4), 439–454. https://doi.org/10.1287/trsc.1050.0140
Galindres-Guancha, L. F., Toro-Ocampo, E. M., & Gallego- Rendón, R. A. (2018). Multi-objective MDVRP solution considering route balance and cost using the ILS metaheuristic. International Journal of Industrial Engineering Computations, 9(1), 33–46. https://doi.org/10.5267/j.ijiec.2017.5.002
Ghiani, G., Manni, E., Quaranta, A., & Triki, C. (2009). Anticipatory algorithms for same-day courier dispatching. Transportation Research Part E: Logistics and Transportation Review, 45(1), 96–106. https://doi.org/10.1016/j.tre.2008.08.003
Gillett, B. E., & Miller, L. R. (1974). A Heuristic Algorithm for the Vehicle-Dispatch Problem. Operations Research, 22(2), 340–349. https://doi.org/10.1287/opre.22.2.340
Glover, F. W., & Kochenberger, G. A. (2003). Handbook of metaheuristics. (G. Fred & Gary A. Kochenberger, Eds.) (Vol. 57). Book, Springer US. https://doi.org/10.1007/b101874
Janssens, J., Van den Bergh, J., Sörensen, K., & Cattrysse, D. (2015). Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning. European Journal of Operational Research, 242(1), 222–231. https://doi.org/10.1016/j.ejor.2014.09.026
Jia, H., Li, Y., Dong, B., & Ya, H. (2013). An Improved Tabu Search Approach to Vehicle Routing Problem. Procedia - Social and Behavioral Sciences, 96, 1208–1217. https://doi.org/10.1016/j.sbspro.2013.08.138
Kara, I., & Derya, T. (2015). Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows. Procedia Economics and Finance, 26, 1026–1034. https://doi.org/10.1016/S2212-5671(15)00926-0
Kek, A. G. H., Cheu, R. L., & Meng, Q. (2008). Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots. Mathematical and Computer Modelling, 47(1–2), 140–152. https://doi.org/10.1016/j.mcm.2007.02.007
Krishnamoorthy, C. S., & Rajeev, S. (1996). Artificial intelligence and expert systems for engineers. Boca Raton: CRC Press.
Küçükoğlu, İ., & Öztürk, N. (2015). An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Computers & Industrial Engineering, 86, 60–68. https://doi.org/10.1016/j.cie.2014.10.014
Kusiak, A. (1990). Intelligent manufacturing systems. London: Prentice Hall International.
Lin, C., Choy, K. L., Ho, G. T. S., Lam, H. Y., Pang, G. K. H., & Chin, K. S. (2014). A decision support system for optimizing dynamic courier routing operations. Expert Systems with Applications, 41(15), 6917–6933. https://doi.org/10.1016/j.eswa.2014.04.036
Lin, C. K. Y. (2011). A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources. Computers & Operations Research, 38(11), 1596–1609. https://doi.org/10.1016/j.cor.2011.01.021
Liu, R., Xie, X., Augusto, V., & Rodriguez, C. (2013). Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. European Journal of Operational Research, 230(3), 475–486. https://doi.org/10.1016/j.ejor.2013.04.044
López-Ibáñez, M., & Blum, C. (2010). Beam-ACO for the travelling salesman problem with time windows. Computers & Operations Research, 37(9), 1570–1583. Journal Article. https://doi.org/10.1016/j.cor.2009.11.015
López-Santana, E. R., & Méndez-Giraldo, G. A. (2016). A Knowledge-Based Expert System for Scheduling in Services Systems. In J. C. Figueroa-García, E. R. López-Santana, & R. Ferro-Escobar (Eds.), Applied Computer Sciences in Engineering WEA 2016 (pp. 212–224). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-50880-1_19
López-Santana, E. R., & Romero Carvajal, J. de J. (2015). A hybrid column generation and clustering approach to the school bus routing problem with time windows. Ingeniería, 20(1), 111–127. https://doi.org/http://dx.doi.org/10.14483/udistrital.jour.reving.2015.1.a07
Malmborg, C. J. (2000). Current modeling practices in bank courier scheduling. Applied Mathematical Modelling, 24(4), 315–325. https://doi.org/10.1016/S0307-904X(99)00044-X
Méndez-Giraldo, G., Álvarez, L., Caicedo, C., & Malaver, M. (2013). Expert system for scheduling production-research and development of a prototype (1st ed.). Colombia: Universidad Distrital Francisco José de Caldas.
Nagarajan, V., & Ravi, R. (2012). Approximation algorithms for distance constrained vehicle routing problems. Networks, 59(2), 209–214. https://doi.org/10.1002/net.20435
Patiño Chirva, J. A., Daza Cruz, Y. X., & López-Santana, E. R. (2016). A Hybrid Mixed-Integer Optimization and Clustering Approach to Selective Collection Services Problem of Domestic Solid Waste. Ingeniería, 21(2), 235–247. https://doi.org/http://dx.doi.org/10.14483/udistrital.jour.reving.2016.2.a09
Pereira, F. B., & Tavares, J. (2009). Bio-inspired Algorithms for the Vehicle Routing Problem. (F. B. Pereira & J. Tavares, Eds.). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-540-85152-3
Pillac, V., Guéret, C., & Medaglia, A. L. (2012). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters, 1–11. https://doi.org/10.1007/s11590-012-0567-4
Pureza, V., Morabito, R., & Reimann, M. (2012). Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW. European Journal of Operational Research, 218(3), 636–647. https://doi.org/10.1016/j.ejor.2011.12.005
Rincon-Garcia, N., Waterson, B. J., & Cherrett, T. J. (2017). A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. International Journal of Industrial Engineering Computations, 8(1), 141–160. https://doi.org/10.5267/j.ijiec.2016.6.002
Rodríguez-Vásquez, W. C., López-Santana, E. R., & Méndez-Giraldo, G. A. (2016). Proposal for a Hybrid Expert System and an Optimization Model for the Routing Problem in the Courier Services. In J. C. Figueroa-García, E. R. López-Santana, & R. Ferro-Escobar (Eds.), Applied Computer Sciences in Engineering WEA 2016 (pp. 141–152). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-50880-1_13
Rodriguez, S., Correa, D., & López-Santana, E. (2015). An Alternative Iterative Method to Periodic Vehicle Routing Problem. In S. Cetinkaya and J. K. Ryan (Ed.), IIE Annual Conference and Expo 2015 (pp. 2001–2010).
Sahin, S., Tolun, M. R., & Hassanpour, R. (2012). Hybrid expert systems: A survey of current approaches and applications. Expert Systems with Applications, 39(4), 4609–4617. https://doi.org/10.1016/j.eswa.2011.08.130
Shin, K., & Han, S. (2012). A Centroid-based Heuristic Algorithm for the Capacitated Vehicle Routing Problem. Computing and Informatics, 30(4), 721–732. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/192
Sprenger, R., & Mönch, L. (2012). A methodology to solve large-scale cooperative transportation planning problems. European Journal of Operational Research, 223(3), 626–636. https://doi.org/10.1016/j.ejor.2012.07.021
Tlili, T., Faiz, S., & Krichen, S. (2014). A Hybrid Metaheuristic for the Distance-constrained Capacitated Vehicle Routing Problem. Procedia - Social and Behavioral Sciences, 109, 779–783. https://doi.org/10.1016/j.sbspro.2013.12.543
Toth, P., & Vigo, D. (2002). The vehicle routing problem. Optimization (Vol. 9). Philadelphia: SIAM. https://doi.org/10.1137/1.9780898718515
Turban, E. (1989). Decision support and expert systems: management support systems (2nd ed.). Book, Prentice Hall PTR.
Wagner, W. P. (2017). Trends in expert system development: A longitudinal content analysis of over thirty years of expert system case studies. Expert Systems with Applications, 76, 85–96. https://doi.org/10.1016/j.eswa.2017.01.028
Yan, S., Lin, J.-R., & Lai, C.-W. (2013). The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands. Transportation Research Part E: Logistics and Transportation Review, 53, 34–48. https://doi.org/10.1016/j.tre.2013.01.011
Yu, B., Yang, Z. Z., & Yao, B. Z. (2011). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications, 38(1), 435–441. https://doi.org/10.1016/j.eswa.2010.06.082
  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2018 | Volume: 9 | Issue: 3 | Views: 3422 | Reviews: 0

Related Articles:
  • Variable neighborhood search algorithm for the green vehicle routing proble ...
  • A heuristic algorithm based on tabu search for vehicle routing problems wit ...
  • Performance evaluation of a GRASP-based approach for stochastic scheduling ...
  • A hybrid metaheuristic for the time-dependent vehicle routing problem with ...
  • Integrating packing and distribution problems and optimization through math ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com