VEHICLE ROUTING PROBLEM IN A MEDICAL FACILITY WASTE COLLECTION Page 95 of 100
COMPANY: A COMPARATIVE ANALYSIS OF GUIDED LOCAL SEARCH, SIMULATED ANNEALING AND TABU SEARCH ALGORITHM
Michael Anderson REFERENCES
Akhtar, M. et al., 2016. Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization. Waste Management.
Cabrera-Ruiz, J. et al., 2011. Evaluation of Stochastic Global Optimization Methods in the Design of Complex Distillation Configurations. In: L. Dritsas, ed. Stochastic Optimization - Seeing the Optimal for the Uncertain. Rijeka: INTECH, pp. 441-456.
Carr, M. & Verner, J., 2014. Prototyping and Software Development Approaches, s.l.:
s.n.
Clarke, G. & Wright, J. W., 1964. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12(4), pp. 568-581.
Dantzig, G. B. & Ramser, J. H., 1959. The Truck Dispatching Problem. Management Science, 6(1), pp. 80-91.
Dhaenens, C. & Jourdan, L., 2016. Metaheuristics for Big Data. 1st ed. London: ISTE Ltd and John Wiley & Sons, Inc..
Fera, M. et al., 2013. Production Scheduling Apporaches for Operations Management.
s.l.:INTECH.
He, Y., Miao, W., Xie, R. & Shi, Y., 2014. A Tabu Search Algorithm with Variable Cluster Grouping for Multi-depot Vehicle Routing Problem. s.l., IEEE.
Jain, H., 2017. Problems Solving in Data Structures & Algorithms Using C#. 1st ed.
Bhopal: Hemant Jain.
Kwarteng, S. O., 2011. Private Sector Involvement in Urban Solid Waster. 1st ed. Boca Raton: Taylor & Francis Group.
Laporte, G., 2009. Fifty Years of Vehicle Routing. Transportation Science, 43(4), pp.
408-416.
VEHICLE ROUTING PROBLEM IN A MEDICAL FACILITY WASTE COLLECTION Page 96 of 100
COMPANY: A COMPARATIVE ANALYSIS OF GUIDED LOCAL SEARCH, SIMULATED ANNEALING AND TABU SEARCH ALGORITHM
Michael Anderson Liang, Y. D., 2013. Introduction to Programming using Python. 1st ed. New Jersey:
Pearson.
Moraga, R. J., 2016. Metaheuristic for Randomized Priority Search (Meta-RaPS): A Tutorial. In: G. Rabadi, ed. Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. Illinois: Springer International Publishing Switzerland, pp.
95-108.
Nikolaev, A. G. & Jacobson, S. H., 2010. Simulated Annealing. In: M. Gendreau & J.
Potvin, eds. Handbook of Metaheuristics. London: Springer, pp. 1-39.
Peh, S. C. W. & Hong, J. L., 2016. GLSDock-Drug Design Using Guided Local Search.
In: O. G. e. al., ed. Computational Science and Its Applications. Beijing: Springer, pp.
11-21.
Pereira, F. B. & Tavares, J., 2009. Bio-inspired Algorithms for the Vehicle Routing Problem. 161 ed. Berlin: Springer.
Quesnelle, J., 2015. A comparison of Guided Local Search and NSGA-III for solving
multi-objective optimization problems. [Online]
Available at: http://jeffq.com/
[Accessed 11 April 2018].
Rothlauf, F., 2011. Design of Modern Heuristics. 1st ed. Berlin: Springer.
Sabale, R. G. & Dani, A. R., 2012. Comparative Study of Prototype Model For Software. IOSR Journal of Engineering, 2(7), pp. 21-24.
SIAM, 2015. Vehicle routing : problems, methods, and applications. 2nd ed.
Philadelphia: Mathematical Optimization Society and Society for Industrial and Applied Mathematics.
Silvestrin, P. V. & Ritt, M., 2016. An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem. Computers and Operations Research.
VEHICLE ROUTING PROBLEM IN A MEDICAL FACILITY WASTE COLLECTION Page 97 of 100
COMPANY: A COMPARATIVE ANALYSIS OF GUIDED LOCAL SEARCH, SIMULATED ANNEALING AND TABU SEARCH ALGORITHM
Michael Anderson Tarantilis, C. D., Zachariadis, E. E. & Kiranoudis, C. T., 2008. A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities.
INFORMS Journal on Computing, 20(1), pp. 154-168.
Yang, X. S., 2018. Nature-Inspired Algorithms and Applied Optimization. 1st ed.
London: Springer.
Yu, V. F., A.A.N., P. R., Agustina, Y. & Wibowo, O. J., 2016. A Simulated Annealing Heuristic for the Hybrid Vehicle Routing Problem. Applied Soft Computing.
