A customized genetic algorithm for bi-objective routing in a dynamic network

•A bi-objective moving target travelling salesman problem is considered.•An integer linear programming model based on predicted trajectories is introduced.•A fast probabilistic dynamic programming based heuristic is proposed.•A hybrid customized genetic algorithm is developed and used in maritime lo...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 297; no. 2; pp. 615 - 629
Main Authors:	Maskooki, Alaleh, Deb, Kalyanmoy, Kallio, Markku
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2022
Subjects:	Dynamic network Dynamic programming Genetic algorithms Moving-target traveling salesman problem Moving-target traveling salesman problem Dynamic network Dynamic programming Genetic algorithms
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!