An Iterated Local Search Algorithm for Fuel Consumption Optimization of Vehicle Routing Problems

Abstract:

The iterated local search algorithm has been widely used in combinatorial optimization problems. A new fuel consumption objective for the vehicle routing problems was presented in this paper. A fuel consumption modal of the vehicle load is introduced and an improved iterated local search algorithm is used for the problem. An initial solution is generated by the Solomon I1 algorithm, and then the iterated local search algorithm is proposed for the fuel consumption optimization.

• Periodical: Applied Mechanics and Materials (Volumes 148-149)
• Pages: 1248-1251
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.148-149.1248
• Online since: December 2011
• Authors: Xu Dong Wu
• Keywords: Fuel Consumption Optimization, Iterated Local Search, Vehicle Routing Problem (VRP)

References

[1] Zhendong PAN, Jiafu TANG, Yi HAN. Vehicle routing problem with weight coefficients, Journal of Management Sciences in China, Vol. 10( 3) (2007), p.23 ~29.

[2] Xiaobo WANG, Yijun LI, Research on Optimization of VRPTW Based on Improved Two Phase Algorithm under Electronic Commerce, Chinese Journal of Management Science, Vol., 15(6)( 2007), p.52~59.

[3] Tao ZHANG, Shan-shan WANG, Wenx in TIAN, A Model for the VRPTW with Re-used Vehicles and Improved Ant Colony Optimization, Systems Engineering, Vol. 25(4)( 2007), p.20~25.

[4] Xiaobo WANG , Yijun LI, Study on multi-type vehicles and single centre vehicle routing problem with backhauls, Journal of Systems Engineering, Vol. 25(5)( 2010), pp.629-636.

[5] Guishana JIANG, Zhibin JIANG , Shujun LIU, Improved Guided Local Search based Algorithm for Period Vehicle Routing Problem, Journal of Shanghai Jiaotong University, Vol. 44(9)( 2010), p.1171~1175.

[6] Lourenco, H., & Serra, D. Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing, Vol. 9(2-3)( 2002), pp.209-234.

[7] Martin, O., Otto, S. W., & Felten, E. W., Large-step Markov chains for the traveling salesman problem. Complex Systems, Vol. 5(3)( 1991), pp.299-326.

[8] Bräysy Olli, Geir Hasle. A multi-start local search algorithm for the vehicle routing problem with time windows European Journal of Operational Research, Vol. 159(2004), p.586~605.

DOI: 10.1016/s0377-2217(03)00435-1

[9] Clarke,G., Wright. J.W. Scheduling of vehicles from a central depot to a number of delivery points Oper. Res. Vol. 12(1964), p.568~581.

DOI: 10.1287/opre.12.4.568

[10] Gillett B, Miller L. A heuristic algorithm for the vehicle dispatch problem. Operations Research, Vol. 22(1974), p.340–9.

DOI: 10.1287/opre.22.2.340

[11] Solomon M.M. , On the Worst-Case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Networks, Vol. 16(1986), pp.161-174.

DOI: 10.1002/net.3230160205

[12] Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints Oper. Res. Vol. 35(1987), p.254~265.

DOI: 10.1287/opre.35.2.254

[13] Information on http: /web. cba. neu. edu/~msolomon/problems. htm.