A VARIABLE NEIGHBORHOOD SEARCH FOR THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM

Authors

  • Arif Imran School of Industrial Engineering, Telkom University, Bandung 40257, Indonesia
  • Martino Luis Othman Yeop Abdullah Graduate School of Business, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah Darul Aman, Malaysia
  • Liane Okdinawati School of Business Management, Bandung Institute of Technology, Bandung, 40190, Indonesia

DOI:

https://doi.org/10.11113/jt.v78.6062

Keywords:

Heuristic, routing, heterogeneous, multi-level, variable neighborhood search

Abstract

The heterogeneous fixed fleet vehicle routing problem (HFFVRP) is investigated using the variable neighborhood search (VNS). The initial solution is generated using the Sweep algorithm and the 2-opt procedure and then the customers are allocated to the smallest vehicle first by considering vehicle occupancy level. The proposed VNS algorithm uses several neighborhoods and a number of local search methods which are adapted for this problem. The local searches are implemented within a multi-level framework. The performance of the proposed algorithm is then tested using data set taken from literature and the experiments show competitive results with less computing time. Future research directions are also highlighted.  

Author Biographies

  • Arif Imran, School of Industrial Engineering, Telkom University, Bandung 40257, Indonesia

    School of Industrial Engineering

    Senior Lecturer

  • Martino Luis, Othman Yeop Abdullah Graduate School of Business, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah Darul Aman, Malaysia

    Othman Yeop Abdullah Graduate School of Business,

    Senior Lecturer

  • Liane Okdinawati, School of Business Management, Bandung Institute of Technology, Bandung, 40190, Indonesia

    School of Business Management

    Senior Lecturer

References

Taillard, E.D. 1999. A Heuristic Column Generation Method for the Heterogeneous Fleet VRP. Recherche Operationnelle. 33: 1-14.

Salhi, S., Sari, M., Sadi, D., and Touati, N. 1992. Adaptation of Some Vehicle Fleet Mix Heuristic. Omega. 20: 653-660.

Tarantilis, C. D., Kiranoudis, C. T., and Vassiliadis, V. S. 2003. A List Based Threshold Accepting Metaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem. Journal of the Operational Research Society. 54: 65-71.

Tarantilis, C. D., Kiranoudis, C. T., and Vassiliadis, V. S. 2004. A Threshold Accepting Metaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem. European Journal of Operational Research. 152: 148-158.

Li, F.Y., Golden, B., and Wasil, E. 2007. A Record-to-Record Travel Algorithm for Solving the Heterogeneous Fleet Vehicle Routing Problem. Computers & Operations Research. 34: 2734-2742.

Dueck, G. 1993. New Optimization Heuristics: The Great Deluge Algorithm and Record to Record Travel. Journal of Computation Physics. 104: 86-92.

Euchi, J. and Chabchoub, H. 2010. A Hybrid Tabu Search to Solve the Heterogeneous Fixed Fleet Vehicle Routing Problem. Logistics Research. 2: 3-11.

Brandao, J. 2011. A Tabu Search Algorithm for the Heterogeneous Fixed Fleet Vehicle Routing Problem. Computers & Operations Research. 38: 140-151.

Tarantilis, C. D. and Kiranoudis, C. T. 2002. Distribution of Fresh Meat. Journal of Food Engineering 51: 85-91.

Tarantilis, C. D. and Kiranoudis, C. T. 2002. BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management. Annals of Operations Research. 115: 227-241.

Levy, L. 2005. Private Communication. RouteSmart Technologies, Inc.

Salhi, S. and Rand, G. K. 1993. Incorporating Vehicle Routing into the Vehicle Fleet Composition Problem. European Journal of Operational Research. 66: 313-360.

Brimberg, J. and Mladenović, N. 1996. Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem. Studies in Locational Analysis. 10: 1-12.

Hansen P. and Mladenović, N. 1997. Variable Neighbourhood Search for the p-Median. Location Science. 5: 207-225.

Mladenović, N., and Hansen, P. 1997. Variable Neighbourhood Search. Computers & Operations Research. 24: 1097-1100.

Hansen, P. and Mladenović, N. 2001. Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research. 130: 449-467.

Hansen, P., Mladenović, N., and Moreno Perez, J. A. 2010. Variable Neighborhood Search: Methods and Applications. Annals of OR. 175: 367-407.

Salhi, S., and Sari, M. 1997. A Multi-Level Composite Heuristic for the Multi-Depot Vehicle Fleet Mix Problem. European Journal of Operational Research. 103: 95-112.

Gillett, B. E., and Miller, L. R. 1974. A Heuristic Algorithm for the Vehicle Dispatch Problem. Operations Research. 22: 340-344.

Lin, S. 1965. Computers Solutions of the Traveling Salesman Problem. Bell System Technical Journal. 44: 2245-2269.

Imran, A., Salhi, S., and Wassan, N. A. 2009. A Variable Neighborhood-Based Heuristic for the Heterogeneous Fleet Vehicle Routing Problem. European Journal of Operational Research. 197: 509-518.

Salhi, S., and Rand, G.K. 1987. Improvements to Vehicle Routing Heuristics. Journal of the Operational Research Society. 38: 293-295.

Golden, B., Assad, A., Levy, L., and Gheysens, F. G. 1984. The Fleet Size and Mix Vehicle Routing Problem. Computers and Operations Research. 11: 49-66.

Downloads

Published

2016-08-28

Issue

Section

Science and Engineering

How to Cite

A VARIABLE NEIGHBORHOOD SEARCH FOR THE HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM. (2016). Jurnal Teknologi (Sciences & Engineering), 78(9). https://doi.org/10.11113/jt.v78.6062