Incorporating Vehicle Routing, Location and Supplier Selection Problems for Reducing Pollutants Emission

다국어 초록 (Multilingual Abstract)

Vehicle routing, location and supplier selection problems are the most practical and challenging problems of the supply chain management. The particular attention to these problems is due to their high practicality in real world and the difficulty of solving. Therefore, the present paper attempts to offer a combined model of vehicle routing, location and supplier selection problems with more compatibility with the real-world problems. Moreover, the proposed model will attempt to reduce the fuel consumption rate (FCR) of vehicles and pollutant emissions simultaneously. Because the problem is NP-hard, meta-heuristic algorithms including simulated annealing (SA), Tabu search algorithm (TS), bat algorithm (BA) and variable neighborhood search algorithm based on simulated annealing (VNS-SA) are used for solving the large dimensions of the problem. For smaller dimensions of the problem, several numerical examples are generated and solved by GAMS Software and meta-heuristic algorithms of SA, TS, BA, and VNS-SA. Then, the results are compared for verification of the solution methods’ efficiency. In the rest of the paper, a real example is offered as an example of real-world problems and solved by metaheuristic algorithms. More clearly, the core problem consists of assigning producers to distribution centers, vehicle routing and service of distribution centers to clients in a supply chain of natural honey.

목차 (Table of Contents)

• ABSTRACT
• 1. INTRODUCTION
• 2. PROBLEM DESCRIPTION AND FORMULATION
• 3. SOLUTION METHODOLOGY
• 4. COMPUTATIONAL EXPERIMENTS
• 5. CONCLUSION AND FURTHER SUGGESTIONS
• REFERENCES

참고문헌 (Reference)

1 Dantzig, G, "The truck dispatching problem" 6 (6): 80-91, 1959

2 Bektas, T, "The pollution-routing problem" 45 (45): 1232-1250, 2011

3 Salhi, S., "The multidepot vehicle routing problem with hetero-geneous vehicle fleet: Formulation and a variable neighborhood search implementation" 52 (52): 315-325, 2013

4 Fisher, M., "The Lagrange relaxation method for solving integer programming problems" 27 (27): 1-18, 1981

5 Martínez-Salazar, I. A., "Solving a bi-objective transportation location routing problem by metaheuristic algorithms" 234 (234): 25-36, 2014

6 Barmel, J, "On the effectiveness of set covering formulation for the vehicle routing problem with time windows" 45 (45): 295-301, 1997

7 Yang, X., "Nature-inspired metaheuristic algorithms" Luniver Press 2008

8 Hamidi, M., "Modeling a four-layer location routing problem" 3 (3): 43-52, 2012

9 Dantzig, G. B, "Minimizing the number of tankers to meet a fixed schedule" 1 (1): 217-222, 1954

10 Nagy, G, "Location-routing: Issues, models and methods" 177 (177): 649-672, 2007

11 Ghiani, G., "Introduction to Logistics System Planning and Control, West Sussex" John Wiley & Sons Inc 2004

12 Balakrishnan, A., "Integrated facility location and vehicle routing models:Recent work and future prospects" 7 (7): 35-61, 1987

13 Berman, O., "Facility Location: A Survey of Applications and Methods" Springer 427-452, 1995

14 Laport, G, "Exact algorithm for the vehicle routing problem, surveys in Combination oriel Optimization" 132 : 147-184, 1987

15 Barth, M, "Energy and emissions impacts of a freeway-based dynamic ecodriving system" 14 (14): 400-410, 2009

16 Barth, M., "Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model" California PATH Program, Institute of Transportation Studies, University of California at Berkeley 2005

17 Glover, F, "Converting the 0-1 polynomial programming problem to a 0-1 linear program" 22 (22): 180-182, 1974

18 Lenstra, J. K, "Complexity of vehicle routing and scheduling problems" 11 (11): 221-227, 1981

19 Min, H., "Combined location-routing problems: A synthesis and future research directions" 108 (108): 1-15, 1998

20 Yang, X, "Bat algorithm: A novel approach for global engineering optimization" 29 (29): 464-483, 2012

21 Tsai, P. W., "Bat algorithm inspired algorithm for solving numerical optimization problems" 148-149 : 134-137, 2012

22 Xu, Y, "An improved variable neighborhood search algorithm for multi-depot heterogeneous vehicle routing problem based on hybrid operators" 7 (7): 299-316, 2014

23 Kuo, Y, "A variable neighborhood search for the multi-depot vehicle routing problem with loading cost" 39 (39): 6949-6954, 2012

24 Tuzun, D, "A two-phase tabu search approach to the location routing problem" 116 (116): 87-99, 1999

25 Prodhon, C, "A survey of recent research on location-routing problems" 238 (238): 1-17, 2014

26 Laporte, G., "A survey of algorithms for locationrouting problems" 1 : 93-123, 1989

27 Yu, V. F., "A simulated annealing heuristic for the capacitated location-routing problem" 58 (58): 288-299, 2010

28 Xu, Y., "A new variable neighborhood search algorithm for the multi-depot heterogeneous vehicle routing problem with time windows" 39 (39): 289-296, 2012

29 Norouzi, N., "A new multiobjective competitive open vehicle routing problem solved by particle swarm optimization" 12 (12): 609-633, 2012

30 Yang, X., "A new metaheuristic bat-inspired algorithm" 284 : 65-74, 2010

31 Hamidi, M., "A heuristic algorithm for a multi-product four-layer capacitated location-routing problem" 5 (5): 87-100, 2014

32 Laport, G., "A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems" 43 (43): 469-481, 1992