Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30172
Optimization Technique in Scheduling Duck Tours

Authors: Norhazwani M. Y., Khoo, C. F., Hasrul Nisham R.

Abstract:

Tourism industries are rapidly increased for the last few years especially in Malaysia. In order to attract more tourists, Malaysian Governance encourages any effort to increase Malaysian tourism industry. One of the efforts in attracting more tourists in Malacca, Malaysia is a duck tour. Duck tour is an amphibious sightseeing tour that works in two types of engines, hence, it required a huge cost to operate and maintain the vehicle. To other country, it is not so new but in Malaysia, it is just introduced, thus it does not have any systematic routing yet. Therefore, this paper proposed an optimization technique to formulate and schedule this tour to minimize the operating costs by considering it into Travelling Salesman Problem (TSP). The problem is then can be solved by one of the optimization technique especially meta-heuristics approach such as Tabu Search (TS) and Reactive Tabu Search (RTS).

Keywords: Optimization, Reactive Tabu Search, Tabu Search, Travelling Salesman Problem

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1071944

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1364

References:


[1] Battiti, R. & Tecchiolli, G., "The Reactive Tabu Search." ORSA Journal on Computing, Vol 6, pp. 126-140, (1994).
[2] Cordeau, J. F. & Laporte, G., "Modeling and Optimization of Vehicle Routing and Arc Routing Problems." Handbook of Production Scheduling, Springer-s International Series in Opreations Research & Management Science, Vol 88, pp.151-191, (2006).
[3] Fowler, J. W., Monch, L. & Rose, O., "Scheduling and Simulation: The Role of Simulation in Scheduling." Handbook of Production Scheduling, Springer-s International Series in Opreations Research & Management Science, Vol 89, pp.109-133, (2006).
[4] Gendreau, M., "An Introduction to Tabu Search." Working Paper, Departement d-informatique et de recherché operationnelle, Universite de Montreal, Canada, (2002).
[5] Glover, F. & Laguna, M., "Tabu Search." Kluwer Academic Publishers, (1997).
[6] Glover, F., "Tabu Search - Part I." ORSA Journal on Computing 1, Vol. 3, pp. 190-206, (1989).
[7] Glover, F., "Tabu Search - Part II." ORSA Journal on Computing 2, Vol 1, pp. 4-32, (1990).
[8] Hillier, F. S. & Lieberman, G. J., "Introduction to Operations Research." New York: Mc Graw Hill, 8th ed., (2005).
[9] Junger, M., Reinelt, G. & Rinaldi, G., "The Travelling Salesman Problem." Handbooks in Operations Research and Management Science, Chapter 4, Vol. 7, pp. 225-330, (1995).
[10] Kumral, M. & Dimitrakopoulos, R., "Selection of Waste Dump Sites Using a Tabu Search Algorithm." Journal South Afr. Inst. Min. Metallurgy, Vol. 108, pp. 9-13, (2008).
[11] Laporte, G., "The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithm." European Journal of Operational Research, Vol 59, pp. 231-247, (1992).
[12] Mourao, M. C. & Amado, L., "Heuristics Method for a Mixed Capacitated Arc Routing Problem: A Refuse Collection Application." European Journal of Operational Research, Vol. 160, pp 139-153, (2005).
[13] Norhazwani, M.Y., "Reactive Tabu Search Approach for Solving Capacitated Arc Routing Problem." Master Thesis, Universiti Teknologi Malaysia, (2009).
[14] Park, J. & Kim, B. I., "The School Bus Routing Problem: A Review." European Journal of Operational Research, Vol. 202, pp. 311-319, (2010).
[15] Wassan, N. A., "A Reactive Tabu Search For the Vehicle Routing Problem." Journal of the Operational Research Society, Vol 57, pp. 111- 116, (2006).
[16] Zaitul Marlizawati, Z., "Constructive and Tabu Search Heuristics for Capacitated Continuous Location-Allocation Problem." PhD Thesis, The University of Birmingham, England, (2004).
[17] Zuhaimy, I. & Norhazwani, M. Y., "Reactive Tabu Search Approach for Scheduling Solid Waste Collection Problems." Australian Journal of Basic and Applied Sciences, Vol 4(10), pp. 5171-5177, (2010).