Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

Journals

  • IJIEC (747)
  • MSL (2643)
  • DSL (668)
  • CCL (508)
  • USCM (1092)
  • ESM (413)
  • AC (562)
  • JPM (271)
  • IJDS (912)
  • JFS (96)
  • 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 (21)
      • Issue 1 (21)

Keywords

Supply chain management(166)
Jordan(161)
Vietnam(149)
Customer satisfaction(120)
Performance(113)
Supply chain(111)
Service quality(98)
Competitive advantage(95)
Tehran Stock Exchange(94)
SMEs(87)
optimization(86)
Trust(83)
TOPSIS(83)
Financial performance(83)
Sustainability(82)
Job satisfaction(80)
Factor analysis(78)
Social media(78)
Artificial intelligence(77)
Knowledge Management(77)


» Show all keywords

Authors

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


» Show all authors

Countries

Iran(2184)
Indonesia(1290)
India(788)
Jordan(786)
Vietnam(504)
Saudi Arabia(453)
Malaysia(441)
United Arab Emirates(220)
China(206)
Thailand(153)
United States(111)
Turkey(106)
Ukraine(104)
Egypt(98)
Canada(92)
Peru(88)
Pakistan(85)
United Kingdom(80)
Morocco(79)
Nigeria(78)


» Show all countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 8 Issue 3 pp. 283-302 , 2017

Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach Pages 283-302 Right click to download the paper Download PDF

Authors: Hossein Yousefi, Reza Tavakkoli-Moghaddam, Mahyar Taheri Bavil Oliaei, Mohammad Mohammadi, Ali Mozaffari

DOI: 10.5267/j.ijiec.2017.1.003

Keywords: Vehicle routing problem, Multi-choice goal programming, Customer priority, Customer satisfaction

Abstract: A vehicle routing problem with time windows (VRPTW) is an important problem with many real applications in a transportation problem. The optimum set of routes with the minimum distance and vehicles used is determined to deliver goods from a central depot, using a vehicle with capacity constraint. In the real cases, there are other objective functions that should be considered. This paper considers not only the minimum distance and the number of vehicles used as the objective function, the customer’s satisfaction with the priority of customers is also considered. Additionally, it presents a new model for a bi-objective VRPTW solved by a revised multi-choice goal programming approach, in which the decision maker determines optimistic aspiration levels for each objective function. Two meta-heuristic methods, namely simulated annealing (SA) and genetic algorithm (GA), are proposed to solve large-sized problems. Moreover, the experimental design is used to tune the parameters of the proposed algorithms. The presented model is verified by a real-world case study and a number of test problems. The computational results verify the efficiency of the proposed SA and GA.

How to cite this paper
Yousefi, H., Tavakkoli-Moghaddam, R., Oliaei, M., Mohammadi, M & Mozaffari, A. (2017). Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach.International Journal of Industrial Engineering Computations , 8(3), 283-302.

Refrences
Afshar-Bakeshloo, M, Mehrabi, A, Safari, H, Maleki, M, & Jolai, F. (2016). A green vehicle routing problem with customer satisfaction criteria. Journal of Industrial Engineering International, 12(4), 529-544.
Aouni, B., Martel, J. M., & Hassaine, A. (2009). Fuzzy goal programming model: an overview of the current state‐of‐the art. Journal of Multi‐Criteria Decision Analysis, 16(5‐6), 149-161.
Archetti, C., Speranza, M. G., & Vigo, D. (2014). Vehicle routing problems with profits. Vehicle Routing: Problems, Methods, and Applications, 18, 273.
Barkaoui, M., Berger, J., & Boukhtouta, A. (2015). Customer satisfaction in dynamic vehicle routing problem with time windows. Applied Soft Computing, 35, 423-432.
Belhaiza, S., Hansen, P., & Laporte, G. (2014). A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Computers & Operations Research, 52, 269-281.
Calvete, H. I., Galé, C., Oliveros, M. J., & Sánchez-Valverde, B. (2007). A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research, 177(3), 1720-1733.
Castro-Gutierrez, J., Landa-Silva, D., & Pérez, J. M. (2011, October). Nature of real-world multi-objective vehicle routing with evolutionary algorithms. In Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on (pp. 257-264). IEEE.
Chang, C. T. (2007). Multi-choice goal programming. Omega, 35(4), 389-396.
Chang, C. T. (2008). Revised multi-choice goal programming. Applied Mathematical Modelling, 32(12), 2587-2595.
Charnes, A., & Cooper, W. W. (1957). Management models and industrial applications of linear programming. Management Science, 4(1), 38-91.
da Silva, A. F., Marins, F. A. S., & Montevechi, J. A. B. (2013). Multi-choice mixed integer goal programming optimization for real problems in a sugar and ethanol milling company. Applied Mathematical Modelling, 37(9), 6146-6162.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
Delage, E., Bostel, N., Dejax, P., & Gendreau, M. (2010). Re-optimization of technician tours in dynamic environments with stochastic service time. Rapport de stage du Master ORO.
Dubois, D., & Perny, P. (2016). A Review of Fuzzy Sets in Decision Sciences: Achievements, Limitations and Perspectives. In Multiple Criteria Decision Analysis (pp. 637-691). Springer New York.
Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 57(4), 1472-1483.
Forslund, H., & Jonsson, P. (2010). Integrating the performance management process of on-time delivery with suppliers. International Journal of Logistics: Research and Applications, 13(3), 225-241.
Gehring, H., & Homberger, J. (2002). Parallelization of a two-phase metaheuristic for routing problems with time windows. Journal of heuristics, 8(3), 251-276.
Ghannadpour, S. F., Noori, S., & Tavakkoli-Moghaddam, R. (2014). A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority. Journal of Combinatorial Optimization, 28(2), 414-446.
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.
Goncalves, G., Hsu, T., & Xu, J. (2009). Vehicle routing problem with time windows and fuzzy demands: an approach based on the possibility theory. International Journal of Advanced Operations Management, 1(4), 312-330.
Hashimoto, H., Ibaraki, T., Imahori, S., & Yagiura, M. (2006). The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics, 154(16), 2271-2290.
HO, C. J. (1989). Evaluating the impact of operating environments on MRP system nervousness. The International Journal of Production Research, 27(7), 1115-1135.
Hong, S. C., & Park, Y. B. (1999). A heuristic for bi-objective vehicle routing with time window constraints. International Journal of Production Economics, 62(3), 249-258.
Huang, M., & Hu, X. (2012). Large scale vehicle routing problem: An overview of algorithms and an intelligent procedure. Int. J. Innov. Comput. Inf. Control, 8, 5809-5819.
Jiménez, M., Arenas, M., Bilbao, A., & Rodrı, M. V. (2007). Linear programming with fuzzy parameters: an interactive method resolution. European Journal of Operational Research, 177(3), 1599-1609.
Jones, D. F., Mirrazavi, S. K., & Tamiz, M. (2002). Multi-objective meta-heuristics: An overview of the current state-of-the-art. European journal of operational research, 137(1), 1-9.
Jones, D., & Tamiz, M. (2016). A review of goal programming. In Multiple Criteria Decision Analysis (pp. 903-926). Springer New York.
Kirkpatrick, S. (1984). Optimization by simulated annealing: Quantitative studies. Journal of statistical physics, 34(5-6), 975-986.
Lai, K. K., Liu, B., & Peng, J. (2003). Vehicle routing problem with fuzzy travel times and its genetic algorithm. Technical Report.
Lai, Y. J., & Hwang, C. L. (1992). A new approach to some possibilistic linear programming problems. Fuzzy sets and systems, 49(2), 121-133.
Lee, C., Lee, K., & Park, S. (2012). Robust vehicle routing problem with deadlines and travel time/demand uncertainty. Journal of the Operational Research Society, 63(9), 1294-1306.
Liao, C. N., & Kao, H. P. (2010). Supplier selection model using Taguchi loss function, analytical hierarchy process and multi-choice goal programming. Computers & Industrial Engineering, 58(4), 571-577.
Melián-Batista, B., De Santiago, A., AngelBello, F., & Alvarez, A. (2014). A bi-objective vehicle routing problem with time windows: A real case in Tenerife. Applied Soft Computing, 17, 140-152.
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The journal of chemical physics, 21(6), 1087-1092.
Moghadam, B., & Seyedhosseini, S. (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.
Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jiménez, H. F., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79, 115-129.
Ombuki-Berman, B., & Hanshar, F. T. (2009). Using genetic algorithms for multi-depot vehicle routing. In Bio-inspired algorithms for the vehicle routing problem (pp. 77-99). Springer Berlin Heidelberg.
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.
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1-11.
Pishvaee, M. S., & Razmi, J. (2012). Environmental supply chain network design using multi-objective fuzzy mathematical programming. Applied Mathematical Modelling, 36(8), 3433-3446.
Rath, S., Gendreau, M., & Gutjahr, W. J. (2015). Bi‐objective stochastic programming models for determining depot locations in disaster relief operations. International Transactions in Operational Research.
Rincon-Garcia, N., Waterson, B., & Cherrett, T. (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.
Chávez, J., Escobar, J & Echeverri, M. (2016). A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls.International Journal of Industrial Engineering Computations , 7(1), 35-48.
Sivaramkumar, V., Thansekhar, M. R., Saravanan, R., & Amali, S. M. J. (2015). Multi-objective vehicle routing problem with time windows: Improving customer satisfaction by considering gap time. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 0954405415586608.
Subramanian, P., Ramkumar, N., Narendran, T. T., & Ganesh, K. (2013). PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem. Applied Soft Computing, 13(2), 1121-1135.
Taş, D., Dellaert, N., Van Woensel, T., & De Kok, T. (2013). Vehicle routing problem with stochastic travel times including soft time windows and service costs. Computers & Operations Research, 40(1), 214-224.
Torabi, S. A., & Hassini, E. (2008). An interactive possibilistic programming approach for multiple objective supply chain master planning. Fuzzy Sets and Systems, 159(2), 193-214.
Zheng, Y., & Liu, B. (2006). Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm. Applied mathematics and computation, 176(2), 673-683.
Zografos, K. G., & Androutsopoulos, K. N. (2004). A heuristic algorithm for solving hazardous materials distribution problems. European Journal of Operational Research, 152(2), 507-519.
  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2017 | Volume: 8 | Issue: 3 | Views: 3526 | Reviews: 0

Related Articles:
  • Vehicle routing problem with considering multi-middle depots for perishable ...
  • A multi-objective location routing problem using imperialist competitive al ...
  • Integrating packing and distribution problems and optimization through math ...
  • A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle R ...
  • A generalized multi-depot vehicle routing problem with replenishment based ...

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