Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

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)
Sautma Ronni Basana(31)
Basrowi Basrowi(31)
Hassan Ghodrati(31)
Mohammad Khodaei Valahzaghard(30)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)
Haitham M. Alzoubi(28)


» Show all authors

Countries

Iran(2190)
Indonesia(1311)
Jordan(813)
India(793)
Vietnam(510)
Saudi Arabia(477)
Malaysia(444)
China(231)
United Arab Emirates(226)
Thailand(160)
United States(114)
Ukraine(110)
Turkey(110)
Egypt(105)
Peru(94)
Canada(92)
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 11 Issue 2 pp. 299-316 , 2020

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem Pages 299-316 Right click to download the paper Download PDF

Authors: Bouchra Bouziyane, Btissam Dkhissi, Mohammad Cherkaoui

DOI: 10.5267/j.ijiec.2019.7.003

Keywords: Multiobjective Optimization, Vehicle Routing Problem with Soft Time Windows (VRPSTW), Hybrid Approach

Abstract: This paper is interested in pharmaceuticals distribution which is one of the most important activities and ensures the availability of drug products to a set of customers (pharmacies). The study introduces the Disrupted Vehicle Routing problem with Soft Time Windows since pharmaceutical distributors should respond to increased demands for products to ensure timely and efficient delivery to dynamic demands. We also propose an improved multiobjective local search (IMOLS), which uses methods of neighborhood search such as large neighborhood search (LNS) and variable neighborhood search (VNS) based on a hybrid approach in the optimization of vehicle routes. The algorithm is expected to achieve competitive results compared with previously published studies.

How to cite this paper
Bouziyane, B., Dkhissi, B & Cherkaoui, M. (2020). Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem.International Journal of Industrial Engineering Computations , 11(2), 299-316.

Refrences
Affi, M., Derbel, H., & Jarboui, B. (2018).Variable neighborhood search algorithm for the green vehicle routing problem. International Journal of Industrial Engineering Computations, 9(2),195-204 .
Beasley, J.E. (1983) . Route-_rst cluster-second methods for vehicle routing. Omega, 11(4),403-408.
Bettinelli, A., Ceselli, A., & Righini, G. (2011). A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies, 19(5), 723-740.
Bouziyane, B., Dkhissi, B., & cherkaoui, M.(2018). Solving a dynamic vehicle routing problem with soft time windows based on static problem resolution by a hybrid approach. International Journal f Supply and Operations Management, 5(2), 134-151.
Bouchra, B., Btissam, D., & Mohammad, C. (2018, April). Multiobjective local search based hybrid algorithm for vehicle routing problem with soft time windows. In International Conference on Big Data, Cloud and Applications(pp. 312-325). Springer, Cham.
Campelo, P., Moreira, F.N., Amorim, P., & Almada-Lobo, B. (2019). Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector. European Journal of Operational Research, 273(1), 131-145.
Chiang, W. C., & Russell, R. A. (2004) . A metaheuristic for the vehicle-routing problem with soft time windows. Journal of the Operational Research Society, 55, 1298–1310.
Deb, K., Pratap,A., Agarwal, S., & Meyarivan, T.(2002). A fast and elitist multiobjective genetic algorithm:NSGA-II . IEEE Transactions on Evolutionary Computation, 6(2), 182-197.
Desrochers, M., Lenstra, J.K., Savelsbergh, M. W. S., & Soumis, F. (1988). Vehicle Routing with Time Windows: Optimization and Approxinmation, In B. Golden and A. Assad (eds.) Vehicle Routing: Methods and Studies, Amsterdam: Elsevier Science Publishers.
Dhahri, M., Zidi, k., & Ghedira, K. (2015). A Variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities. Electronic Notes in Discrete Mathematics, 47, 229-236.
Eglese, R., & Zambirinis, S. (2018). Disruption management in vehicle routing and scheduling for road freight transport: a review. Top, 26(1), 1-17.
Figliozzi, M. A. (2010). An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transportation Research Part C: Emerging Technologies, 18(5), 668-679.
Fu, Z., Eglese, R., & Li, L. Y. (2008). A unified tabu search algorithm for vehicle routing problems with soft time windows. Journal of the Operational Research Society, 59(5), 663-673.
Geiger, M.J. (2004). Randomized variable neighborhood search for multi objective optimization, 4th EU/ME: Design and Evaluation of Advanced Hybrid Meta-Heuristics, 34-42.
Ghoseiri, K., & Ghannadpour, S. F. (2010). Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Applied Soft Computing, 10(4), 1096-1107.
Golden, B. L., & Assad, A. A. (1986). OR forum—perspectives on vehicle routing: exciting new developments. Operations Research, 34(5), 803-810.
Golden, B. L., & Assad, A. A. (1988). Vehicle Routing: Methods and Studies. Amsterdam: Elsevier Science Publishers .
Hashimoto, H., Ibaraki, T., Imahori, S., & Yagiura, M.( 2006). The vehicle routing problem with flexible time windows and traveling times . Discrete Applied Mathematics, 154, 2271–2290.
Kaiwartya, O., Kumar, S., Lobiyal, D. K., Tiwari, P. K., Abdullah, A. H., & Hassan, A. N. (2015). Multiobjective dynamic vehicle routing problem and time seed based solution using particle swarm optimization. Journal of Sensors, Article ID 189832, 14 pages.
Kovacs, A. A., Parragh, S. N., & Hartl, R. F. (2015). The multi-objective generalized consistent vehicle routing problem. European Journal of Operational Research, 247(2), 441-458.
De Magalhaes, J. M., & De Sousa, J. P. (2006). Dynamic VRP in pharmaceutical distribution—a case study. Central European Journal of Operations Research, 14(2), 177-192.
Minocha, B., & Tripathi, S. (2011). Solution of time constrained vehicle routing problems using multi-objective hybrid genetic algorithm. International Journal of Computer Sciences and Information Technologies, 2, 2671-2676.
Moghadam, B.F., & Seyedhosseini, S.M. (2010).A particle swarm approach to solve vehicle routing problem with uncertain demand:A drug distribution case study. International Journal of industrial Engineering Computations,1(1),55-64.
Mu, Q., Fu, Z., Lysgaard, J., & Eglese, R. (2011) . Disruption management of the vehicle routing problem with vehicle breakdown. Journal of the Opeational Research Society, 62(4),742-749.
Najera , A.G., & Bullinaria, J.A. (2011). An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 38(1), 287-300.
Ombuki, B., Ross, B. J., & Hanshar, F. (2006). Multi-objective genetic algorithms for vehicle routing problem with time windows. Applied Intelligence, 24(1), 17-30.
Qiuyun, W., Wenbao, J., & Gang,Z. (2013). A novel model and algorithm for solving dynamic vehicle routing problem on goods distribution. Journal of Applied Sciences, 13(22), 5410-5415.
Ropke, S., Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickuo and delivery problem with time windows. Transportation Sciences, 40(4),455-472.
Salani, M., Battarra, M., & Gambardella, L. M. (2016). Exact algorithms for the vehicle routing problem with soft time windows. In Operations Research Proceedings 2014 (pp. 481-486). Springer, Cham.
Setak, M., Azizi, V., Karimi, H., & Jalili, S. (2017). Pickup and delivery supply chain network with semi soft time windows: metaheuristic approach. International Journal of Management Science and Engineering Management, 12(2), 89-95.
Shaw, P. (1998, October). Using constraint programming and local search methods to solve vehicle routing problems. In International conference on principles and practice of constraint programming (pp. 417-431). Springer, Berlin, Heidelberg.
Kumar, V. S., Thansekhar, M. R., Saravanan, R., & Amali, S. M. J. (2014). Solving multi-objective vehicle routing problem with time windows by FAGA. Procedia Engineering, 97, 2176-2185.
Solomon, M. M., & Desrosiers, J. (1988). Survey paper—time window constrained routing and scheduling problems. Transportation Science, 22(1), 1-13.
Sydneyta, V., & Komarudin, (2017) . Optimization of distribution route and schedule with vehicle routing problem with time windows (VRPTW) . Proceedings of the 2017 International Conference on Industrial Design Engineering, 121-126.
Teodor Dimitrov, B. (2016). A vehicle routing planning system for goods distribution in urban areas using google maps and genetic algorithm. International Journal for Traffic & Transport Engineering, 6(2), pp 159-167.
Tricoire, F. (2012). Multi-directional local search. Computers & Operations Research, 39, 3089–3101.
Wang, J., Zhou, Y., Wang, Y., Zhang, J., Chen, ,C. L. P ., Zheng, Z. (2016). Multiobjective Vehicle Routing Problems With Simultaneous Delivery and pickup and time windows: Formulation, instances, and algorithms. IEEE Transactions on Cybernetics, 46(3),582 – 594.
Yu, B., Yang, Z.Z., & Yao, B.Z.(2011). A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications, 38, 435–441.
  • 51
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2020 | Volume: 11 | Issue: 2 | Views: 2125 | Reviews: 0

Related Articles:
  • Variable neighborhood search algorithm for the green vehicle routing proble ...
  • A hybrid metaheuristic for the time-dependent vehicle routing problem with ...
  • Integrating packing and distribution problems and optimization through math ...
  • A generalized multi-depot vehicle routing problem with replenishment based ...
  • A particle swarm approach to solve vehicle routing problem with uncertain d ...

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