A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP)

Arindam Roy; Goutam Chakraborty; Indadul Khan; Samir Maity; Manoranjan Maiti

doi:10.1007/978-981-10-7814-9_20

A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP)

Arindam Roy^*, Goutam Chakraborty, Indadul Khan, Samir Maity, Manoranjan Maiti

^*Kontaktforfatter

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

1 Citationer (Scopus)

Abstract

In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap operator-based particle swarm optimization (PSO). The initial solutions are produced by proposed GA which used as swarm in PSO. The said hybrid algorithm (GA-PSO) is tested against some test functions, and efficiency of the proposed algorithm is established. The r-4DTSPs are considered with crisp costs. The models are illustrated with some numerical data.

Originalsprog	Engelsk
Titel	Operations Research and Optimization - FOTA 2016
Redaktører	Samarjit Kar, Xiang Li, Ujjwal Maulik
Antal sider	18
Forlag	Springer Publishing Company
Publikationsdato	2018
Sider	285-302
ISBN (Trykt)	9789811078132
DOI	https://doi.org/10.1007/978-981-10-7814-9_20
Status	Udgivet - 2018
Begivenhed	1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016 - Kolkatta, Indien Varighed: 24 nov. 2016 → 26 nov. 2016

Konference

Konference	1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016
Land/Område	Indien
By	Kolkatta
Periode	24/11/2016 → 26/11/2016

Navn	Springer Proceedings in Mathematics and Statistics
Vol/bind	225
ISSN	2194-1009

Bibliografisk note

Publisher Copyright:
© 2018, Springer Nature Singapore Pte Ltd.

Adgang til dokumentet

10.1007/978-981-10-7814-9_20

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Andre filer og links

Link to publication in Scopus

Citationsformater

@inproceedings{90872f5a984049ecbae080f7e1ca9b88,

title = "A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP)",

abstract = "In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap operator-based particle swarm optimization (PSO). The initial solutions are produced by proposed GA which used as swarm in PSO. The said hybrid algorithm (GA-PSO) is tested against some test functions, and efficiency of the proposed algorithm is established. The r-4DTSPs are considered with crisp costs. The models are illustrated with some numerical data.",

keywords = "GA-PSO, Hybrid algorithm, r-4DTSP",

author = "Arindam Roy and Goutam Chakraborty and Indadul Khan and Samir Maity and Manoranjan Maiti",

note = "Funding Information: Acknowledgements This research article is supported by University Grant Commission of India by grant number PSW-150/14-15 (ERO). Publisher Copyright: {\textcopyright} 2018, Springer Nature Singapore Pte Ltd.; 1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016 ; Conference date: 24-11-2016 Through 26-11-2016",

year = "2018",

doi = "10.1007/978-981-10-7814-9_20",

language = "English",

isbn = "9789811078132",

series = "Springer Proceedings in Mathematics and Statistics",

publisher = "Springer Publishing Company",

pages = "285--302",

editor = "Samarjit Kar and Xiang Li and Ujjwal Maulik",

booktitle = "Operations Research and Optimization - FOTA 2016",

address = "United States",

}

Roy, A, Chakraborty, G, Khan, I, Maity, S & Maiti, M 2018, A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP). i S Kar, X Li & U Maulik (red), Operations Research and Optimization - FOTA 2016. Springer Publishing Company, Springer Proceedings in Mathematics and Statistics, bind 225, s. 285-302, 1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016, Kolkatta, Indien, 24/11/2016. https://doi.org/10.1007/978-981-10-7814-9_20

A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP). / Roy, Arindam; Chakraborty, Goutam; Khan, Indadul et al.
Operations Research and Optimization - FOTA 2016. red. / Samarjit Kar; Xiang Li; Ujjwal Maulik. Springer Publishing Company, 2018. s. 285-302 (Springer Proceedings in Mathematics and Statistics, Bind 225).

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

TY - GEN

T1 - A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP)

AU - Roy, Arindam

AU - Chakraborty, Goutam

AU - Khan, Indadul

AU - Maity, Samir

AU - Maiti, Manoranjan

N1 - Funding Information: Acknowledgements This research article is supported by University Grant Commission of India by grant number PSW-150/14-15 (ERO). Publisher Copyright: © 2018, Springer Nature Singapore Pte Ltd.

PY - 2018

Y1 - 2018

N2 - In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap operator-based particle swarm optimization (PSO). The initial solutions are produced by proposed GA which used as swarm in PSO. The said hybrid algorithm (GA-PSO) is tested against some test functions, and efficiency of the proposed algorithm is established. The r-4DTSPs are considered with crisp costs. The models are illustrated with some numerical data.

AB - In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap operator-based particle swarm optimization (PSO). The initial solutions are produced by proposed GA which used as swarm in PSO. The said hybrid algorithm (GA-PSO) is tested against some test functions, and efficiency of the proposed algorithm is established. The r-4DTSPs are considered with crisp costs. The models are illustrated with some numerical data.

KW - GA-PSO

KW - Hybrid algorithm

KW - r-4DTSP

UR - http://www.scopus.com/inward/record.url?scp=85045324013&partnerID=8YFLogxK

U2 - 10.1007/978-981-10-7814-9_20

DO - 10.1007/978-981-10-7814-9_20

M3 - Article in proceeding

AN - SCOPUS:85045324013

SN - 9789811078132

T3 - Springer Proceedings in Mathematics and Statistics

SP - 285

EP - 302

BT - Operations Research and Optimization - FOTA 2016

A2 - Kar, Samarjit

A2 - Li, Xiang

A2 - Maulik, Ujjwal

PB - Springer Publishing Company

T2 - 1st International Conference on Frontiers in Optimization: Theory and Applications, FOTA 2016

Y2 - 24 November 2016 through 26 November 2016

ER -

A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP)

Abstract

Konference

Bibliografisk note

Adgang til dokumentet

AUB Link

Andre filer og links

Fingeraftryk

Citationsformater