The goal of IJTTE is to broaden the knowledge of traffic and transport experts and academicians by promoting free access and provide valuable insight to transport related information, research and ideas. IJTTE will serve as a great resource for researchers and students across the globe.
Volume List  / Volume 5 (1)

Article

TWO-PHASE ALGORITHM FOR SOLVING HETEROGENEOUS TRAVELLING REPAIRMEN PROBLEM WITH TIME WINDOWS

DOI: 10.7708/ijtte.2015.5(1).08


5 / 1 / 64-73 Pages

Author(s)

Nenad Bjelić - University of Belgrade, Faculty of Transport and Traffic Engineering, Vojvode Stepe 305, 11000, Belgrade, Serbia -

Dražen Popović - University of Belgrade, Faculty of Transport and Traffic Engineering, Vojvode Stepe 305, 11000, Belgrade, Serbia -


Abstract

Heterogeneous travelling repairmen problem with time windows (hetTRPTW) is customer oriented problem with large possibilities for practical applications in logistics area. Models and algorithms developed for solving one problem with a cumulative objective function may be, with a little effort, transformed for solving similar problem with a cumulative function. In that sense, aim of this paper is to present results obtained by implementing an algorithm developed for solving cumulative capacitated vehicle routing problem in solving hetTRPTW.


Download Article

Number of downloads: 2173

Keywords:
heterogeneous travelling repairmen problem with time windows; two phase local search; variable neighborhood descent;


Acknowledgements:

This paper is partially supported by the Ministry of education, science and technological development of the Government of the Republic of Serbia trough the project TR36006 in the period 2011-2014.


References:

Bjelić, N.; Vidović, M.; Miljuš, M. 2010. Two mathematical modells of the Handling Devices Allocation Problem. In Proceedings of the XXXVII operations research symposium - SYMOPIS 2010, 349-352 (In Serbian).

 

Bjelić, N.; Vidović, M. 2011. Memetic algorithm for Dynamic Handling Device Allocation Problem. In Proceedings of the XXXVIII operations research symposium - SYMOPIS 2011, 359-362 (In Serbian).

 

Bjelić, N.; Vidović, M.; Popović, D.; Ratković, B. 2013a. Genetic algorithm for solving travelling repairman problem with time windows. In Proceedings of the XL operations research symposium - SYMOPIS 2013, 509-514 (In Serbian).

 

Bjelić, N.; Vidović, M.; Popović, D. 2013b. Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows, Expert Systems with Applications. DOI: http://dx.doi.org/10.1016/j.eswa.2013.05.036, 40(15): 5997-6006.

 

Chaudhuri, K.; Godfrey, B.; Rao, S.; Talwar, K. 2003. Paths, trees, and minimum latency tours. In Proceedings of 44th symposium on foundations of computer science (FOCS), 36-45.

 

Fischetti, M.; Laporte, G.; Martello, S. 1993. The delivery man problem and cumulative matroids, Operations Research. DOI: http://dx.doi.org/10.1287/opre.41.6.1055, 41(6): 1055-1064.

 

García, A.; Jodrá, P.; Tejel, J. 2002. A note on the traveling repairman problem, Networks. DOI: http://dx.doi.org/10.1002/net.10031, 40(1): 27-31.

 

Heilporn, G.; Cordeau, J.; Laporte, G. 2010. The delivery man problem with time windows, Discrete Optimization. DOI: http://dx.doi.org/10.1016/j.disopt.2010.06.002, 7(4): 269-282.

 

Ke, L.; Feng, Z. 2013. A two-phase metaheuristic for the cumulative capacitated vehicle routing problem, Computers & Operations Research. DOI: http://dx.doi.org/10.1016/j.cor.2012.08.020, 40(2): 633-638.

 

Lysgaard, J.; Wøhlk, S. 2014. A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, European Journal of Operational Research. DOI: http://dx.doi.org/10.1016/j.ejor.2013.08.032, 236(3): 800-810.

 

Mladenović, N.; Urošević, D.; Hanafi, S. 2013. Variable neighborhood search for the traveling deliveryman problem, 4OR: A Quarterly Journal of Operations Research. DOI: http://dx.doi.org/10.1007/s10288-012-0212-1, 11(1): 57-73.

 

Ngueveu, U.S.; Prins, C.; Wolfler-Calvo, R. 2010. An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers and Operations Research. DOI: http://dx.doi.org/10.1016/j.cor.2009.06.014, 37(11): 1877-1885.

 

Ribeiro, G.M.; Laporte, G. 2012. An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Computers and Operations Research. DOI: http://dx.doi.org/10.1016/j.cor.2011.05.005, 39(3): 728-735.

 

Salehipour, A.; Sorensen, K.; Goos, P.; Braysy, O. 2011. Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, 4OR: A Quarterly Journal of Operations Research. DOI: http://dx.doi.org/10.1007/s10288-011-0153-0, 9(2): 189-209.

 

Silva, M.; Subramanian, A.; Vidal, T.; Ochi, S. 2012. A simple and effective metaheuristic for the minimum latency problem, European Journal of Operational Research. DOI: http://dx.doi.org/10.1016/j.ejor.2012.03.044, 221(3): 513-520.

 

Tsitsikils, J. 1992. Special cases of traveling salesman and repairman problem with time windows, Networks, 22: 263-282.

 

Van der Meer, R. 2000. Operational control of internal transport. PhD thesis, University of Rotterdam.

 

Wu, Y.; Huang, Z-N.; Zhan, F-J. 2004. Exact algorithm for the minimum latency problem, Information Processing Letters. DOI: http://dx.doi.org/10.1016/j.ipl.2004.09.009, 92(6): 303-309.


Quoted IJTTE Works

There is no quoted studies.



Related Keywords

There is no related studies.