Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Downloads (Pure)

Abstract

Shortest path finding has been a challenging task in most of the complex multipath scenarios. The complexity rises with the introduction of constraints to the scenarios. Healthcare service to the patient is one of the real world problems where travelling path has significant impact on the service time. The purpose of this research is to develop new approach to solve multiple travelling salesman problem (MTSP) for healthcare staff members offering healthcare services at patients homes travelling in different routes with the minimum total cost. The proposed approach uses Genetic Algorithm (GA) combined with Constructive Scheduling, Local Search, and Adaptive Technique to increase the efficiency. A case study with 45 patient task locations is generated according to referenced work. The result shows that the combined algorithms explore improved solution than that of the traditional GA. Constructive Scheduling using K-mean algorithm is applied to generate initial chromosome which provides improved results with acceptable computational time. Also, Adaptive GA shows a few different solutions to the traditional GA. All these approaches are beneficial to the traditional method in shortest path finding problems.
Original languageEnglish
Title of host publication10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016
PublisherIEEE
Pages274-280
Number of pages7
ISBN (Electronic)978-1-5090-3298-3
ISBN (Print)978-1-5090-3299-0
DOIs
Publication statusPublished - 4 May 2017
Event2016 10th International conference on software; knowledge, information management & applications - Chengdu, China
Duration: 15 Dec 201617 Dec 2016

Conference

Conference2016 10th International conference on software; knowledge, information management & applications
Abbreviated titleSKIMA
CountryChina
CityChengdu
Period15/12/1617/12/16

Fingerprint

Adaptive algorithms
Genetic algorithms
Scheduling
Traveling salesman problem
Chromosomes
Costs

Keywords

  • scheduling
  • biological cells
  • medical services
  • genetic algorithms
  • mathematical model
  • software
  • information management

Cite this

Sinthamrongruk, T., & Dahal, K. (2017). Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique. In 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016 (pp. 274-280). IEEE. https://doi.org/10.1109/SKIMA.2016.7916232
Sinthamrongruk, Thepparit ; Dahal, Keshav. / Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique. 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016 . IEEE, 2017. pp. 274-280
@inproceedings{af38b5f4e641404f9c388a5bfd5cc4de,
title = "Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique",
abstract = "Shortest path finding has been a challenging task in most of the complex multipath scenarios. The complexity rises with the introduction of constraints to the scenarios. Healthcare service to the patient is one of the real world problems where travelling path has significant impact on the service time. The purpose of this research is to develop new approach to solve multiple travelling salesman problem (MTSP) for healthcare staff members offering healthcare services at patients homes travelling in different routes with the minimum total cost. The proposed approach uses Genetic Algorithm (GA) combined with Constructive Scheduling, Local Search, and Adaptive Technique to increase the efficiency. A case study with 45 patient task locations is generated according to referenced work. The result shows that the combined algorithms explore improved solution than that of the traditional GA. Constructive Scheduling using K-mean algorithm is applied to generate initial chromosome which provides improved results with acceptable computational time. Also, Adaptive GA shows a few different solutions to the traditional GA. All these approaches are beneficial to the traditional method in shortest path finding problems.",
keywords = "scheduling, biological cells, medical services, genetic algorithms, mathematical model, software, information management",
author = "Thepparit Sinthamrongruk and Keshav Dahal",
year = "2017",
month = "5",
day = "4",
doi = "10.1109/SKIMA.2016.7916232",
language = "English",
isbn = "978-1-5090-3299-0",
pages = "274--280",
booktitle = "10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016",
publisher = "IEEE",
address = "United States",

}

Sinthamrongruk, T & Dahal, K 2017, Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique. in 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016 . IEEE, pp. 274-280, 2016 10th International conference on software; knowledge, information management & applications, Chengdu, China, 15/12/16. https://doi.org/10.1109/SKIMA.2016.7916232

Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique. / Sinthamrongruk, Thepparit; Dahal, Keshav.

10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016 . IEEE, 2017. p. 274-280.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique

AU - Sinthamrongruk, Thepparit

AU - Dahal, Keshav

PY - 2017/5/4

Y1 - 2017/5/4

N2 - Shortest path finding has been a challenging task in most of the complex multipath scenarios. The complexity rises with the introduction of constraints to the scenarios. Healthcare service to the patient is one of the real world problems where travelling path has significant impact on the service time. The purpose of this research is to develop new approach to solve multiple travelling salesman problem (MTSP) for healthcare staff members offering healthcare services at patients homes travelling in different routes with the minimum total cost. The proposed approach uses Genetic Algorithm (GA) combined with Constructive Scheduling, Local Search, and Adaptive Technique to increase the efficiency. A case study with 45 patient task locations is generated according to referenced work. The result shows that the combined algorithms explore improved solution than that of the traditional GA. Constructive Scheduling using K-mean algorithm is applied to generate initial chromosome which provides improved results with acceptable computational time. Also, Adaptive GA shows a few different solutions to the traditional GA. All these approaches are beneficial to the traditional method in shortest path finding problems.

AB - Shortest path finding has been a challenging task in most of the complex multipath scenarios. The complexity rises with the introduction of constraints to the scenarios. Healthcare service to the patient is one of the real world problems where travelling path has significant impact on the service time. The purpose of this research is to develop new approach to solve multiple travelling salesman problem (MTSP) for healthcare staff members offering healthcare services at patients homes travelling in different routes with the minimum total cost. The proposed approach uses Genetic Algorithm (GA) combined with Constructive Scheduling, Local Search, and Adaptive Technique to increase the efficiency. A case study with 45 patient task locations is generated according to referenced work. The result shows that the combined algorithms explore improved solution than that of the traditional GA. Constructive Scheduling using K-mean algorithm is applied to generate initial chromosome which provides improved results with acceptable computational time. Also, Adaptive GA shows a few different solutions to the traditional GA. All these approaches are beneficial to the traditional method in shortest path finding problems.

KW - scheduling

KW - biological cells

KW - medical services

KW - genetic algorithms

KW - mathematical model

KW - software

KW - information management

U2 - 10.1109/SKIMA.2016.7916232

DO - 10.1109/SKIMA.2016.7916232

M3 - Conference contribution

SN - 978-1-5090-3299-0

SP - 274

EP - 280

BT - 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016

PB - IEEE

ER -

Sinthamrongruk T, Dahal K. Route scheduling for HSSP using adaptive genetic algorithm with constructive scheduling technique. In 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA), 2016 . IEEE. 2017. p. 274-280 https://doi.org/10.1109/SKIMA.2016.7916232